/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:26,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:26,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:22:26,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:26,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:26,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:26,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:26,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:26,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:26,147 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:26,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:26,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:26,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:26,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:26,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:26,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:26,150 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:26,150 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:26,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:26,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:26,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:26,391 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:26,392 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:26,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl [2025-04-26 16:22:26,394 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl' [2025-04-26 16:22:26,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:26,432 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:26,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:26,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:26,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:26,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,476 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:26,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:26,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:26,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:26,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:26,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:26,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:26,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:26,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:26,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/1) ... [2025-04-26 16:22:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:26,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:26,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:26,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:22:26,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:26,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:26,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:26,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:26,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:26,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:26,587 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:26,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:26,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:26,588 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:22:26,638 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:26,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:26,913 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:26,913 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:27,021 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:27,021 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-04-26 16:22:27,021 INFO L201 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:27 BoogieIcfgContainer [2025-04-26 16:22:27,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:27,022 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:27,022 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:27,027 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:27,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:27,028 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:26" (1/2) ... [2025-04-26 16:22:27,029 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46bf2744 and model type poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:27, skipping insertion in model container [2025-04-26 16:22:27,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:27,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:27" (2/2) ... [2025-04-26 16:22:27,031 INFO L376 chiAutomizerObserver]: Analyzing ICFG poker-hand-subst.wvr.bpl [2025-04-26 16:22:27,109 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:27,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 52 transitions, 125 flow [2025-04-26 16:22:27,159 INFO L116 PetriNetUnfolderBase]: 24/46 cut-off events. [2025-04-26 16:22:27,161 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:27,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 24/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 69 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 42. Up to 7 conditions per place. [2025-04-26 16:22:27,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 52 transitions, 125 flow [2025-04-26 16:22:27,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 46 transitions, 110 flow [2025-04-26 16:22:27,170 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 46 transitions, 110 flow [2025-04-26 16:22:27,178 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:27,179 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:27,179 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:27,179 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:27,179 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:27,179 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:27,179 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:27,179 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:27,181 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:27,276 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 134 [2025-04-26 16:22:27,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:27,278 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:27,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:27,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:27,283 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:27,284 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 190 states, but on-demand construction may add more states [2025-04-26 16:22:27,298 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 134 [2025-04-26 16:22:27,301 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:27,301 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:27,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:27,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:27,305 INFO L752 eck$LassoCheckResult]: Stem: "[379] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[346] $Ultimate##0-->L47: Formula: (let ((.cse0 (select v_index_of_4_65 4)) (.cse1 (select v_index_of_0_65 4))) (and (= v_i1_13_20 0) (not v_break_14_21) (or (not (= (+ .cse0 1) 0)) (not (= (+ .cse1 1) 0))) (= .cse0 .cse1))) InVars {index_of_4=v_index_of_4_65, index_of_0=v_index_of_0_65} OutVars{index_of_4=v_index_of_4_65, i1_13=v_i1_13_20, break_14=v_break_14_21, index_of_0=v_index_of_0_65} AuxVars[] AssignedVars[i1_13, break_14]" [2025-04-26 16:22:27,306 INFO L754 eck$LassoCheckResult]: Loop: "[350] L47-->L47: Formula: (let ((.cse11 (select v_char_at_5_17 v_i1_13_17)) (.cse12 (select v_char_at_1_17 v_i1_13_17))) (let ((.cse4 (= 4 .cse12)) (.cse3 (= .cse12 0)) (.cse2 (= .cse11 0)) (.cse1 (= .cse11 4))) (let ((.cse7 (not .cse1)) (.cse9 (not .cse2)) (.cse8 (not .cse3)) (.cse10 (not .cse4))) (let ((.cse0 (not v_break_14_18)) (.cse6 (and .cse8 .cse10)) (.cse5 (and .cse7 .cse9))) (and (= (+ v_i1_13_17 1) v_i1_13_16) (or (and .cse0 (or .cse1 .cse2) (or .cse3 .cse4) (not v_break_14_17)) (and (or .cse5 .cse6 v_break_14_18) v_break_14_17)) .cse0 (= v_result_12_49 (ite (and .cse7 .cse8 .cse9 .cse10) 0 (ite .cse6 (- 1) (ite .cse5 1 v_result_12_50)))) (<= v_i1_13_17 12)))))) InVars {result_12=v_result_12_50, char_at_5=v_char_at_5_17, i1_13=v_i1_13_17, break_14=v_break_14_18, char_at_1=v_char_at_1_17} OutVars{result_12=v_result_12_49, char_at_5=v_char_at_5_17, i1_13=v_i1_13_16, break_14=v_break_14_17, char_at_1=v_char_at_1_17} AuxVars[] AssignedVars[result_12, i1_13, break_14]" [2025-04-26 16:22:27,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 13056, now seen corresponding path program 1 times [2025-04-26 16:22:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:27,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868906732] [2025-04-26 16:22:27,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:27,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:27,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:27,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:27,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:27,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:27,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,398 INFO L85 PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times [2025-04-26 16:22:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:27,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240697573] [2025-04-26 16:22:27,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:27,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:27,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:27,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:27,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:27,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:27,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:27,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:27,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash 405086, now seen corresponding path program 1 times [2025-04-26 16:22:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:27,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22591637] [2025-04-26 16:22:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:27,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:27,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:27,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:27,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:27,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,010 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:28,011 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:28,011 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:28,011 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:28,011 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:28,012 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,012 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:28,012 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:28,012 INFO L132 ssoRankerPreferences]: Filename of dumped script: poker-hand-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:28,012 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:28,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:28,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:28,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:28,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:28,633 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2025-04-26 16:22:30,994 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:30,998 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:30,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:31,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:31,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:22:31,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:31,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:31,016 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:31,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:31,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:31,027 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:22:31,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:31,037 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:31,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:22:31,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:31,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:31,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:22:31,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:31,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:31,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:31,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:31,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:31,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:31,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:31,076 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:31,092 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:31,092 INFO L437 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:22:31,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:31,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:31,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:22:31,099 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:31,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:31,119 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:31,119 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:31,119 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1_13) = -2*i1_13 + 25 Supporting invariants [] [2025-04-26 16:22:31,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:22:31,128 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:31,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:31,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:31,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:31,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:31,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:31,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:31,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:31,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:31,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:31,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:31,202 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:31,205 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 190 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:31,388 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 190 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 532 states and 3403 transitions. Complement of second has 5 states. [2025-04-26 16:22:31,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:22:31,397 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:31,397 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:31,397 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:31,397 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:31,397 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:31,397 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:31,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 3403 transitions. [2025-04-26 16:22:31,414 INFO L131 ngComponentsAnalysis]: Automaton has 175 accepting balls. 175 [2025-04-26 16:22:31,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 376 states and 2285 transitions. [2025-04-26 16:22:31,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2025-04-26 16:22:31,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2025-04-26 16:22:31,429 INFO L74 IsDeterministic]: Start isDeterministic. Operand 376 states and 2285 transitions. [2025-04-26 16:22:31,429 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:31,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 376 states and 2285 transitions. [2025-04-26 16:22:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 2285 transitions. [2025-04-26 16:22:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 247. [2025-04-26 16:22:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 247 states have (on average 6.7894736842105265) internal successors, (in total 1677), 246 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1677 transitions. [2025-04-26 16:22:31,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 247 states and 1677 transitions. [2025-04-26 16:22:31,470 INFO L438 stractBuchiCegarLoop]: Abstraction has 247 states and 1677 transitions. [2025-04-26 16:22:31,470 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:31,470 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 247 states and 1677 transitions. [2025-04-26 16:22:31,473 INFO L131 ngComponentsAnalysis]: Automaton has 121 accepting balls. 121 [2025-04-26 16:22:31,473 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:31,473 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:31,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:31,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:31,474 INFO L752 eck$LassoCheckResult]: Stem: "[379] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[347] $Ultimate##0-->L75: Formula: (and (not v_break_16_17) (= (+ (select v_index_of_0_69 4) 1) 0) (= (+ (select v_index_of_4_69 4) 1) 0) (= v_i2_15_16 0) (let ((.cse0 (select v_count_occurrences_of_6_37 3))) (or (and (= .cse0 1) (not (= (+ (select v_index_of_4_69 2) 1) 0))) (< 1 .cse0))) (let ((.cse1 (select v_count_occurrences_of_2_45 3))) (or (and (not (= (+ (select v_index_of_0_69 2) 1) 0)) (= .cse1 1)) (< 1 .cse1))) (= (select v_last_index_of_7_23 3) (select v_last_index_of_3_29 3))) InVars {count_occurrences_of_2=v_count_occurrences_of_2_45, index_of_4=v_index_of_4_69, last_index_of_3=v_last_index_of_3_29, count_occurrences_of_6=v_count_occurrences_of_6_37, index_of_0=v_index_of_0_69, last_index_of_7=v_last_index_of_7_23} OutVars{count_occurrences_of_2=v_count_occurrences_of_2_45, last_index_of_7=v_last_index_of_7_23, index_of_4=v_index_of_4_69, last_index_of_3=v_last_index_of_3_29, count_occurrences_of_6=v_count_occurrences_of_6_37, i2_15=v_i2_15_16, index_of_0=v_index_of_0_69, break_16=v_break_16_17} AuxVars[] AssignedVars[i2_15, break_16]" [2025-04-26 16:22:31,474 INFO L754 eck$LassoCheckResult]: Loop: "[351] L75-->L75: Formula: (let ((.cse9 (select v_char_at_1_13 v_i2_15_8)) (.cse10 (select v_char_at_5_13 v_i2_15_8)) (.cse8 (= v_i2_15_8 (select v_last_index_of_3_15 3)))) (let ((.cse0 (not v_break_16_10)) (.cse1 (not .cse8)) (.cse4 (= 2 .cse10)) (.cse6 (= 3 .cse9)) (.cse5 (= 3 .cse10)) (.cse7 (= 2 .cse9))) (and .cse0 (= v_result_12_27 (let ((.cse2 (or .cse6 .cse7)) (.cse3 (or .cse4 .cse5))) (ite (and .cse1 .cse2 .cse3) 0 (ite (and .cse1 .cse2) (- 1) (ite (and .cse1 .cse3) 1 v_result_12_28))))) (or (and (or (and (not .cse7) (not .cse5) (not .cse6) (not .cse4)) .cse8) .cse0 (not v_break_16_9)) (and (or v_break_16_10 (and .cse1 (or .cse4 .cse6 .cse5 .cse7))) v_break_16_9)) (<= v_i2_15_8 12)))) InVars {result_12=v_result_12_28, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_15, char_at_1=v_char_at_1_13, i2_15=v_i2_15_8, break_16=v_break_16_10} OutVars{result_12=v_result_12_27, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_15, char_at_1=v_char_at_1_13, i2_15=v_i2_15_8, break_16=v_break_16_9} AuxVars[] AssignedVars[result_12, break_16]" [2025-04-26 16:22:31,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 13057, now seen corresponding path program 1 times [2025-04-26 16:22:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206080358] [2025-04-26 16:22:31,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:31,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:31,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:31,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:31,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash 382, now seen corresponding path program 1 times [2025-04-26 16:22:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846831257] [2025-04-26 16:22:31,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:31,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:31,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:31,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:31,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 405118, now seen corresponding path program 1 times [2025-04-26 16:22:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804822517] [2025-04-26 16:22:31,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:31,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:31,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:31,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:31,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:31,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:31,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:31,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:31,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:32,018 INFO L201 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:32 BoogieIcfgContainer [2025-04-26 16:22:32,018 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:32,019 INFO L158 Benchmark]: Toolchain (without parser) took 5586.17ms. Allocated memory was 159.4MB in the beginning and 172.0MB in the end (delta: 12.6MB). Free memory was 84.6MB in the beginning and 121.1MB in the end (delta: -36.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:32,019 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 86.8MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:32,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.89ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:32,019 INFO L158 Benchmark]: Boogie Preprocessor took 53.13ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:32,021 INFO L158 Benchmark]: RCFGBuilder took 489.70ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 41.4MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-26 16:22:32,021 INFO L158 Benchmark]: BuchiAutomizer took 4995.56ms. Allocated memory was 159.4MB in the beginning and 172.0MB in the end (delta: 12.6MB). Free memory was 41.4MB in the beginning and 121.1MB in the end (delta: -79.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:32,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.71ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 86.8MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.89ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.13ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 80.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 489.70ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 41.4MB in the end (delta: 39.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 4995.56ms. Allocated memory was 159.4MB in the beginning and 172.0MB in the end (delta: 12.6MB). Free memory was 41.4MB in the beginning and 121.1MB in the end (delta: -79.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 129 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 10 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax100 hnf100 lsp495 ukn21 mio100 lsp94 div100 bol104 ite100 ukn100 eq193 hnf100 smp100 dnf1887 smp7 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i1_13 + 25 and consists of 4 locations. The remainder module has 247 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 74]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L292] FORK 0 fork 1 thread1(); [L67] 1 assume !(index_of_0[4] != 0 - 1 || index_of_4[4] != 0 - 1); [L68] 1 assume count_occurrences_of_2[3] > 1 || (count_occurrences_of_2[3] == 1 && index_of_0[2] != 0 - 1); [L69] 1 assume count_occurrences_of_6[3] > 1 || (count_occurrences_of_6[3] == 1 && index_of_4[2] != 0 - 1); [L70] 1 assume last_index_of_3[3] == last_index_of_7[3]; [L71] 1 i2_15 := 0; [L72] 1 break_16 := false; VAL [break_16=false, i2_15=0] Loop: [L76] assume !break_16 && i2_15 <= 12; [L77] result_12 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 0 else (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) then 0 - 1 else (if i2_15 != last_index_of_3[3] && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 1 else result_12))); [L78] break_16 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3 || char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then true else break_16); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 74]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L292] FORK 0 fork 1 thread1(); [L67] 1 assume !(index_of_0[4] != 0 - 1 || index_of_4[4] != 0 - 1); [L68] 1 assume count_occurrences_of_2[3] > 1 || (count_occurrences_of_2[3] == 1 && index_of_0[2] != 0 - 1); [L69] 1 assume count_occurrences_of_6[3] > 1 || (count_occurrences_of_6[3] == 1 && index_of_4[2] != 0 - 1); [L70] 1 assume last_index_of_3[3] == last_index_of_7[3]; [L71] 1 i2_15 := 0; [L72] 1 break_16 := false; VAL [break_16=false, i2_15=0] Loop: [L76] assume !break_16 && i2_15 <= 12; [L77] result_12 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 0 else (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3) then 0 - 1 else (if i2_15 != last_index_of_3[3] && (char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then 1 else result_12))); [L78] break_16 := (if i2_15 != last_index_of_3[3] && (char_at_1[i2_15] == 2 || char_at_1[i2_15] == 3 || char_at_5[i2_15] == 2 || char_at_5[i2_15] == 3) then true else break_16); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:22:32,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...