./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/types/string_literal_assignment_4.sol_1_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:23:55,940 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:23:55,977 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4570a331-f9c2-4734-a53a-832673d08d1a/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:23:55,980 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:23:55,980 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:23:55,992 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:23:55,993 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:23:55,993 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:23:55,993 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:23:55,993 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:23:55,993 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:23:55,993 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:23:55,993 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:23:55,993 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:23:55,993 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:23:55,994 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:23:55,994 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:23:55,994 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:23:55,994 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:23:55,995 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:23:56,173 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:23:56,179 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:23:56,181 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:23:56,181 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:23:56,182 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:23:56,182 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4570a331-f9c2-4734-a53a-832673d08d1a/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/types/string_literal_assignment_4.sol_1_no_adts_000.smt2
[2025-05-07 17:23:56,184 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:23:56,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:23:56,386 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4570a331-f9c2-4734-a53a-832673d08d1a/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/types/string_literal_assignment_4.sol_1_no_adts_000.smt2
[2025-05-07 17:23:56,388 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:23:56,389 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:23:56,390 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:23:56,390 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:23:56,390 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:23:56,392 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,420 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56 Unit
[2025-05-07 17:23:56,420 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:23:56,421 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:23:56,421 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:23:56,421 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:23:56,432 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,432 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,452 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,452 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,456 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,457 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,458 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,460 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,461 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,471 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:23:56,471 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:23:56,471 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:23:56,471 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:23:56,472 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (1/1) ...
[2025-05-07 17:23:56,474 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:23:56,482 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:23:56,492 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:23:56,495 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:23:56,505 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:23:56,506 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:23:56,506 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:23:56,506 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:23:56,506 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:23:56,506 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:23:56,506 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,506 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_f__49_50_0
[2025-05-07 17:23:56,506 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_f__49_50_0
[2025-05-07 17:23:56,506 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,506 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_f__49_50_0
[2025-05-07 17:23:56,507 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_f__49_50_0
[2025-05-07 17:23:56,507 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,507 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__49_50_0
[2025-05-07 17:23:56,507 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__49_50_0
[2025-05-07 17:23:56,507 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_function_g__12_50_0 given in one single declaration
[2025-05-07 17:23:56,507 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_function_g__12_50_0
[2025-05-07 17:23:56,507 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_function_g__12_50_0
[2025-05-07 17:23:56,507 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_g__12_50_0 given in one single declaration
[2025-05-07 17:23:56,507 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_g__12_50_0
[2025-05-07 17:23:56,507 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_g__12_50_0
[2025-05-07 17:23:56,507 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_return_function_g__12_50_0 given in one single declaration
[2025-05-07 17:23:56,507 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_return_function_g__12_50_0
[2025-05-07 17:23:56,507 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_return_function_g__12_50_0
[2025-05-07 17:23:56,508 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_g_11_50_0 given in one single declaration
[2025-05-07 17:23:56,508 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_g_11_50_0
[2025-05-07 17:23:56,508 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_g_11_50_0
[2025-05-07 17:23:56,508 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_function_g__12_50_0 given in one single declaration
[2025-05-07 17:23:56,508 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_function_g__12_50_0
[2025-05-07 17:23:56,508 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_function_g__12_50_0
[2025-05-07 17:23:56,508 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_f_48_50_0 given in one single declaration
[2025-05-07 17:23:56,508 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_f_48_50_0
[2025-05-07 17:23:56,508 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_f_48_50_0
[2025-05-07 17:23:56,508 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,508 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_f__49_50_0
[2025-05-07 17:23:56,508 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_f__49_50_0
[2025-05-07 17:23:56,508 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_return_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,508 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_return_function_f__49_50_0
[2025-05-07 17:23:56,509 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_return_function_f__49_50_0
[2025-05-07 17:23:56,509 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_f__49_50_0
[2025-05-07 17:23:56,509 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_f__49_50_0
[2025-05-07 17:23:56,509 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_f__49_50_0 given in one single declaration
[2025-05-07 17:23:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_f__49_50_0
[2025-05-07 17:23:56,509 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_f__49_50_0
[2025-05-07 17:23:56,509 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_50_0 given in one single declaration
[2025-05-07 17:23:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_50_0
[2025-05-07 17:23:56,509 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_50_0
[2025-05-07 17:23:56,509 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_50_0 given in one single declaration
[2025-05-07 17:23:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_50_0
[2025-05-07 17:23:56,509 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_50_0
[2025-05-07 17:23:56,509 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_20_C_50_0 given in one single declaration
[2025-05-07 17:23:56,509 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_20_C_50_0
[2025-05-07 17:23:56,510 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_20_C_50_0
[2025-05-07 17:23:56,510 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_17_C_50_0 given in one single declaration
[2025-05-07 17:23:56,510 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_17_C_50_0
[2025-05-07 17:23:56,510 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_17_C_50_0
[2025-05-07 17:23:56,510 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_19_C_50_0 given in one single declaration
[2025-05-07 17:23:56,510 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_19_C_50_0
[2025-05-07 17:23:56,510 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_19_C_50_0
[2025-05-07 17:23:56,510 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_18_C_50_0 given in one single declaration
[2025-05-07 17:23:56,510 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_18_C_50_0
[2025-05-07 17:23:56,510 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_18_C_50_0
[2025-05-07 17:23:56,510 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:23:56,510 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:23:56,510 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:23:56,647 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:23:56,649 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:23:56,861 INFO  L?                        ?]: Removed 195 outVars from TransFormulas that were not future-live.
[2025-05-07 17:23:56,861 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:23:56,873 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:23:56,873 INFO  L312             CfgBuilder]: Removed 11 assume(true) statements.
[2025-05-07 17:23:56,873 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:23:56 BoogieIcfgContainer
[2025-05-07 17:23:56,874 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:23:56,876 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:23:56,876 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:23:56,879 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:23:56,879 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:23:56" (1/3) ...
[2025-05-07 17:23:56,880 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d00cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:23:56, skipping insertion in model container
[2025-05-07 17:23:56,880 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:56" (2/3) ...
[2025-05-07 17:23:56,880 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d00cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:23:56, skipping insertion in model container
[2025-05-07 17:23:56,880 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:23:56" (3/3) ...
[2025-05-07 17:23:56,882 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:23:56,895 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:23:56,897 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 22 procedures, 87 locations, 132 edges, 22 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:23:56,925 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:23:56,934 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2913c054, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:23:56,934 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:23:56,937 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 87 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 39 states have internal predecessors, (39), 29 states have call successors, (31), 21 states have call predecessors, (31), 21 states have return successors, (31), 26 states have call predecessors, (31), 29 states have call successors, (31)
[2025-05-07 17:23:56,943 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:23:56,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:56,944 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:56,944 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:56,947 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:56,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 1100754533, now seen corresponding path program 1 times
[2025-05-07 17:23:56,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:56,953 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114364374]
[2025-05-07 17:23:56,953 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:56,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:56,997 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:23:57,064 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:23:57,064 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:57,064 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:57,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:57,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:57,364 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114364374]
[2025-05-07 17:23:57,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114364374] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:57,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:57,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:23:57,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144491169]
[2025-05-07 17:23:57,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:57,373 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:23:57,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:57,402 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:23:57,402 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:57,405 INFO  L87              Difference]: Start difference. First operand  has 87 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 39 states have internal predecessors, (39), 29 states have call successors, (31), 21 states have call predecessors, (31), 21 states have return successors, (31), 26 states have call predecessors, (31), 29 states have call successors, (31) Second operand  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:23:57,504 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:57,504 INFO  L93              Difference]: Finished difference Result 85 states and 98 transitions.
[2025-05-07 17:23:57,506 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:23:57,507 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65
[2025-05-07 17:23:57,508 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:57,515 INFO  L225             Difference]: With dead ends: 85
[2025-05-07 17:23:57,515 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:23:57,517 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:57,520 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:57,520 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:23:57,533 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:23:57,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-05-07 17:23:57,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 27 states have call successors, (29), 21 states have call predecessors, (29), 21 states have return successors, (29), 25 states have call predecessors, (29), 27 states have call successors, (29)
[2025-05-07 17:23:57,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions.
[2025-05-07 17:23:57,553 INFO  L79                 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 65
[2025-05-07 17:23:57,554 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:57,554 INFO  L485      AbstractCegarLoop]: Abstraction has 83 states and 94 transitions.
[2025-05-07 17:23:57,554 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:23:57,554 INFO  L278                IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions.
[2025-05-07 17:23:57,556 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:23:57,556 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:57,556 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:57,556 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:23:57,557 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:57,557 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:57,557 INFO  L85        PathProgramCache]: Analyzing trace with hash -1350000119, now seen corresponding path program 1 times
[2025-05-07 17:23:57,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:57,557 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735682164]
[2025-05-07 17:23:57,557 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:57,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:57,596 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:23:57,603 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:23:57,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:57,604 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:57,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:57,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:57,690 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735682164]
[2025-05-07 17:23:57,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735682164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:57,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:57,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:57,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177251406]
[2025-05-07 17:23:57,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:57,692 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:57,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:57,692 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:57,692 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:57,693 INFO  L87              Difference]: Start difference. First operand 83 states and 94 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:57,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:57,706 INFO  L93              Difference]: Finished difference Result 87 states and 98 transitions.
[2025-05-07 17:23:57,706 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:57,706 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 68
[2025-05-07 17:23:57,706 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:57,707 INFO  L225             Difference]: With dead ends: 87
[2025-05-07 17:23:57,708 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:23:57,708 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:57,708 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:57,708 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:57,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:23:57,713 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2025-05-07 17:23:57,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 25 states have call successors, (27), 21 states have call predecessors, (27), 21 states have return successors, (27), 24 states have call predecessors, (27), 25 states have call successors, (27)
[2025-05-07 17:23:57,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions.
[2025-05-07 17:23:57,714 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 68
[2025-05-07 17:23:57,714 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:57,714 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 89 transitions.
[2025-05-07 17:23:57,715 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:57,715 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions.
[2025-05-07 17:23:57,716 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:23:57,716 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:57,716 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:57,716 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:23:57,716 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:57,716 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:57,716 INFO  L85        PathProgramCache]: Analyzing trace with hash -1124656339, now seen corresponding path program 1 times
[2025-05-07 17:23:57,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:57,716 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633742063]
[2025-05-07 17:23:57,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:57,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:57,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:23:57,751 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:23:57,751 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:57,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:57,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:57,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:57,833 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633742063]
[2025-05-07 17:23:57,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633742063] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:57,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:57,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:23:57,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284625035]
[2025-05-07 17:23:57,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:57,834 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:23:57,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:57,834 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:23:57,834 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:23:57,834 INFO  L87              Difference]: Start difference. First operand 81 states and 89 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:57,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:57,866 INFO  L93              Difference]: Finished difference Result 86 states and 95 transitions.
[2025-05-07 17:23:57,866 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:23:57,866 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) Word has length 68
[2025-05-07 17:23:57,867 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:57,867 INFO  L225             Difference]: With dead ends: 86
[2025-05-07 17:23:57,867 INFO  L226             Difference]: Without dead ends: 86
[2025-05-07 17:23:57,868 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:23:57,868 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:57,868 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 445 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:57,869 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2025-05-07 17:23:57,872 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2025-05-07 17:23:57,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 21 states have call predecessors, (28), 23 states have return successors, (30), 27 states have call predecessors, (30), 26 states have call successors, (30)
[2025-05-07 17:23:57,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions.
[2025-05-07 17:23:57,874 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 68
[2025-05-07 17:23:57,874 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:57,874 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 95 transitions.
[2025-05-07 17:23:57,874 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:57,874 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions.
[2025-05-07 17:23:57,875 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:23:57,875 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:57,875 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:57,875 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:23:57,875 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:57,876 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:57,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -939591283, now seen corresponding path program 1 times
[2025-05-07 17:23:57,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:57,876 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428584126]
[2025-05-07 17:23:57,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:57,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:57,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:23:57,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:23:57,907 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:57,907 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:58,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:58,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:58,021 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428584126]
[2025-05-07 17:23:58,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428584126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:58,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:58,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:23:58,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104719454]
[2025-05-07 17:23:58,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:58,021 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:23:58,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:58,022 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:23:58,022 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:23:58,022 INFO  L87              Difference]: Start difference. First operand 86 states and 95 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:58,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:58,054 INFO  L93              Difference]: Finished difference Result 91 states and 101 transitions.
[2025-05-07 17:23:58,054 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:23:58,054 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) Word has length 68
[2025-05-07 17:23:58,055 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:58,055 INFO  L225             Difference]: With dead ends: 91
[2025-05-07 17:23:58,055 INFO  L226             Difference]: Without dead ends: 91
[2025-05-07 17:23:58,055 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:23:58,056 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:58,056 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 445 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:58,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-05-07 17:23:58,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86.
[2025-05-07 17:23:58,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 26 states have call successors, (28), 21 states have call predecessors, (28), 23 states have return successors, (30), 27 states have call predecessors, (30), 26 states have call successors, (30)
[2025-05-07 17:23:58,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions.
[2025-05-07 17:23:58,061 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 68
[2025-05-07 17:23:58,061 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:58,061 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 95 transitions.
[2025-05-07 17:23:58,061 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:58,061 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions.
[2025-05-07 17:23:58,062 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:23:58,062 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:58,062 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:58,062 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:23:58,062 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:58,063 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:58,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -1546492373, now seen corresponding path program 1 times
[2025-05-07 17:23:58,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:58,063 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019376236]
[2025-05-07 17:23:58,063 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:58,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:58,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:23:58,106 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:23:58,106 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:58,106 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:58,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:58,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:58,313 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019376236]
[2025-05-07 17:23:58,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019376236] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:58,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:58,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:23:58,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908974430]
[2025-05-07 17:23:58,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:58,314 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:23:58,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:58,314 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:23:58,314 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:23:58,314 INFO  L87              Difference]: Start difference. First operand 86 states and 95 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:58,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:58,357 INFO  L93              Difference]: Finished difference Result 72 states and 78 transitions.
[2025-05-07 17:23:58,357 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:23:58,357 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 68
[2025-05-07 17:23:58,358 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:58,358 INFO  L225             Difference]: With dead ends: 72
[2025-05-07 17:23:58,358 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:23:58,358 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:23:58,358 INFO  L437           NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:58,359 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:58,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:23:58,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:23:58,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:23:58,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:23:58,359 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68
[2025-05-07 17:23:58,359 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:58,359 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:23:58,359 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:23:58,360 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:23:58,360 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:23:58,362 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:23:58,362 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:23:58,365 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-05-07 17:23:58,367 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:23:58,369 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:23:58 BoogieIcfgContainer
[2025-05-07 17:23:58,369 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:23:58,370 INFO  L158              Benchmark]: Toolchain (without parser) took 1980.89ms. Allocated memory is still 234.9MB. Free memory was 151.1MB in the beginning and 161.2MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:58,370 INFO  L158              Benchmark]: SmtParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:58,370 INFO  L158              Benchmark]: ChcToBoogie took 30.86ms. Allocated memory is still 234.9MB. Free memory was 151.0MB in the beginning and 148.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:58,370 INFO  L158              Benchmark]: Boogie Preprocessor took 49.91ms. Allocated memory is still 234.9MB. Free memory was 148.2MB in the beginning and 145.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:58,371 INFO  L158              Benchmark]: RCFGBuilder took 402.45ms. Allocated memory is still 234.9MB. Free memory was 145.0MB in the beginning and 184.2MB in the end (delta: -39.2MB). Peak memory consumption was 42.5MB. Max. memory is 33.6GB.
[2025-05-07 17:23:58,371 INFO  L158              Benchmark]: TraceAbstraction took 1493.71ms. Allocated memory is still 234.9MB. Free memory was 183.8MB in the beginning and 161.2MB in the end (delta: 22.6MB). Peak memory consumption was 19.9MB. Max. memory is 33.6GB.
[2025-05-07 17:23:58,372 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 30.86ms. Allocated memory is still 234.9MB. Free memory was 151.0MB in the beginning and 148.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 49.91ms. Allocated memory is still 234.9MB. Free memory was 148.2MB in the beginning and 145.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 402.45ms. Allocated memory is still 234.9MB. Free memory was 145.0MB in the beginning and 184.2MB in the end (delta: -39.2MB). Peak memory consumption was 42.5MB. Max. memory is 33.6GB.
 * TraceAbstraction took 1493.71ms. Allocated memory is still 234.9MB. Free memory was 183.8MB in the beginning and 161.2MB in the end (delta: 22.6MB). Peak memory consumption was 19.9MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 22 procedures, 87 locations, 132 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2060 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1616 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 444 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:23:58,383 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
