/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:23:51,226 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:23:51,306 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:23:51,351 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:23:51,351 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:23:51,351 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:23:51,352 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:23:51,356 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:23:51,356 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:23:51,359 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:23:51,359 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:23:51,359 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:23:51,359 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:23:51,360 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:23:51,360 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:23:51,360 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:23:51,360 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:23:51,361 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:23:51,362 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:23:51,362 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:23:51,362 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:23:51,362 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:23:51,362 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:23:51,362 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:23:51,363 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:23:51,363 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:23:51,363 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:23:51,364 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:23:51,364 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:23:51,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:23:51,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:23:51,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:23:51,597 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:23:51,598 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:23:51,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl [2023-10-12 17:23:51,599 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/poker-hand-subst.wvr.bpl' [2023-10-12 17:23:51,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:23:51,649 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:23:51,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:23:51,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:23:51,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:23:51,660 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,679 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,690 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:23:51,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:23:51,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:23:51,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:23:51,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:23:51,700 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,700 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,708 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,708 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,716 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,719 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,721 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,722 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 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:23:51,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:23:51,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:23:51,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:23:51,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:51" (1/1) ... [2023-10-12 17:23:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:51,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:23:51,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:23:51,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:23:51,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:23:51,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:23:51,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:23:51,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:23:51,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:23:51,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:23:51,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:23:51,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:23:51,826 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:23:51,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:23:51,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:23:51,827 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:23:51,869 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:23:51,870 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:23:52,206 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:23:52,312 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:23:52,313 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-10-12 17:23:52,314 INFO L201 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:23:52 BoogieIcfgContainer [2023-10-12 17:23:52,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:23:52,315 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:23:52,315 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:23:52,318 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:23:52,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:23:52,318 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:23:51" (1/2) ... [2023-10-12 17:23:52,319 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6801e3f7 and model type poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:23:52, skipping insertion in model container [2023-10-12 17:23:52,320 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:23:52,320 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 12.10 05:23:52" (2/2) ... [2023-10-12 17:23:52,321 INFO L332 chiAutomizerObserver]: Analyzing ICFG poker-hand-subst.wvr.bpl [2023-10-12 17:23:52,364 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:23:52,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 40 transitions, 104 flow [2023-10-12 17:23:52,398 INFO L124 PetriNetUnfolderBase]: 12/34 cut-off events. [2023-10-12 17:23:52,409 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:23:52,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 12/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2023-10-12 17:23:52,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 40 transitions, 104 flow [2023-10-12 17:23:52,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 34 transitions, 86 flow [2023-10-12 17:23:52,418 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:23:52,427 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 34 transitions, 86 flow [2023-10-12 17:23:52,429 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 34 transitions, 86 flow [2023-10-12 17:23:52,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 86 flow [2023-10-12 17:23:52,436 INFO L124 PetriNetUnfolderBase]: 12/34 cut-off events. [2023-10-12 17:23:52,437 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:23:52,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 12/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 53 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2023-10-12 17:23:52,438 INFO L119 LiptonReduction]: Number of co-enabled transitions 480 [2023-10-12 17:23:54,087 INFO L134 LiptonReduction]: Checked pairs total: 162 [2023-10-12 17:23:54,088 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:23:54,098 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:23:54,099 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:23:54,099 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:23:54,099 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:23:54,099 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:23:54,099 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:23:54,099 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:23:54,099 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:23:54,100 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 places, 29 transitions, 76 flow [2023-10-12 17:23:54,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:54,106 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-10-12 17:23:54,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:23:54,107 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:54,110 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:23:54,110 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 places, 29 transitions, 76 flow [2023-10-12 17:23:54,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:54,112 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-10-12 17:23:54,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:23:54,112 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:54,116 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [358] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 41#[$Ultimate##0, L292]true [332] $Ultimate##0-->L47: Formula: (let ((.cse0 (select v_index_of_0_43 4)) (.cse1 (select v_index_of_4_49 4))) (and (not v_break_14_15) (= v_i1_13_16 0) (= .cse0 .cse1) (or (not (= 0 (+ .cse0 1))) (not (= (+ .cse1 1) 0))))) InVars {index_of_4=v_index_of_4_49, index_of_0=v_index_of_0_43} OutVars{index_of_4=v_index_of_4_49, i1_13=v_i1_13_16, break_14=v_break_14_15, index_of_0=v_index_of_0_43} AuxVars[] AssignedVars[i1_13, break_14] 43#[L292, L47]true [2023-10-12 17:23:54,116 INFO L750 eck$LassoCheckResult]: Loop: 43#[L292, L47]true [336] L47-->L47: Formula: (let ((.cse11 (select v_char_at_5_21 v_i1_13_21)) (.cse12 (select v_char_at_1_21 v_i1_13_21))) (let ((.cse3 (= .cse12 0)) (.cse2 (= .cse12 4)) (.cse6 (= .cse11 0)) (.cse5 (= .cse11 4))) (let ((.cse7 (not .cse5)) (.cse9 (not .cse6)) (.cse8 (not .cse2)) (.cse10 (not .cse3))) (let ((.cse4 (not v_break_14_20)) (.cse0 (and .cse8 .cse10)) (.cse1 (and .cse7 .cse9))) (and (or (and (or .cse0 .cse1 v_break_14_20) v_break_14_19) (and (or .cse2 .cse3) (not v_break_14_19) .cse4 (or .cse5 .cse6))) .cse4 (= v_i1_13_20 (+ v_i1_13_21 1)) (= v_result_12_47 (ite (and .cse7 .cse8 .cse9 .cse10) 0 (ite .cse0 (- 1) (ite .cse1 1 v_result_12_48)))) (<= v_i1_13_21 12)))))) InVars {result_12=v_result_12_48, char_at_5=v_char_at_5_21, i1_13=v_i1_13_21, break_14=v_break_14_20, char_at_1=v_char_at_1_21} OutVars{result_12=v_result_12_47, char_at_5=v_char_at_5_21, i1_13=v_i1_13_20, break_14=v_break_14_19, char_at_1=v_char_at_1_21} AuxVars[] AssignedVars[result_12, i1_13, break_14] 43#[L292, L47]true [2023-10-12 17:23:54,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash 12391, now seen corresponding path program 1 times [2023-10-12 17:23:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525884218] [2023-10-12 17:23:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:54,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:54,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:54,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 367, now seen corresponding path program 1 times [2023-10-12 17:23:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:54,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548270151] [2023-10-12 17:23:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:54,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:54,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:54,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash 384457, now seen corresponding path program 1 times [2023-10-12 17:23:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:54,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717667628] [2023-10-12 17:23:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:54,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:54,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:54,552 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:23:54,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:23:54,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:23:54,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:23:54,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:23:54,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:54,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:23:54,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:23:54,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: poker-hand-subst.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:23:54,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:23:54,553 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:23:54,567 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:23:54,573 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:23:54,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:23:54,895 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2023-10-12 17:23:57,301 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:23:57,304 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:23:57,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:57,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:57,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:23:57,329 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 [2023-10-12 17:23:57,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:57,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:57,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:57,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:57,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:57,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:57,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:23:57,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:23:57,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:23:57,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:57,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:57,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:23:57,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:23:57,354 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 [2023-10-12 17:23:57,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:23:57,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:23:57,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:23:57,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:23:57,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:23:57,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:23:57,394 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:23:57,419 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:23:57,419 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-10-12 17:23:57,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:23:57,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:23:57,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:23:57,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:23:57,430 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:23:57,440 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:23:57,440 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:23:57,441 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1_13) = -2*i1_13 + 25 Supporting invariants [] [2023-10-12 17:23:57,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:23:57,446 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:23:57,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:57,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:23:57,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:23:57,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:23:57,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:23:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:23:57,533 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 [2023-10-12 17:23:57,534 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-10-12 17:23:57,666 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Result 6 states and 354 transitions. [2023-10-12 17:23:57,667 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:23:57,672 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:23:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:23:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2023-10-12 17:23:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2023-10-12 17:23:57,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 206 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:23:57,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:57,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 206 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:23:57,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:57,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 206 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:23:57,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:23:57,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 394 transitions, 1828 flow [2023-10-12 17:23:57,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:23:57,928 INFO L124 PetriNetUnfolderBase]: 1496/1893 cut-off events. [2023-10-12 17:23:57,928 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2023-10-12 17:23:57,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 1893 events. 1496/1893 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6123 event pairs, 42 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 3619. Up to 413 conditions per place. [2023-10-12 17:23:57,931 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 39 places, 394 transitions, 1828 flow [2023-10-12 17:23:57,948 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 39 places, 394 transitions, 1828 flow [2023-10-12 17:23:57,948 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 394 transitions, 1828 flow [2023-10-12 17:23:57,948 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:23:57,948 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 places, 394 transitions, 1828 flow [2023-10-12 17:23:57,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:23:57,952 INFO L124 PetriNetUnfolderBase]: 17/30 cut-off events. [2023-10-12 17:23:57,952 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:23:57,952 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:23:57,953 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [358] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 41#[$Ultimate##0, L292]true [333] $Ultimate##0-->L75: Formula: (and (= (select v_last_index_of_3_43 3) (select v_last_index_of_7_35 3)) (let ((.cse0 (select v_count_occurrences_of_6_57 3))) (or (< 1 .cse0) (and (not (= (+ (select v_index_of_4_95 2) 1) 0)) (= .cse0 1)))) (let ((.cse1 (select v_count_occurrences_of_2_53 3))) (or (< 1 .cse1) (and (= .cse1 1) (not (= (+ (select v_index_of_0_85 2) 1) 0))))) (= v_i2_15_16 0) (= (+ (select v_index_of_0_85 4) 1) 0) (= (+ (select v_index_of_4_95 4) 1) 0) (not v_break_16_21)) InVars {count_occurrences_of_2=v_count_occurrences_of_2_53, last_index_of_7=v_last_index_of_7_35, index_of_4=v_index_of_4_95, last_index_of_3=v_last_index_of_3_43, count_occurrences_of_6=v_count_occurrences_of_6_57, index_of_0=v_index_of_0_85} OutVars{count_occurrences_of_2=v_count_occurrences_of_2_53, last_index_of_7=v_last_index_of_7_35, index_of_4=v_index_of_4_95, last_index_of_3=v_last_index_of_3_43, count_occurrences_of_6=v_count_occurrences_of_6_57, i2_15=v_i2_15_16, index_of_0=v_index_of_0_85, break_16=v_break_16_21} AuxVars[] AssignedVars[i2_15, break_16] 89#[L292, L75]true [2023-10-12 17:23:57,953 INFO L750 eck$LassoCheckResult]: Loop: 89#[L292, L75]true [338] L75-->L75: Formula: (let ((.cse9 (select v_char_at_1_13 v_i2_15_10)) (.cse10 (select v_char_at_5_13 v_i2_15_10)) (.cse5 (= (select v_last_index_of_3_21 3) v_i2_15_10))) (let ((.cse0 (not .cse5)) (.cse3 (= .cse10 2)) (.cse4 (= .cse10 3)) (.cse1 (= .cse9 2)) (.cse2 (= .cse9 3)) (.cse6 (not v_break_16_14))) (and (or (and (or (and .cse0 (or .cse1 .cse2 .cse3 .cse4)) v_break_16_14) v_break_16_13) (and (not v_break_16_13) (or .cse5 (and (not .cse2) (not .cse3) (not .cse1) (not .cse4))) .cse6)) (= (let ((.cse8 (or .cse1 .cse2)) (.cse7 (or .cse3 .cse4))) (ite (and .cse0 .cse7 .cse8) 0 (ite (and .cse0 .cse8) (- 1) (ite (and .cse0 .cse7) 1 v_result_12_30)))) v_result_12_29) (<= v_i2_15_10 12) .cse6))) InVars {result_12=v_result_12_30, char_at_1=v_char_at_1_13, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_21, i2_15=v_i2_15_10, break_16=v_break_16_14} OutVars{result_12=v_result_12_29, char_at_1=v_char_at_1_13, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_21, i2_15=v_i2_15_10, break_16=v_break_16_13} AuxVars[] AssignedVars[result_12, break_16] 89#[L292, L75]true [338] L75-->L75: Formula: (let ((.cse9 (select v_char_at_1_13 v_i2_15_10)) (.cse10 (select v_char_at_5_13 v_i2_15_10)) (.cse5 (= (select v_last_index_of_3_21 3) v_i2_15_10))) (let ((.cse0 (not .cse5)) (.cse3 (= .cse10 2)) (.cse4 (= .cse10 3)) (.cse1 (= .cse9 2)) (.cse2 (= .cse9 3)) (.cse6 (not v_break_16_14))) (and (or (and (or (and .cse0 (or .cse1 .cse2 .cse3 .cse4)) v_break_16_14) v_break_16_13) (and (not v_break_16_13) (or .cse5 (and (not .cse2) (not .cse3) (not .cse1) (not .cse4))) .cse6)) (= (let ((.cse8 (or .cse1 .cse2)) (.cse7 (or .cse3 .cse4))) (ite (and .cse0 .cse7 .cse8) 0 (ite (and .cse0 .cse8) (- 1) (ite (and .cse0 .cse7) 1 v_result_12_30)))) v_result_12_29) (<= v_i2_15_10 12) .cse6))) InVars {result_12=v_result_12_30, char_at_1=v_char_at_1_13, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_21, i2_15=v_i2_15_10, break_16=v_break_16_14} OutVars{result_12=v_result_12_29, char_at_1=v_char_at_1_13, char_at_5=v_char_at_5_13, last_index_of_3=v_last_index_of_3_21, i2_15=v_i2_15_10, break_16=v_break_16_13} AuxVars[] AssignedVars[result_12, break_16] 89#[L292, L75]true [2023-10-12 17:23:57,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 12392, now seen corresponding path program 1 times [2023-10-12 17:23:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:57,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532558673] [2023-10-12 17:23:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:57,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:57,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:57,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash 11777, now seen corresponding path program 1 times [2023-10-12 17:23:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315187341] [2023-10-12 17:23:57,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:57,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:57,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:57,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:23:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash 11919528, now seen corresponding path program 1 times [2023-10-12 17:23:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:23:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569922643] [2023-10-12 17:23:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:23:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:23:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:57,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:23:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:23:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:23:58,466 INFO L201 PluginConnector]: Adding new model poker-hand-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:23:58 BoogieIcfgContainer [2023-10-12 17:23:58,466 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:23:58,467 INFO L158 Benchmark]: Toolchain (without parser) took 6817.69ms. Allocated memory was 227.5MB in the beginning and 341.8MB in the end (delta: 114.3MB). Free memory was 176.8MB in the beginning and 302.0MB in the end (delta: -125.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:23:58,467 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 227.5MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:23:58,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.69ms. Allocated memory is still 227.5MB. Free memory was 176.6MB in the beginning and 174.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:23:58,468 INFO L158 Benchmark]: Boogie Preprocessor took 31.08ms. Allocated memory is still 227.5MB. Free memory was 174.9MB in the beginning and 172.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:23:58,468 INFO L158 Benchmark]: RCFGBuilder took 589.37ms. Allocated memory is still 227.5MB. Free memory was 172.9MB in the beginning and 156.3MB in the end (delta: 16.6MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. [2023-10-12 17:23:58,469 INFO L158 Benchmark]: BuchiAutomizer took 6151.34ms. Allocated memory was 227.5MB in the beginning and 341.8MB in the end (delta: 114.3MB). Free memory was 156.0MB in the beginning and 302.0MB in the end (delta: -146.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:23:58,470 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.27ms. Allocated memory is still 227.5MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.69ms. Allocated memory is still 227.5MB. Free memory was 176.6MB in the beginning and 174.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.08ms. Allocated memory is still 227.5MB. Free memory was 174.9MB in the beginning and 172.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 589.37ms. Allocated memory is still 227.5MB. Free memory was 172.9MB in the beginning and 156.3MB in the end (delta: 16.6MB). Peak memory consumption was 17.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 6151.34ms. Allocated memory was 227.5MB in the beginning and 341.8MB in the end (delta: 114.3MB). Free memory was 156.0MB in the beginning and 302.0MB in the end (delta: -146.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 1828 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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, 96 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 24 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp280 ukn41 mio100 lsp94 div100 bol104 ite100 ukn100 eq194 hnf100 smp100 dnf1602 smp8 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 1.7s - 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); [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); [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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 32 PlacesBefore, 27 PlacesAfterwards, 34 TransitionsBefore, 29 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 162, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 162, independent: 162, independent conditional: 0, independent unconditional: 162, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 162, unknown conditional: 0, unknown unconditional: 162] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:23:58,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...