/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/chromosome-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:54,559 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:54,596 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:37:54,611 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:54,612 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:54,612 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:54,613 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:54,613 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:54,613 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:54,613 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:54,614 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:54,614 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:54,614 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:54,614 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:54,614 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:54,615 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:54,615 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:54,615 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:54,615 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:54,616 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:54,616 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:54,618 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:54,618 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:54,619 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:54,619 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:54,619 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:54,619 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:54,619 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:54,620 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:54,620 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:54,620 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:54,620 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:54,620 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:54,621 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:54,621 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:37:54,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:54,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:54,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:54,833 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:54,833 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:54,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-subst.wvr.bpl [2023-10-12 17:37:54,834 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-subst.wvr.bpl' [2023-10-12 17:37:54,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:54,854 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:54,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:54,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:54,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:54,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,875 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:54,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:54,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:54,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:54,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:54,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:54,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:54,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:54,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:54,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/1) ... [2023-10-12 17:37:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:54,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:54,934 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:37:54,961 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:37:54,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:37:54,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:37:54,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:37:54,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:37:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:37:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:37:54,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:54,969 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:37:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:37:54,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:37:54,970 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:37:55,019 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:55,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:55,138 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:55,214 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:55,214 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:37:55,219 INFO L201 PluginConnector]: Adding new model chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:55 BoogieIcfgContainer [2023-10-12 17:37:55,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:55,220 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:55,220 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:55,223 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:55,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:55,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:54" (1/2) ... [2023-10-12 17:37:55,229 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@269528e4 and model type chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:55, skipping insertion in model container [2023-10-12 17:37:55,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:55,230 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:55" (2/2) ... [2023-10-12 17:37:55,230 INFO L332 chiAutomizerObserver]: Analyzing ICFG chromosome-subst.wvr.bpl [2023-10-12 17:37:55,311 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:37:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:37:55,369 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:37:55,369 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:55,372 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:37:55,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 80 flow [2023-10-12 17:37:55,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2023-10-12 17:37:55,381 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:55,395 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:37:55,400 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 62 flow [2023-10-12 17:37:55,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 62 flow [2023-10-12 17:37:55,405 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2023-10-12 17:37:55,405 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:55,406 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:37:55,407 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:37:55,586 INFO L134 LiptonReduction]: Checked pairs total: 88 [2023-10-12 17:37:55,586 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:37:55,597 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:55,598 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:55,598 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:55,598 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:55,598 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:55,598 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:55,598 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:55,598 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:55,599 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:37:55,602 ERROR L47 etriNetUnfolderRabin]: [1:1A:[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 2:2A:[104] $Ultimate##0-->L35: Formula: (and (= v_result_7_13 1) (= v_i_8_13 0) (not v_isNull_1_5) (or (and (not v_break_6_10) (not v_isNull_3_5)) (and v_break_6_10 v_isNull_3_5))) InVars {isNull_1=v_isNull_1_5, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_5, isNull_3=v_isNull_3_5, i_8=v_i_8_13, result_7=v_result_7_13, break_6=v_break_6_10} AuxVars[] AssignedVars[result_7, break_6, i_8][0]][3:3A:[105] L35-->L35: Formula: (and (< v_i_8_20 5) (not v_break_6_15) (let ((.cse0 (= v_result_7_17 0))) (or (and (not .cse0) v_break_6_14) (and .cse0 (not v_break_6_14)))) (= (+ v_result_7_17 (select v_o_2_13 v_i_8_20)) (select v_o_0_13 v_i_8_20)) (= (+ v_i_8_20 1) v_i_8_19)) InVars {o_0=v_o_0_13, o_2=v_o_2_13, i_8=v_i_8_20, break_6=v_break_6_15} OutVars{o_0=v_o_0_13, o_2=v_o_2_13, i_8=v_i_8_19, break_6=v_break_6_14, result_7=v_result_7_17} AuxVars[] AssignedVars[break_6, result_7, i_8][9]] [2023-10-12 17:37:55,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:55,606 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:55,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:55,606 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:55,609 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:55,609 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:37:55,610 ERROR L47 etriNetUnfolderRabin]: [1:1A:[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 2:2A:[104] $Ultimate##0-->L35: Formula: (and (= v_result_7_13 1) (= v_i_8_13 0) (not v_isNull_1_5) (or (and (not v_break_6_10) (not v_isNull_3_5)) (and v_break_6_10 v_isNull_3_5))) InVars {isNull_1=v_isNull_1_5, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_5, isNull_3=v_isNull_3_5, i_8=v_i_8_13, result_7=v_result_7_13, break_6=v_break_6_10} AuxVars[] AssignedVars[result_7, break_6, i_8][0]][3:3A:[105] L35-->L35: Formula: (and (< v_i_8_20 5) (not v_break_6_15) (let ((.cse0 (= v_result_7_17 0))) (or (and (not .cse0) v_break_6_14) (and .cse0 (not v_break_6_14)))) (= (+ v_result_7_17 (select v_o_2_13 v_i_8_20)) (select v_o_0_13 v_i_8_20)) (= (+ v_i_8_20 1) v_i_8_19)) InVars {o_0=v_o_0_13, o_2=v_o_2_13, i_8=v_i_8_20, break_6=v_break_6_15} OutVars{o_0=v_o_0_13, o_2=v_o_2_13, i_8=v_i_8_19, break_6=v_break_6_14, result_7=v_result_7_17} AuxVars[] AssignedVars[break_6, result_7, i_8][9]] [2023-10-12 17:37:55,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:55,610 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:37:55,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:55,610 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:55,614 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [118] $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, L100]true [104] $Ultimate##0-->L35: Formula: (and (= v_result_7_13 1) (= v_i_8_13 0) (not v_isNull_1_5) (or (and (not v_break_6_10) (not v_isNull_3_5)) (and v_break_6_10 v_isNull_3_5))) InVars {isNull_1=v_isNull_1_5, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_5, isNull_3=v_isNull_3_5, i_8=v_i_8_13, result_7=v_result_7_13, break_6=v_break_6_10} AuxVars[] AssignedVars[result_7, break_6, i_8] 40#[L100, L35]true [2023-10-12 17:37:55,614 INFO L750 eck$LassoCheckResult]: Loop: 40#[L100, L35]true [105] L35-->L35: Formula: (and (< v_i_8_20 5) (not v_break_6_15) (let ((.cse0 (= v_result_7_17 0))) (or (and (not .cse0) v_break_6_14) (and .cse0 (not v_break_6_14)))) (= (+ v_result_7_17 (select v_o_2_13 v_i_8_20)) (select v_o_0_13 v_i_8_20)) (= (+ v_i_8_20 1) v_i_8_19)) InVars {o_0=v_o_0_13, o_2=v_o_2_13, i_8=v_i_8_20, break_6=v_break_6_15} OutVars{o_0=v_o_0_13, o_2=v_o_2_13, i_8=v_i_8_19, break_6=v_break_6_14, result_7=v_result_7_17} AuxVars[] AssignedVars[break_6, result_7, i_8] 40#[L100, L35]true [2023-10-12 17:37:55,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash 4723, now seen corresponding path program 1 times [2023-10-12 17:37:55,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355579996] [2023-10-12 17:37:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:37:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897442337] [2023-10-12 17:37:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash 146518, now seen corresponding path program 1 times [2023-10-12 17:37:55,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:55,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770656558] [2023-10-12 17:37:55,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:55,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:55,955 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:55,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:55,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:55,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:55,956 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:55,956 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:55,956 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:55,956 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:55,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:55,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:55,957 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:55,973 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:37:55,979 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:37:55,982 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:37:56,165 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:56,167 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,171 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:37:56,175 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:37:56,177 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:37:56,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:56,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:56,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:56,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:56,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:56,210 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:37:56,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,213 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:37:56,215 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:37:56,217 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:37:56,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:56,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:56,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:56,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:56,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:56,242 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:37:56,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,243 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:37:56,249 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:37:56,249 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:37:56,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:56,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:56,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:56,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:56,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:56,297 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:56,297 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:37:56,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,302 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:37:56,303 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:37:56,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:56,362 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:56,362 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:56,363 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_8) = -2*i_8 + 9 Supporting invariants [] [2023-10-12 17:37:56,368 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:37:56,371 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:56,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:56,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:56,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:56,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:56,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:56,417 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:37:56,443 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:37:56,513 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:37:56,526 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:37:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:37:56,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:37:56,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:56,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:56,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:56,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:37:56,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:56,532 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 85 transitions, 430 flow [2023-10-12 17:37:56,532 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:56,532 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 85 transitions, 430 flow [2023-10-12 17:37:56,536 ERROR L47 etriNetUnfolderRabin]: [1:1A:[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][59], 4:2A:[121] L100-->$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:[108] $Ultimate##0-->L59: Formula: (and (or (and (not v_break_9_20) (not v_isNull_5_13)) (and v_break_9_20 v_isNull_5_13)) (not v_isNull_1_9) (= v_result_10_19 1) (= v_i_11_15 0)) InVars {isNull_5=v_isNull_5_13, isNull_1=v_isNull_1_9} OutVars{isNull_5=v_isNull_5_13, i_11=v_i_11_15, break_9=v_break_9_20, isNull_1=v_isNull_1_9, result_10=v_result_10_19} AuxVars[] AssignedVars[break_9, i_11, result_10][54]][17:4A:[110] L59-->L59: Formula: (and (= (select v_o_0_15 v_i_11_18) (+ v_result_10_21 (select v_o_4_11 v_i_11_18))) (let ((.cse0 (= v_result_10_21 0))) (or (and v_break_9_22 (not .cse0)) (and .cse0 (not v_break_9_22)))) (not v_break_9_23) (= (+ v_i_11_18 1) v_i_11_17) (< v_i_11_18 5)) InVars {i_11=v_i_11_18, o_0=v_o_0_15, break_9=v_break_9_23, o_4=v_o_4_11} OutVars{i_11=v_i_11_17, o_0=v_o_0_15, break_9=v_break_9_22, result_10=v_result_10_21, o_4=v_o_4_11} AuxVars[] AssignedVars[break_9, i_11, result_10][39]] [2023-10-12 17:37:56,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:56,536 INFO L124 PetriNetUnfolderBase]: 8/16 cut-off events. [2023-10-12 17:37:56,536 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:56,536 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:56,537 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [118] $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, L100]true [121] L100-->$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#[L101, $Ultimate##0, $Ultimate##0]true [108] $Ultimate##0-->L59: Formula: (and (or (and (not v_break_9_20) (not v_isNull_5_13)) (and v_break_9_20 v_isNull_5_13)) (not v_isNull_1_9) (= v_result_10_19 1) (= v_i_11_15 0)) InVars {isNull_5=v_isNull_5_13, isNull_1=v_isNull_1_9} OutVars{isNull_5=v_isNull_5_13, i_11=v_i_11_15, break_9=v_break_9_20, isNull_1=v_isNull_1_9, result_10=v_result_10_19} AuxVars[] AssignedVars[break_9, i_11, result_10] 77#[L101, $Ultimate##0, L59]true [2023-10-12 17:37:56,537 INFO L750 eck$LassoCheckResult]: Loop: 77#[L101, $Ultimate##0, L59]true [110] L59-->L59: Formula: (and (= (select v_o_0_15 v_i_11_18) (+ v_result_10_21 (select v_o_4_11 v_i_11_18))) (let ((.cse0 (= v_result_10_21 0))) (or (and v_break_9_22 (not .cse0)) (and .cse0 (not v_break_9_22)))) (not v_break_9_23) (= (+ v_i_11_18 1) v_i_11_17) (< v_i_11_18 5)) InVars {i_11=v_i_11_18, o_0=v_o_0_15, break_9=v_break_9_23, o_4=v_o_4_11} OutVars{i_11=v_i_11_17, o_0=v_o_0_15, break_9=v_break_9_22, result_10=v_result_10_21, o_4=v_o_4_11} AuxVars[] AssignedVars[break_9, i_11, result_10] 77#[L101, $Ultimate##0, L59]true [2023-10-12 17:37:56,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash 147048, now seen corresponding path program 1 times [2023-10-12 17:37:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513058267] [2023-10-12 17:37:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:56,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:56,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:56,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:37:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059896943] [2023-10-12 17:37:56,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:56,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:56,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:56,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 4558598, now seen corresponding path program 1 times [2023-10-12 17:37:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499148978] [2023-10-12 17:37:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:56,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:56,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:56,697 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:56,697 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:56,697 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:56,697 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:56,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:56,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:56,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:56,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:56,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:56,698 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:56,699 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:37:56,701 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:37:56,725 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:37:56,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:37:56,731 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:37:56,887 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:56,887 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:56,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,888 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:37:56,890 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:37:56,892 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:37:56,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:56,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:56,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:56,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:56,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:56,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:56,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:56,933 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:37:56,936 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:37:56,937 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:37:56,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:56,944 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:37:56,944 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:37:56,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:56,973 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2023-10-12 17:37:56,973 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:37:57,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:57,052 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:37:57,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:57,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:57,053 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:37:57,055 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:37:57,057 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:37:57,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:57,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:57,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:57,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:57,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:57,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:57,088 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:57,092 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:57,093 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-10-12 17:37:57,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:57,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:57,099 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:37:57,100 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:37:57,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:57,122 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:57,122 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:57,122 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_11) = -2*i_11 + 9 Supporting invariants [] [2023-10-12 17:37:57,125 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:37:57,126 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:57,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:57,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:57,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:57,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:57,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:57,155 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:37:57,156 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:37:57,218 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:37:57,219 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:37:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:37:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:57,222 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 425 transitions, 3000 flow [2023-10-12 17:37:57,222 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:57,222 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 425 transitions, 3000 flow [2023-10-12 17:37:57,228 ERROR L47 etriNetUnfolderRabin]: [1:1A:[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][297], 4:2A:[121] L100-->$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:[124] L101-->$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][147], 35:4A:[112] $Ultimate##0-->L83: Formula: (and (or (and (not v_break_12_16) (not v_isNull_5_11)) (and v_break_12_16 v_isNull_5_11)) (= v_result_13_19 1) (not v_isNull_3_7) (= v_i_14_17 0)) InVars {isNull_5=v_isNull_5_11, isNull_3=v_isNull_3_7} OutVars{isNull_5=v_isNull_5_11, result_13=v_result_13_19, break_12=v_break_12_16, i_14=v_i_14_17, isNull_3=v_isNull_3_7} AuxVars[] AssignedVars[result_13, break_12, i_14][122]][36:5A:[114] L83-->L83: Formula: (and (< v_i_14_24 5) (= (+ v_i_14_24 1) v_i_14_23) (let ((.cse0 (= v_result_13_23 0))) (or (and .cse0 (not v_break_12_20)) (and (not .cse0) v_break_12_20))) (not v_break_12_21) (= (select v_o_2_17 v_i_14_24) (+ v_result_13_23 (select v_o_4_15 v_i_14_24)))) InVars {break_12=v_break_12_21, i_14=v_i_14_24, o_2=v_o_2_17, o_4=v_o_4_15} OutVars{break_12=v_break_12_20, result_13=v_result_13_23, i_14=v_i_14_23, o_2=v_o_2_17, o_4=v_o_4_15} AuxVars[] AssignedVars[break_12, result_13, i_14][72]] [2023-10-12 17:37:57,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:57,228 INFO L124 PetriNetUnfolderBase]: 21/35 cut-off events. [2023-10-12 17:37:57,228 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:37:57,228 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:57,229 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [118] $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, L100]true [121] L100-->$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#[L101, $Ultimate##0, $Ultimate##0]true [124] L101-->$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#[$Ultimate##0, L102, $Ultimate##0, $Ultimate##0]true [112] $Ultimate##0-->L83: Formula: (and (or (and (not v_break_12_16) (not v_isNull_5_11)) (and v_break_12_16 v_isNull_5_11)) (= v_result_13_19 1) (not v_isNull_3_7) (= v_i_14_17 0)) InVars {isNull_5=v_isNull_5_11, isNull_3=v_isNull_3_7} OutVars{isNull_5=v_isNull_5_11, result_13=v_result_13_19, break_12=v_break_12_16, i_14=v_i_14_17, isNull_3=v_isNull_3_7} AuxVars[] AssignedVars[result_13, break_12, i_14] 113#[$Ultimate##0, L102, $Ultimate##0, L83]true [2023-10-12 17:37:57,229 INFO L750 eck$LassoCheckResult]: Loop: 113#[$Ultimate##0, L102, $Ultimate##0, L83]true [114] L83-->L83: Formula: (and (< v_i_14_24 5) (= (+ v_i_14_24 1) v_i_14_23) (let ((.cse0 (= v_result_13_23 0))) (or (and .cse0 (not v_break_12_20)) (and (not .cse0) v_break_12_20))) (not v_break_12_21) (= (select v_o_2_17 v_i_14_24) (+ v_result_13_23 (select v_o_4_15 v_i_14_24)))) InVars {break_12=v_break_12_21, i_14=v_i_14_24, o_2=v_o_2_17, o_4=v_o_4_15} OutVars{break_12=v_break_12_20, result_13=v_result_13_23, i_14=v_i_14_23, o_2=v_o_2_17, o_4=v_o_4_15} AuxVars[] AssignedVars[break_12, result_13, i_14] 113#[$Ultimate##0, L102, $Ultimate##0, L83]true [2023-10-12 17:37:57,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 4559096, now seen corresponding path program 1 times [2023-10-12 17:37:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368212842] [2023-10-12 17:37:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:57,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:57,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:57,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 145, now seen corresponding path program 1 times [2023-10-12 17:37:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:57,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409265171] [2023-10-12 17:37:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:57,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:57,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:57,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 141332090, now seen corresponding path program 1 times [2023-10-12 17:37:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973663282] [2023-10-12 17:37:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:57,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:57,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:57,355 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:57,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:57,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:57,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:57,356 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:57,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:57,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:57,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:57,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:37:57,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:57,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:57,358 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:37:57,379 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:37:57,381 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:37:57,383 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:37:57,385 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:37:57,386 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:37:57,388 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:37:57,390 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:37:57,540 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:57,541 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:57,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:57,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:57,542 INFO L229 MonitoredProcess]: Starting monitored process 10 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:37:57,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:37:57,556 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:37:57,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:57,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:57,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:57,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:57,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:57,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:57,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:57,586 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:37:57,586 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:37:57,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:57,599 INFO L229 MonitoredProcess]: Starting monitored process 11 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:37:57,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:37:57,601 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:57,622 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:57,622 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:57,622 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_14) = -2*i_14 + 9 Supporting invariants [] [2023-10-12 17:37:57,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:57,629 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:57,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:57,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:57,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:57,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:57,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:57,677 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:37:57,677 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:37:57,681 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:37:57,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:57,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:57,740 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:37:57,740 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:37:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-10-12 17:37:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:57,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:57,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:57,741 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 2125 transitions, 19250 flow [2023-10-12 17:37:57,741 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:57,741 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 2125 transitions, 19250 flow [2023-10-12 17:37:57,822 INFO L124 PetriNetUnfolderBase]: 193/281 cut-off events. [2023-10-12 17:37:57,823 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-10-12 17:37:57,823 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:57,827 INFO L201 PluginConnector]: Adding new model chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:57 BoogieIcfgContainer [2023-10-12 17:37:57,827 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:57,827 INFO L158 Benchmark]: Toolchain (without parser) took 2973.30ms. Allocated memory was 186.6MB in the beginning and 286.3MB in the end (delta: 99.6MB). Free memory was 141.3MB in the beginning and 224.9MB in the end (delta: -83.6MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2023-10-12 17:37:57,828 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 186.6MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:57,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.65ms. Allocated memory is still 186.6MB. Free memory was 141.3MB in the beginning and 139.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:57,828 INFO L158 Benchmark]: Boogie Preprocessor took 21.56ms. Allocated memory is still 186.6MB. Free memory was 139.8MB in the beginning and 138.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:57,829 INFO L158 Benchmark]: RCFGBuilder took 320.05ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 161.3MB in the end (delta: -22.7MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:57,829 INFO L158 Benchmark]: BuchiAutomizer took 2606.88ms. Allocated memory was 186.6MB in the beginning and 286.3MB in the end (delta: 99.6MB). Free memory was 161.3MB in the beginning and 224.9MB in the end (delta: -63.5MB). Peak memory consumption was 36.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:57,830 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.21ms. Allocated memory is still 186.6MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.65ms. Allocated memory is still 186.6MB. Free memory was 141.3MB in the beginning and 139.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.56ms. Allocated memory is still 186.6MB. Free memory was 139.8MB in the beginning and 138.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 320.05ms. Allocated memory is still 186.6MB. Free memory was 138.6MB in the beginning and 161.3MB in the end (delta: -22.7MB). Peak memory consumption was 20.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 2606.88ms. Allocated memory was 186.6MB in the beginning and 286.3MB in the end (delta: 99.6MB). Free memory was 161.3MB in the beginning and 224.9MB in the end (delta: -63.5MB). Peak memory consumption was 36.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 9 + -2 * i_8 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_11 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_14 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.7s. 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: inital61 mio100 ax100 hnf100 lsp77 ukn91 mio100 lsp74 div100 bol131 ite100 ukn100 eq142 hnf96 smp100 dnf315 smp49 tf100 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 113ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - 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.2s, 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:37:57,892 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...