/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/popl20/counter-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:41:11,244 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:41:11,287 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:41:11,307 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:41:11,308 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:41:11,308 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:41:11,309 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:41:11,309 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:41:11,310 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:41:11,310 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:41:11,310 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:41:11,311 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:41:11,311 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:41:11,311 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:41:11,312 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:41:11,312 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:41:11,312 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:41:11,313 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:41:11,313 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:41:11,313 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:41:11,313 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:41:11,314 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:41:11,314 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:41:11,315 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:41:11,315 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:41:11,315 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:41:11,315 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:41:11,316 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:41:11,316 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:41:11,316 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:41:11,317 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:41:11,317 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:41:11,317 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:41:11,318 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:41:11,318 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:41:11,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:41:11,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:41:11,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:41:11,559 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:41:11,562 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:41:11,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-fun.wvr.bpl [2023-10-12 17:41:11,565 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/counter-fun.wvr.bpl' [2023-10-12 17:41:11,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:41:11,600 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:41:11,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:11,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:41:11,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:41:11,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,623 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:41:11,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:11,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:41:11,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:41:11,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:41:11,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:41:11,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:41:11,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:41:11,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:41:11,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/1) ... [2023-10-12 17:41:11,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:11,666 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:41:11,681 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:41:11,703 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:41:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:41:11,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:41:11,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:41:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:41:11,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:41:11,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:41:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:41:11,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:41:11,705 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:41:11,745 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:41:11,747 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:41:11,870 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:41:11,886 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:41:11,886 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:41:11,888 INFO L201 PluginConnector]: Adding new model counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:11 BoogieIcfgContainer [2023-10-12 17:41:11,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:41:11,889 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:41:11,889 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:41:11,897 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:41:11,897 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:11,898 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:11" (1/2) ... [2023-10-12 17:41:11,899 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@430f664e and model type counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:41:11, skipping insertion in model container [2023-10-12 17:41:11,900 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:11,900 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:11" (2/2) ... [2023-10-12 17:41:11,902 INFO L332 chiAutomizerObserver]: Analyzing ICFG counter-fun.wvr.bpl [2023-10-12 17:41:11,980 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:41:12,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:41:12,033 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:41:12,033 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:12,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:41:12,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:41:12,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:12,077 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:41:12,097 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:12,100 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:12,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 52 flow [2023-10-12 17:41:12,106 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:41:12,106 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:12,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:41:12,109 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:41:12,312 INFO L134 LiptonReduction]: Checked pairs total: 37 [2023-10-12 17:41:12,312 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:41:12,323 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:41:12,324 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:41:12,324 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:41:12,324 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:41:12,324 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:41:12,324 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:41:12,324 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:41:12,324 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:41:12,325 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:41:12,328 ERROR L47 etriNetUnfolderRabin]: [1:1A:[79] $Ultimate##0-->L48: Formula: (and (= v_i2_22 0) (= v_N2_10 v_N1_10) (= v_i1_22 0) (= v_counter_39 0)) InVars {counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][9], 2:2A:[64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[73] L21-1-->L21-1: Formula: (let ((.cse0 (select v_f_10 v_counter_30))) (and (= v_counter_30 (select v_f_inv_10 .cse0)) (= v_counter_29 .cse0) (= (+ v_i1_17 1) v_i1_16) (< v_i1_17 v_N1_6))) InVars {f_inv=v_f_inv_10, counter=v_counter_30, i1=v_i1_17, f=v_f_10, N1=v_N1_6} OutVars{f_inv=v_f_inv_10, counter=v_counter_29, i1=v_i1_16, f=v_f_10, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][7]] [2023-10-12 17:41:12,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:12,330 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:12,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:12,330 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:12,333 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:41:12,333 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:41:12,334 ERROR L47 etriNetUnfolderRabin]: [1:1A:[79] $Ultimate##0-->L48: Formula: (and (= v_i2_22 0) (= v_N2_10 v_N1_10) (= v_i1_22 0) (= v_counter_39 0)) InVars {counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][9], 2:2A:[64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[73] L21-1-->L21-1: Formula: (let ((.cse0 (select v_f_10 v_counter_30))) (and (= v_counter_30 (select v_f_inv_10 .cse0)) (= v_counter_29 .cse0) (= (+ v_i1_17 1) v_i1_16) (< v_i1_17 v_N1_6))) InVars {f_inv=v_f_inv_10, counter=v_counter_30, i1=v_i1_17, f=v_f_10, N1=v_N1_6} OutVars{f_inv=v_f_inv_10, counter=v_counter_29, i1=v_i1_16, f=v_f_10, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1][7]] [2023-10-12 17:41:12,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:12,334 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:12,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:12,335 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:12,339 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [79] $Ultimate##0-->L48: Formula: (and (= v_i2_22 0) (= v_N2_10 v_N1_10) (= v_i1_22 0) (= v_counter_39 0)) InVars {counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L48]true [64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L48-1, L21-1]true [2023-10-12 17:41:12,339 INFO L750 eck$LassoCheckResult]: Loop: 35#[L48-1, L21-1]true [73] L21-1-->L21-1: Formula: (let ((.cse0 (select v_f_10 v_counter_30))) (and (= v_counter_30 (select v_f_inv_10 .cse0)) (= v_counter_29 .cse0) (= (+ v_i1_17 1) v_i1_16) (< v_i1_17 v_N1_6))) InVars {f_inv=v_f_inv_10, counter=v_counter_30, i1=v_i1_17, f=v_f_10, N1=v_N1_6} OutVars{f_inv=v_f_inv_10, counter=v_counter_29, i1=v_i1_16, f=v_f_10, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 35#[L48-1, L21-1]true [2023-10-12 17:41:12,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 3474, now seen corresponding path program 1 times [2023-10-12 17:41:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334689744] [2023-10-12 17:41:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:12,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:12,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:12,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2023-10-12 17:41:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:12,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425678906] [2023-10-12 17:41:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:12,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:12,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:12,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash 107767, now seen corresponding path program 1 times [2023-10-12 17:41:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:12,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577769745] [2023-10-12 17:41:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:12,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:12,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:12,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:12,535 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:12,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:12,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:12,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:12,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:12,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:12,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:12,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-fun.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:41:12,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:12,537 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:12,551 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:41:12,560 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:41:12,563 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:41:12,577 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:41:12,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:12,652 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,654 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:41:12,656 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:41:12,658 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:41:12,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:12,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:12,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:12,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:12,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:12,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:12,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:12,693 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:41:12,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,697 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:41:12,698 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:41:12,701 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:41:12,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:12,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:12,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:12,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:12,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:12,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:12,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:12,731 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:41:12,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,734 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:41:12,735 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:41:12,737 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:41:12,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:12,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:12,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:12,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:12,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:12,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:12,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:12,768 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:41:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,770 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:41:12,781 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:41:12,789 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:41:12,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:12,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:12,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:12,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:12,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:12,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:12,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:12,859 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:12,859 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:41:12,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:12,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:12,866 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:41:12,867 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:41:12,913 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:12,932 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:12,932 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:12,933 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:41:12,939 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:41:12,942 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:12,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:12,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:12,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:13,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:13,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:13,006 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:41:13,053 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:41:13,129 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:41:13,134 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:41:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:41:13,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:41:13,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:13,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:13,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:13,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:41:13,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:13,140 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:41:13,140 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:41:13,140 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:41:13,143 ERROR L47 etriNetUnfolderRabin]: [1:1A:[79] $Ultimate##0-->L48: Formula: (and (= v_i2_22 0) (= v_N2_10 v_N1_10) (= v_i1_22 0) (= v_counter_39 0)) InVars {counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[][36], 2:2A:[64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 4:3A:[67] L48-1-->L33-1: 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][11]][5:4A:[75] L33-1-->L33-1: Formula: (let ((.cse0 (select v_f_inv_12 v_counter_34))) (and (= v_counter_34 (select v_f_12 .cse0)) (= v_counter_33 .cse0) (= (+ v_i2_17 1) v_i2_16) (< v_i2_17 v_N2_6))) InVars {f_inv=v_f_inv_12, counter=v_counter_34, i2=v_i2_17, f=v_f_12, N2=v_N2_6} OutVars{f_inv=v_f_inv_12, counter=v_counter_33, i2=v_i2_16, f=v_f_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2][33]] [2023-10-12 17:41:13,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:13,143 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:41:13,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:13,144 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:13,144 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [79] $Ultimate##0-->L48: Formula: (and (= v_i2_22 0) (= v_N2_10 v_N1_10) (= v_i1_22 0) (= v_counter_39 0)) InVars {counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_39, i1=v_i1_22, i2=v_i2_22, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L48]true [64] L48-->L21-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L48-1, L21-1]true [67] L48-1-->L33-1: 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] 70#[L49, L21-1, L33-1]true [2023-10-12 17:41:13,145 INFO L750 eck$LassoCheckResult]: Loop: 70#[L49, L21-1, L33-1]true [75] L33-1-->L33-1: Formula: (let ((.cse0 (select v_f_inv_12 v_counter_34))) (and (= v_counter_34 (select v_f_12 .cse0)) (= v_counter_33 .cse0) (= (+ v_i2_17 1) v_i2_16) (< v_i2_17 v_N2_6))) InVars {f_inv=v_f_inv_12, counter=v_counter_34, i2=v_i2_17, f=v_f_12, N2=v_N2_6} OutVars{f_inv=v_f_inv_12, counter=v_counter_33, i2=v_i2_16, f=v_f_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 70#[L49, L21-1, L33-1]true [2023-10-12 17:41:13,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash 107761, now seen corresponding path program 1 times [2023-10-12 17:41:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844674865] [2023-10-12 17:41:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:13,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:13,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:13,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 1 times [2023-10-12 17:41:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23153403] [2023-10-12 17:41:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:13,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:13,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:13,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash 3340666, now seen corresponding path program 1 times [2023-10-12 17:41:13,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459293828] [2023-10-12 17:41:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:13,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:13,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:13,272 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:13,273 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:13,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:13,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:13,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:13,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:13,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:13,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:13,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-fun.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:41:13,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:13,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:13,275 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:41:13,278 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:41:13,280 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:41:13,289 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:41:13,297 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:41:13,300 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:41:13,372 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:13,372 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:13,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:13,377 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:41:13,380 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:41:13,382 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:41:13,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:13,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:13,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:13,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:13,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:13,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:13,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:13,415 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:41:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:13,417 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:41:13,420 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:41:13,421 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:41:13,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:13,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:13,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:13,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:13,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:13,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:13,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:13,450 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:41:13,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:13,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:13,451 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:41:13,454 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:41:13,455 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:41:13,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:13,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:13,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:13,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:13,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:13,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:13,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:13,492 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:41:13,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:13,494 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:41:13,496 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:41:13,498 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:41:13,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:13,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:13,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:13,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:13,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:13,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:13,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:13,545 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:41:13,545 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:41:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:13,557 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:41:13,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:13,570 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:41:13,583 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:13,584 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:13,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2023-10-12 17:41:13,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:41:13,591 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:13,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:13,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:13,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:13,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:13,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:13,633 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:41:13,634 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:41:13,700 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:41:13,703 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:41:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:41:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:13,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:41:13,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:13,707 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 176 transitions, 1248 flow [2023-10-12 17:41:13,708 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:41:13,708 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 176 transitions, 1248 flow [2023-10-12 17:41:13,718 INFO L124 PetriNetUnfolderBase]: 16/32 cut-off events. [2023-10-12 17:41:13,718 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:41:13,719 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:41:13,727 INFO L201 PluginConnector]: Adding new model counter-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:41:13 BoogieIcfgContainer [2023-10-12 17:41:13,727 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:41:13,729 INFO L158 Benchmark]: Toolchain (without parser) took 2127.79ms. Allocated memory was 199.2MB in the beginning and 286.3MB in the end (delta: 87.0MB). Free memory was 153.0MB in the beginning and 169.2MB in the end (delta: -16.2MB). Peak memory consumption was 71.9MB. Max. memory is 8.0GB. [2023-10-12 17:41:13,729 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.34ms. Allocated memory is still 199.2MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:41:13,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.64ms. Allocated memory is still 199.2MB. Free memory was 152.8MB in the beginning and 151.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:41:13,730 INFO L158 Benchmark]: Boogie Preprocessor took 14.25ms. Allocated memory is still 199.2MB. Free memory was 151.4MB in the beginning and 150.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:41:13,732 INFO L158 Benchmark]: RCFGBuilder took 248.38ms. Allocated memory is still 199.2MB. Free memory was 150.2MB in the beginning and 140.6MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:41:13,734 INFO L158 Benchmark]: BuchiAutomizer took 1838.16ms. Allocated memory was 199.2MB in the beginning and 286.3MB in the end (delta: 87.0MB). Free memory was 140.5MB in the beginning and 169.2MB in the end (delta: -28.7MB). Peak memory consumption was 59.3MB. Max. memory is 8.0GB. [2023-10-12 17:41:13,739 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.34ms. Allocated memory is still 199.2MB. Free memory was 154.2MB in the beginning and 154.1MB in the end (delta: 70.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.64ms. Allocated memory is still 199.2MB. Free memory was 152.8MB in the beginning and 151.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.25ms. Allocated memory is still 199.2MB. Free memory was 151.4MB in the beginning and 150.4MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.38ms. Allocated memory is still 199.2MB. Free memory was 150.2MB in the beginning and 140.6MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1838.16ms. Allocated memory was 199.2MB in the beginning and 286.3MB in the end (delta: 87.0MB). Free memory was 140.5MB in the beginning and 169.2MB in the end (delta: -28.7MB). Peak memory consumption was 59.3MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.0s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 60 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq187 hnf89 smp100 dnf100 smp100 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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, 25 PlacesBefore, 16 PlacesAfterwards, 20 TransitionsBefore, 11 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 37, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, 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:41:13,757 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:41:13,958 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:41:14,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...