/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:07,120 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:07,172 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:38:07,194 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:07,195 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:07,195 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:07,196 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:07,196 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:07,198 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:07,203 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:07,203 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:07,203 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:07,203 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:07,205 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:07,205 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:07,205 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:07,205 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:07,205 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:07,205 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:07,206 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:07,206 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:07,206 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:07,206 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:07,206 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:07,207 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:07,207 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:07,207 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:07,207 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:07,207 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:07,207 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:07,208 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:07,208 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:07,208 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:07,210 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:07,210 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 -> RABIN_PETRI_NET [2023-10-12 17:38:07,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:07,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:07,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:07,443 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:07,444 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:07,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl [2023-10-12 17:38:07,447 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-trans.wvr.bpl' [2023-10-12 17:38:07,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:07,480 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:07,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:07,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:07,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:07,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,500 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:07,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:07,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:07,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:07,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:07,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:07,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:07,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:07,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:07,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/1) ... [2023-10-12 17:38:07,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:07,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:07,557 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:38:07,576 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:38:07,603 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:07,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:07,603 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:07,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:07,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:07,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:07,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:07,605 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:38:07,662 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:07,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:07,799 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:07,859 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:07,860 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:38:07,861 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:07 BoogieIcfgContainer [2023-10-12 17:38:07,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:07,862 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:07,862 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:07,871 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:07,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:07,871 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:07" (1/2) ... [2023-10-12 17:38:07,872 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@238eae4b and model type name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:07, skipping insertion in model container [2023-10-12 17:38:07,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:07,873 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:07" (2/2) ... [2023-10-12 17:38:07,874 INFO L332 chiAutomizerObserver]: Analyzing ICFG name-comparator-trans.wvr.bpl [2023-10-12 17:38:07,924 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:07,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:38:07,957 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:38:07,958 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:07,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:38:07,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:38:07,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2023-10-12 17:38:07,966 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:07,976 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:38:07,978 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:38:07,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2023-10-12 17:38:07,984 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:38:07,984 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:07,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:38:07,985 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:38:08,117 INFO L134 LiptonReduction]: Checked pairs total: 88 [2023-10-12 17:38:08,117 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:38:08,126 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:08,126 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:08,127 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:08,127 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:08,127 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:08,127 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:08,127 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:08,127 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:08,128 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:38:08,130 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][10], 2:2A:[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_31 v_name_2_29))) (and .cse0 (or (and .cse0 (not v_break_7_36) (not .cse1)) (and (or .cse1 v_break_7_50) v_break_7_36)) (= (ite .cse1 0 v_result_4_35) v_result_4_34) (= v_i_5_27 0))) InVars {name_2=v_name_2_29, result_4=v_result_4_35, name_1=v_name_1_31} OutVars{name_2=v_name_2_29, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_31} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7][0]][3:3A:[118] L36-->L36: Formula: (let ((.cse1 (not v_break_7_52)) (.cse4 (= v_name_2_31 v_current_6_16))) (let ((.cse2 (not v_break_7_41)) (.cse3 (and .cse1 .cse4)) (.cse0 (= v_name_1_39 v_current_6_16))) (and (< v_i_5_30 3) (= (select v_nondet_0_18 v_i_5_30) v_current_6_16) (or (and v_break_7_52 (or .cse0 v_break_7_41)) (and .cse1 (not .cse0) .cse2)) (or (and (or .cse3 v_break_7_52) v_break_7_40) (and .cse1 (not v_break_7_40) (or (not .cse4) v_break_7_52))) .cse2 (= (+ v_i_5_30 1) v_i_5_29) (= v_result_4_38 (ite .cse3 (- 1) (ite .cse0 1 v_result_4_40)))))) InVars {name_2=v_name_2_31, i_5=v_i_5_30, result_4=v_result_4_40, break_7=v_break_7_41, name_1=v_name_1_39, nondet_0=v_nondet_0_18} OutVars{name_2=v_name_2_31, i_5=v_i_5_29, result_4=v_result_4_38, break_7=v_break_7_40, current_6=v_current_6_16, name_1=v_name_1_39, nondet_0=v_nondet_0_18} AuxVars[v_break_7_52] AssignedVars[i_5, result_4, break_7, current_6][3]] [2023-10-12 17:38:08,132 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:08,132 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:08,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:08,132 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:08,134 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:08,135 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:38:08,136 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][10], 2:2A:[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_31 v_name_2_29))) (and .cse0 (or (and .cse0 (not v_break_7_36) (not .cse1)) (and (or .cse1 v_break_7_50) v_break_7_36)) (= (ite .cse1 0 v_result_4_35) v_result_4_34) (= v_i_5_27 0))) InVars {name_2=v_name_2_29, result_4=v_result_4_35, name_1=v_name_1_31} OutVars{name_2=v_name_2_29, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_31} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7][0]][3:3A:[118] L36-->L36: Formula: (let ((.cse1 (not v_break_7_52)) (.cse4 (= v_name_2_31 v_current_6_16))) (let ((.cse2 (not v_break_7_41)) (.cse3 (and .cse1 .cse4)) (.cse0 (= v_name_1_39 v_current_6_16))) (and (< v_i_5_30 3) (= (select v_nondet_0_18 v_i_5_30) v_current_6_16) (or (and v_break_7_52 (or .cse0 v_break_7_41)) (and .cse1 (not .cse0) .cse2)) (or (and (or .cse3 v_break_7_52) v_break_7_40) (and .cse1 (not v_break_7_40) (or (not .cse4) v_break_7_52))) .cse2 (= (+ v_i_5_30 1) v_i_5_29) (= v_result_4_38 (ite .cse3 (- 1) (ite .cse0 1 v_result_4_40)))))) InVars {name_2=v_name_2_31, i_5=v_i_5_30, result_4=v_result_4_40, break_7=v_break_7_41, name_1=v_name_1_39, nondet_0=v_nondet_0_18} OutVars{name_2=v_name_2_31, i_5=v_i_5_29, result_4=v_result_4_38, break_7=v_break_7_40, current_6=v_current_6_16, name_1=v_name_1_39, nondet_0=v_nondet_0_18} AuxVars[v_break_7_52] AssignedVars[i_5, result_4, break_7, current_6][3]] [2023-10-12 17:38:08,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:08,136 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:08,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:08,136 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:08,140 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]true [116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_50)) (.cse1 (= v_name_1_31 v_name_2_29))) (and .cse0 (or (and .cse0 (not v_break_7_36) (not .cse1)) (and (or .cse1 v_break_7_50) v_break_7_36)) (= (ite .cse1 0 v_result_4_35) v_result_4_34) (= v_i_5_27 0))) InVars {name_2=v_name_2_29, result_4=v_result_4_35, name_1=v_name_1_31} OutVars{name_2=v_name_2_29, i_5=v_i_5_27, result_4=v_result_4_34, break_7=v_break_7_36, name_1=v_name_1_31} AuxVars[v_break_7_50] AssignedVars[i_5, result_4, break_7] 40#[L36, L107]true [2023-10-12 17:38:08,140 INFO L750 eck$LassoCheckResult]: Loop: 40#[L36, L107]true [118] L36-->L36: Formula: (let ((.cse1 (not v_break_7_52)) (.cse4 (= v_name_2_31 v_current_6_16))) (let ((.cse2 (not v_break_7_41)) (.cse3 (and .cse1 .cse4)) (.cse0 (= v_name_1_39 v_current_6_16))) (and (< v_i_5_30 3) (= (select v_nondet_0_18 v_i_5_30) v_current_6_16) (or (and v_break_7_52 (or .cse0 v_break_7_41)) (and .cse1 (not .cse0) .cse2)) (or (and (or .cse3 v_break_7_52) v_break_7_40) (and .cse1 (not v_break_7_40) (or (not .cse4) v_break_7_52))) .cse2 (= (+ v_i_5_30 1) v_i_5_29) (= v_result_4_38 (ite .cse3 (- 1) (ite .cse0 1 v_result_4_40)))))) InVars {name_2=v_name_2_31, i_5=v_i_5_30, result_4=v_result_4_40, break_7=v_break_7_41, name_1=v_name_1_39, nondet_0=v_nondet_0_18} OutVars{name_2=v_name_2_31, i_5=v_i_5_29, result_4=v_result_4_38, break_7=v_break_7_40, current_6=v_current_6_16, name_1=v_name_1_39, nondet_0=v_nondet_0_18} AuxVars[v_break_7_52] AssignedVars[i_5, result_4, break_7, current_6] 40#[L36, L107]true [2023-10-12 17:38:08,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2023-10-12 17:38:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748900736] [2023-10-12 17:38:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:08,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:08,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:08,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:38:08,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:08,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958551365] [2023-10-12 17:38:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:08,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:08,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:08,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2023-10-12 17:38:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:08,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552058484] [2023-10-12 17:38:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:08,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:08,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:08,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:08,603 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:08,603 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:08,603 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:08,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:08,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:08,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:08,604 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:08,604 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:08,604 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:08,604 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:08,604 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:08,618 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:38:08,738 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:38:08,821 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:38:09,131 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:09,134 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:09,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:09,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:09,147 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:38:09,163 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:38:09,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:09,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:09,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:09,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:09,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:09,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:09,179 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:38:09,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:09,196 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:09,196 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:38:09,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:09,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:09,200 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:38:09,233 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:38:09,237 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:09,274 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:09,275 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:09,275 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2023-10-12 17:38:09,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:38:09,281 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:09,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:09,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:09,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:09,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:09,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:09,322 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:38:09,341 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:38:09,399 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:38:09,403 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:38:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:38:09,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:09,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:09,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:09,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:09,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:09,410 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 85 transitions, 430 flow [2023-10-12 17:38:09,410 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:09,411 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 85 transitions, 430 flow [2023-10-12 17:38:09,417 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][54], 4:2A:[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][44], 15:3A:[120] $Ultimate##0-->L62: Formula: (let ((.cse1 (not v_break_11_52)) (.cse0 (= v_name_3_33 v_name_2_33))) (and (= v_result_8_30 (ite .cse0 0 v_result_8_31)) .cse1 (or (and (not v_break_11_36) (not .cse0) .cse1) (and (or v_break_11_52 .cse0) v_break_11_36)) (= v_i_9_23 0))) InVars {name_3=v_name_3_33, result_8=v_result_8_31, name_2=v_name_2_33} OutVars{name_3=v_name_3_33, result_8=v_result_8_30, name_2=v_name_2_33, break_11=v_break_11_36, i_9=v_i_9_23} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9][49]][17:4A:[121] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse4 (= v_name_3_35 v_current_10_16))) (let ((.cse0 (not v_break_11_42)) (.cse1 (= v_name_2_35 v_current_10_16)) (.cse3 (and .cse2 .cse4))) (and .cse0 (or (and v_break_11_54 (or v_break_11_42 .cse1)) (and .cse0 (not .cse1) .cse2)) (= (ite .cse3 (- 1) (ite .cse1 1 v_result_8_36)) v_result_8_34) (= v_current_10_16 (select v_nondet_0_20 v_i_9_26)) (or (and (or v_break_11_54 .cse3) v_break_11_40) (and .cse2 (or v_break_11_54 (not .cse4)) (not v_break_11_40))) (< v_i_9_26 3) (= v_i_9_25 (+ v_i_9_26 1))))) InVars {name_3=v_name_3_35, result_8=v_result_8_36, name_2=v_name_2_35, break_11=v_break_11_42, nondet_0=v_nondet_0_20, i_9=v_i_9_26} OutVars{name_3=v_name_3_35, result_8=v_result_8_34, name_2=v_name_2_35, break_11=v_break_11_40, current_10=v_current_10_16, nondet_0=v_nondet_0_20, i_9=v_i_9_25} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9][59]] [2023-10-12 17:38:09,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:09,418 INFO L124 PetriNetUnfolderBase]: 8/16 cut-off events. [2023-10-12 17:38:09,418 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:38:09,418 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:09,419 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]true [133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 75#[$Ultimate##0, $Ultimate##0, L108]true [120] $Ultimate##0-->L62: Formula: (let ((.cse1 (not v_break_11_52)) (.cse0 (= v_name_3_33 v_name_2_33))) (and (= v_result_8_30 (ite .cse0 0 v_result_8_31)) .cse1 (or (and (not v_break_11_36) (not .cse0) .cse1) (and (or v_break_11_52 .cse0) v_break_11_36)) (= v_i_9_23 0))) InVars {name_3=v_name_3_33, result_8=v_result_8_31, name_2=v_name_2_33} OutVars{name_3=v_name_3_33, result_8=v_result_8_30, name_2=v_name_2_33, break_11=v_break_11_36, i_9=v_i_9_23} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9] 77#[$Ultimate##0, L108, L62]true [2023-10-12 17:38:09,419 INFO L750 eck$LassoCheckResult]: Loop: 77#[$Ultimate##0, L108, L62]true [121] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse4 (= v_name_3_35 v_current_10_16))) (let ((.cse0 (not v_break_11_42)) (.cse1 (= v_name_2_35 v_current_10_16)) (.cse3 (and .cse2 .cse4))) (and .cse0 (or (and v_break_11_54 (or v_break_11_42 .cse1)) (and .cse0 (not .cse1) .cse2)) (= (ite .cse3 (- 1) (ite .cse1 1 v_result_8_36)) v_result_8_34) (= v_current_10_16 (select v_nondet_0_20 v_i_9_26)) (or (and (or v_break_11_54 .cse3) v_break_11_40) (and .cse2 (or v_break_11_54 (not .cse4)) (not v_break_11_40))) (< v_i_9_26 3) (= v_i_9_25 (+ v_i_9_26 1))))) InVars {name_3=v_name_3_35, result_8=v_result_8_36, name_2=v_name_2_35, break_11=v_break_11_42, nondet_0=v_nondet_0_20, i_9=v_i_9_26} OutVars{name_3=v_name_3_35, result_8=v_result_8_34, name_2=v_name_2_35, break_11=v_break_11_40, current_10=v_current_10_16, nondet_0=v_nondet_0_20, i_9=v_i_9_25} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9] 77#[$Ultimate##0, L108, L62]true [2023-10-12 17:38:09,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash 158964, now seen corresponding path program 1 times [2023-10-12 17:38:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:09,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401621061] [2023-10-12 17:38:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:09,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:38:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340664126] [2023-10-12 17:38:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:09,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 4928005, now seen corresponding path program 1 times [2023-10-12 17:38:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633936353] [2023-10-12 17:38:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:09,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:09,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:09,724 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:09,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:09,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:09,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:09,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:09,725 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:09,725 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:09,726 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:09,726 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:09,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:09,726 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:09,728 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:38:09,730 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:38:09,852 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:38:09,854 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:38:09,959 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:38:10,089 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:38:10,271 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:10,271 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,273 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:38:10,275 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:38:10,276 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:38:10,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:10,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:10,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:10,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:10,284 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:10,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:10,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:10,296 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:38:10,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,298 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38:10,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:38:10,302 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:38:10,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:10,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:10,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:10,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:10,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:10,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:10,326 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:10,331 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:10,331 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:38:10,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:10,342 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38:10,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:38:10,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:10,418 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:10,418 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:10,419 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 5 Supporting invariants [] [2023-10-12 17:38:10,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:38:10,426 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:10,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:10,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:10,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:10,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:10,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:10,450 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:38:10,451 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:38:10,527 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:38:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:38:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:38:10,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:10,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:10,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:10,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:10,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:10,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:10,531 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 425 transitions, 3000 flow [2023-10-12 17:38:10,531 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:10,531 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 425 transitions, 3000 flow [2023-10-12 17:38:10,539 ERROR L47 etriNetUnfolderRabin]: [1:1A:[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][272], 4:2A:[133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][222], 14:3A:[136] L108-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][197], 35:4A:[124] $Ultimate##0-->L88: Formula: (let ((.cse1 (not v_break_15_54)) (.cse0 (= v_name_3_31 v_name_1_37))) (and (= v_result_12_40 (ite .cse0 0 v_result_12_41)) .cse1 (= v_i_13_19 0) (or (and .cse1 (not v_break_15_44) (not .cse0)) (and v_break_15_44 (or .cse0 v_break_15_54))))) InVars {name_3=v_name_3_31, result_12=v_result_12_41, name_1=v_name_1_37} OutVars{name_3=v_name_3_31, result_12=v_result_12_40, i_13=v_i_13_19, name_1=v_name_1_37, break_15=v_break_15_44} AuxVars[v_break_15_54] AssignedVars[result_12, i_13, break_15][147]][36:5A:[125] L88-->L88: Formula: (let ((.cse3 (= v_name_3_29 v_current_14_16)) (.cse2 (not v_break_15_56))) (let ((.cse1 (not v_break_15_40)) (.cse4 (and .cse3 .cse2)) (.cse0 (= v_name_1_35 v_current_14_16))) (and (< v_i_13_16 3) (or (and (or .cse0 v_break_15_40) v_break_15_56) (and .cse1 (not .cse0) .cse2)) (= v_current_14_16 (select v_nondet_0_16 v_i_13_16)) (or (and (or v_break_15_56 (not .cse3)) (not v_break_15_38) .cse2) (and (or v_break_15_56 .cse4) v_break_15_38)) .cse1 (= (+ v_i_13_16 1) v_i_13_15) (= v_result_12_36 (ite .cse4 (- 1) (ite .cse0 1 v_result_12_37)))))) InVars {name_3=v_name_3_29, result_12=v_result_12_37, name_1=v_name_1_35, i_13=v_i_13_16, nondet_0=v_nondet_0_16, break_15=v_break_15_40} OutVars{name_3=v_name_3_29, result_12=v_result_12_36, current_14=v_current_14_16, name_1=v_name_1_35, i_13=v_i_13_15, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_56] AssignedVars[result_12, current_14, i_13, break_15][122]] [2023-10-12 17:38:10,540 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:10,540 INFO L124 PetriNetUnfolderBase]: 21/35 cut-off events. [2023-10-12 17:38:10,540 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:38:10,540 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:10,541 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[$Ultimate##0, L107]true [133] L107-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 75#[$Ultimate##0, $Ultimate##0, L108]true [136] L108-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 111#[L109, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [124] $Ultimate##0-->L88: Formula: (let ((.cse1 (not v_break_15_54)) (.cse0 (= v_name_3_31 v_name_1_37))) (and (= v_result_12_40 (ite .cse0 0 v_result_12_41)) .cse1 (= v_i_13_19 0) (or (and .cse1 (not v_break_15_44) (not .cse0)) (and v_break_15_44 (or .cse0 v_break_15_54))))) InVars {name_3=v_name_3_31, result_12=v_result_12_41, name_1=v_name_1_37} OutVars{name_3=v_name_3_31, result_12=v_result_12_40, i_13=v_i_13_19, name_1=v_name_1_37, break_15=v_break_15_44} AuxVars[v_break_15_54] AssignedVars[result_12, i_13, break_15] 113#[L109, $Ultimate##0, $Ultimate##0, L88]true [2023-10-12 17:38:10,541 INFO L750 eck$LassoCheckResult]: Loop: 113#[L109, $Ultimate##0, $Ultimate##0, L88]true [125] L88-->L88: Formula: (let ((.cse3 (= v_name_3_29 v_current_14_16)) (.cse2 (not v_break_15_56))) (let ((.cse1 (not v_break_15_40)) (.cse4 (and .cse3 .cse2)) (.cse0 (= v_name_1_35 v_current_14_16))) (and (< v_i_13_16 3) (or (and (or .cse0 v_break_15_40) v_break_15_56) (and .cse1 (not .cse0) .cse2)) (= v_current_14_16 (select v_nondet_0_16 v_i_13_16)) (or (and (or v_break_15_56 (not .cse3)) (not v_break_15_38) .cse2) (and (or v_break_15_56 .cse4) v_break_15_38)) .cse1 (= (+ v_i_13_16 1) v_i_13_15) (= v_result_12_36 (ite .cse4 (- 1) (ite .cse0 1 v_result_12_37)))))) InVars {name_3=v_name_3_29, result_12=v_result_12_37, name_1=v_name_1_35, i_13=v_i_13_16, nondet_0=v_nondet_0_16, break_15=v_break_15_40} OutVars{name_3=v_name_3_29, result_12=v_result_12_36, current_14=v_current_14_16, name_1=v_name_1_35, i_13=v_i_13_15, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_56] AssignedVars[result_12, current_14, i_13, break_15] 113#[L109, $Ultimate##0, $Ultimate##0, L88]true [2023-10-12 17:38:10,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 4928504, now seen corresponding path program 1 times [2023-10-12 17:38:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643536836] [2023-10-12 17:38:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:10,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2023-10-12 17:38:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:10,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320176162] [2023-10-12 17:38:10,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:10,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 152783749, now seen corresponding path program 1 times [2023-10-12 17:38:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:10,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977772217] [2023-10-12 17:38:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:10,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:10,824 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:10,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:10,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:10,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:10,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:10,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:10,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:10,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:10,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: name-comparator-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:38:10,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:10,825 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:10,827 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:38:10,829 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:38:10,939 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:38:10,941 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:38:10,943 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:38:10,945 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:38:10,947 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:38:11,034 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:38:11,363 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:11,363 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:11,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:11,364 INFO L229 MonitoredProcess]: Starting monitored process 7 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:38:11,371 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:38:11,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:11,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:11,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:11,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:11,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:11,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:11,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:38:11,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:11,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:11,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:11,399 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:11,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:38:11,419 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:38:11,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:11,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:11,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:11,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:11,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:11,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:11,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:11,443 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:11,443 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:38:11,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:11,459 INFO L229 MonitoredProcess]: Starting monitored process 9 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:38:11,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:38:11,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:11,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:11,470 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:11,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 5 Supporting invariants [] [2023-10-12 17:38:11,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:11,477 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:11,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:11,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:11,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:11,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:11,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:11,514 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:38:11,515 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:38:11,575 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:38:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:38:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:38:11,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:11,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:11,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:38:11,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:11,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:11,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:11,577 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 2125 transitions, 19250 flow [2023-10-12 17:38:11,577 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:11,577 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 2125 transitions, 19250 flow [2023-10-12 17:38:11,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:38:11,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:11,675 INFO L124 PetriNetUnfolderBase]: 193/281 cut-off events. [2023-10-12 17:38:11,676 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-10-12 17:38:11,676 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:11,680 INFO L201 PluginConnector]: Adding new model name-comparator-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:11 BoogieIcfgContainer [2023-10-12 17:38:11,680 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:11,681 INFO L158 Benchmark]: Toolchain (without parser) took 4200.97ms. Allocated memory was 233.8MB in the beginning and 283.1MB in the end (delta: 49.3MB). Free memory was 183.6MB in the beginning and 221.5MB in the end (delta: -38.0MB). Peak memory consumption was 146.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:11,681 INFO L158 Benchmark]: Boogie PL CUP Parser took 1.30ms. Allocated memory is still 233.8MB. Free memory is still 184.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:11,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.79ms. Allocated memory is still 233.8MB. Free memory was 183.4MB in the beginning and 181.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:11,682 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 233.8MB. Free memory was 181.9MB in the beginning and 180.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:11,682 INFO L158 Benchmark]: RCFGBuilder took 327.23ms. Allocated memory is still 233.8MB. Free memory was 180.7MB in the beginning and 191.8MB in the end (delta: -11.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:11,682 INFO L158 Benchmark]: BuchiAutomizer took 3818.00ms. Allocated memory was 233.8MB in the beginning and 283.1MB in the end (delta: 49.3MB). Free memory was 191.8MB in the beginning and 221.5MB in the end (delta: -29.8MB). Peak memory consumption was 155.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:11,683 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 1.30ms. Allocated memory is still 233.8MB. Free memory is still 184.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.79ms. Allocated memory is still 233.8MB. Free memory was 183.4MB in the beginning and 181.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 233.8MB. Free memory was 181.9MB in the beginning and 180.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 327.23ms. Allocated memory is still 233.8MB. Free memory was 180.7MB in the beginning and 191.8MB in the end (delta: -11.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3818.00ms. Allocated memory was 233.8MB in the beginning and 283.1MB in the end (delta: 49.3MB). Free memory was 191.8MB in the beginning and 221.5MB in the end (delta: -29.8MB). Peak memory consumption was 155.0MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_9 + 5 and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * i_13 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 3.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 72 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital101 mio100 ax100 hnf100 lsp219 ukn45 mio100 lsp89 div100 bol110 ite100 ukn100 eq183 hnf99 smp100 dnf521 smp26 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 140ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 88, independent conditional: 0, independent unconditional: 88, 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: 56, independent: 56, independent conditional: 0, independent unconditional: 56, 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: 56, independent: 56, independent conditional: 0, independent unconditional: 56, 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: 88, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, 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 correct! [2023-10-12 17:38:11,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...