/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/clever.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:30,570 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:30,641 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:30,673 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:30,674 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:30,674 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:30,675 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:30,675 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:30,675 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:30,676 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:30,676 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:30,679 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:30,679 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:30,683 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:30,683 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:30,684 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:30,685 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:30,685 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:30,685 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:30,685 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:30,686 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:30,686 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:30,686 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:30,686 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:30,686 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:30,687 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:30,687 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:30,687 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:30,687 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:30,687 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:30,688 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:30,688 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:30,689 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:30,690 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:30,690 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:30,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:30,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:30,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:30,941 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:30,942 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:30,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/clever.wvr.bpl [2023-10-12 17:37:30,944 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/clever.wvr.bpl' [2023-10-12 17:37:30,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:30,970 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:30,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:30,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:30,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:30,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:30,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:30,995 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:30,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:30,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:30,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:30,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:31,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:31,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:31,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:31,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:31,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/1) ... [2023-10-12 17:37:31,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:31,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:31,050 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:31,064 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:31,091 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:37:31,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:37:31,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:37:31,092 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:37:31,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:37:31,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:37:31,092 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:31,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:31,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:31,093 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:31,135 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:31,137 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:31,211 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:31,216 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:31,216 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:31,218 INFO L201 PluginConnector]: Adding new model clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:31 BoogieIcfgContainer [2023-10-12 17:37:31,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:31,219 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:31,219 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:31,222 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:31,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:31,223 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:30" (1/2) ... [2023-10-12 17:37:31,224 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fead118 and model type clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:31, skipping insertion in model container [2023-10-12 17:37:31,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:31,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:31" (2/2) ... [2023-10-12 17:37:31,225 INFO L332 chiAutomizerObserver]: Analyzing ICFG clever.wvr.bpl [2023-10-12 17:37:31,276 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:31,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 72 flow [2023-10-12 17:37:31,322 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2023-10-12 17:37:31,322 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:31,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:37:31,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 72 flow [2023-10-12 17:37:31,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 24 transitions, 60 flow [2023-10-12 17:37:31,355 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:31,372 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 24 transitions, 60 flow [2023-10-12 17:37:31,374 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 60 flow [2023-10-12 17:37:31,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 60 flow [2023-10-12 17:37:31,380 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2023-10-12 17:37:31,380 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:37:31,381 INFO L119 LiptonReduction]: Number of co-enabled transitions 118 [2023-10-12 17:37:31,608 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:37:31,608 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:37:31,621 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:31,621 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:31,621 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:31,621 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:31,621 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:31,622 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:31,622 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:31,622 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:31,623 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 17 places, 13 transitions, 38 flow [2023-10-12 17:37:31,626 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][6], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 3:3A:[77] L44-1-->L33: 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][2]][4:4A:[91] L33-->L33: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= (+ v_m_13 v_k2_16) v_k2_15) (< v_i2_13 v_n_13)) InVars {n=v_n_13, m=v_m_13, i2=v_i2_13, k2=v_k2_16} OutVars{n=v_n_13, m=v_m_13, i2=v_i2_12, k2=v_k2_15} AuxVars[] AssignedVars[i2, k2][11]] [2023-10-12 17:37:31,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:31,629 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:31,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:31,630 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:31,636 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:31,637 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 17 places, 13 transitions, 38 flow [2023-10-12 17:37:31,641 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][6], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 3:3A:[77] L44-1-->L33: 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][2]][4:4A:[91] L33-->L33: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= (+ v_m_13 v_k2_16) v_k2_15) (< v_i2_13 v_n_13)) InVars {n=v_n_13, m=v_m_13, i2=v_i2_13, k2=v_k2_16} OutVars{n=v_n_13, m=v_m_13, i2=v_i2_12, k2=v_k2_15} AuxVars[] AssignedVars[i2, k2][11]] [2023-10-12 17:37:31,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:31,641 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:37:31,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:31,641 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:31,648 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[] 36#[L44]true [74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L20, L44-1]true [77] L44-1-->L33: 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] 40#[L33, L45, L20]true [2023-10-12 17:37:31,648 INFO L750 eck$LassoCheckResult]: Loop: 40#[L33, L45, L20]true [91] L33-->L33: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= (+ v_m_13 v_k2_16) v_k2_15) (< v_i2_13 v_n_13)) InVars {n=v_n_13, m=v_m_13, i2=v_i2_13, k2=v_k2_16} OutVars{n=v_n_13, m=v_m_13, i2=v_i2_12, k2=v_k2_15} AuxVars[] AssignedVars[i2, k2] 40#[L33, L45, L20]true [2023-10-12 17:37:31,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 116730, now seen corresponding path program 1 times [2023-10-12 17:37:31,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:31,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800820112] [2023-10-12 17:37:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:31,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:31,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:31,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 1 times [2023-10-12 17:37:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:31,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859980587] [2023-10-12 17:37:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:31,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:31,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:31,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash 3618721, now seen corresponding path program 1 times [2023-10-12 17:37:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:31,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094605032] [2023-10-12 17:37:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:31,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:31,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:31,877 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:31,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:31,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:31,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:31,878 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:37:31,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:31,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:31,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:31,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:37:31,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:31,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:31,895 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:31,909 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:31,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:31,949 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:37:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:31,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:31,954 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:31,955 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:31,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:37:31,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:31,991 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:37:31,992 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, k2=0} Honda state: {m=0, k2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:37:31,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:37:31,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,001 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:32,005 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:32,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:37:32,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:32,031 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:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,033 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:32,035 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:32,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:37:32,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:32,134 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:37:32,137 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:32,137 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:32,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:32,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:32,138 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:32,138 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:32,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:32,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:32,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:37:32,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:32,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:32,139 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:32,148 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:32,185 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:32,189 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,191 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:32,197 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:32,200 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:32,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:32,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:32,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:32,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:32,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:32,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:32,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:32,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:32,242 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:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,244 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:32,251 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:32,253 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:32,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:32,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:32,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:32,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:32,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:32,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:32,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:32,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:32,280 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:32,281 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:32,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,287 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:32,288 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:32,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:32,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:37:32,314 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:32,314 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, n) = -1*i2 + 1*n Supporting invariants [] [2023-10-12 17:37:32,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:37:32,321 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:32,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:32,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:32,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:32,376 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:32,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:32,377 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:32,402 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:32,483 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:32,496 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:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-10-12 17:37:32,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 160 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:32,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:32,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 160 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:32,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:32,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 160 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:32,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:32,502 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 52 transitions, 256 flow [2023-10-12 17:37:32,502 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:32,503 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 21 places, 52 transitions, 256 flow [2023-10-12 17:37:32,509 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][26], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2], 6:3A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][34]][7:4A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][50]] [2023-10-12 17:37:32,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:32,510 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2023-10-12 17:37:32,510 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:32,510 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:32,512 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[] 36#[L44]true [74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L20, L44-1]true [83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1] 79#[L22-1, L44-1]true [2023-10-12 17:37:32,512 INFO L750 eck$LassoCheckResult]: Loop: 79#[L22-1, L44-1]true [89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1] 79#[L22-1, L44-1]true [2023-10-12 17:37:32,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 116736, now seen corresponding path program 1 times [2023-10-12 17:37:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359852382] [2023-10-12 17:37:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:32,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:32,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:32,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2023-10-12 17:37:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:32,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601897027] [2023-10-12 17:37:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:32,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:32,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:32,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 3618905, now seen corresponding path program 1 times [2023-10-12 17:37:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:32,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12638485] [2023-10-12 17:37:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:32,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:32,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:32,587 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:32,587 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:32,587 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:32,587 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:32,588 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:37:32,588 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,588 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:32,588 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:32,588 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:37:32,588 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:32,588 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:32,589 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:32,595 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:32,617 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:32,618 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:37:32,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,625 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:32,626 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:32,627 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:37:32,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:32,654 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:32,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,657 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:32,660 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:32,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:37:32,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:32,757 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:37:32,761 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:32,761 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:32,761 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:32,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:32,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:32,761 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:32,761 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,761 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:32,761 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:32,762 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:37:32,762 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:32,762 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:32,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:32,769 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:32,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:32,799 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,800 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:32,804 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:32,805 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:32,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:32,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:32,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:32,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:32,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:32,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:32,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:32,828 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:32,831 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:32,831 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:32,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:32,837 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:32,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:32,841 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:37:32,842 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:32,842 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, m) = -1*j1 + 1*m Supporting invariants [] [2023-10-12 17:37:32,850 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:32,851 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:32,852 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:32,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:32,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:32,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:32,891 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:32,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:32,892 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:32,892 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:32,969 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:32,969 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:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-10-12 17:37:32,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:32,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:32,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:32,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:32,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:32,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:32,973 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 260 transitions, 1800 flow [2023-10-12 17:37:32,973 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:32,973 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 260 transitions, 1800 flow [2023-10-12 17:37:32,989 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][132], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 6:3A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][172], 24:4A:[87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1][154], 42:5A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][173]][43:6A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][250]] [2023-10-12 17:37:32,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:32,990 INFO L124 PetriNetUnfolderBase]: 23/42 cut-off events. [2023-10-12 17:37:32,990 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:37:32,990 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:32,991 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[] 36#[L44]true [74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L20, L44-1]true [83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1] 79#[L22-1, L44-1]true [87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1] 38#[L20, L44-1]true [83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1] 79#[L22-1, L44-1]true [2023-10-12 17:37:32,991 INFO L750 eck$LassoCheckResult]: Loop: 79#[L22-1, L44-1]true [89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1] 79#[L22-1, L44-1]true [2023-10-12 17:37:32,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 112186076, now seen corresponding path program 1 times [2023-10-12 17:37:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:32,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451978041] [2023-10-12 17:37:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:33,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:33,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:33,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 2 times [2023-10-12 17:37:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638372848] [2023-10-12 17:37:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:33,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:33,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:33,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -817198851, now seen corresponding path program 1 times [2023-10-12 17:37:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:33,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726584706] [2023-10-12 17:37:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:33,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:37:33,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726584706] [2023-10-12 17:37:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726584706] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:37:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792964554] [2023-10-12 17:37:33,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:33,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:37:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:33,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:37:33,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-10-12 17:37:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:33,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:37:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:37:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792964554] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:37:33,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:37:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-10-12 17:37:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766086737] [2023-10-12 17:37:33,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:37:33,254 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:33,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:33,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:33,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:33,254 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:37:33,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:33,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:33,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:33,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:37:33,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:33,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:33,256 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:33,261 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:33,285 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:33,299 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:33,303 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:33,303 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:37:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:33,304 INFO L229 MonitoredProcess]: Starting monitored process 13 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:33,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:37:33,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:37:33,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:33,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:33,348 INFO L229 MonitoredProcess]: Starting monitored process 14 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:33,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:37:33,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:33,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:37:33,455 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:37:33,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:33,458 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:33,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:33,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:33,458 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:33,458 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:33,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:33,458 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:33,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:33,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:37:33,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:33,458 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:33,459 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:33,470 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:33,493 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:33,494 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:33,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:33,504 INFO L229 MonitoredProcess]: Starting monitored process 15 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:33,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:37:33,508 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:33,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:33,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:33,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:33,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:33,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:33,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:33,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:33,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:33,533 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:33,533 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:37:33,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:33,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:33,537 INFO L229 MonitoredProcess]: Starting monitored process 16 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:33,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:37:33,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:33,541 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:37:33,541 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:33,541 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(m, j1) = 1*m - 1*j1 Supporting invariants [] [2023-10-12 17:37:33,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:33,549 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:33,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,589 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,589 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:33,590 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:33,651 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:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-10-12 17:37:33,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:33,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:33,653 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:37:33,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,683 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,684 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:33,684 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:33,737 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:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-10-12 17:37:33,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:33,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:33,739 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:37:33,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:33,778 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:33,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:33,779 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:33,780 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:37:33,780 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:33,859 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 302 transitions. [2023-10-12 17:37:33,861 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:37:33,895 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:37:33,897 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:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2023-10-12 17:37:33,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 157 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:33,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:33,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 157 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:33,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:33,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 157 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:33,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:37:33,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-10-12 17:37:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:37:33,903 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 38 places, 3800 transitions, 34240 flow. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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:33,903 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:37:33,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:37:34,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:34,325 INFO L124 PetriNetUnfolderBase]: 318/577 cut-off events. [2023-10-12 17:37:34,325 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-10-12 17:37:34,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 577 events. 318/577 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2540 event pairs, 4 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 2174. Up to 381 conditions per place. [2023-10-12 17:37:34,336 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 219 selfloop transitions, 57 changer transitions 94/370 dead transitions. [2023-10-12 17:37:34,337 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 37 places, 370 transitions, 3937 flow [2023-10-12 17:37:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-10-12 17:37:34,341 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 370 transitions, 3937 flow [2023-10-12 17:37:34,341 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:34,341 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 370 transitions, 3937 flow [2023-10-12 17:37:34,362 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][0], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][3], 13:4A:[87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1][10], 67:5A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][34]][158:6A:[87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1][96], 159:7A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][166]] [2023-10-12 17:37:34,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:34,362 INFO L124 PetriNetUnfolderBase]: 90/158 cut-off events. [2023-10-12 17:37:34,362 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:37:34,362 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:34,363 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[] 36#[L44]true [74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L20, L44-1]true [83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1] 79#[L22-1, L44-1]true [87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1] 38#[L20, L44-1]true [83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1] 79#[L22-1, L44-1]true [2023-10-12 17:37:34,363 INFO L750 eck$LassoCheckResult]: Loop: 79#[L22-1, L44-1]true [87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1] 38#[L20, L44-1]true [83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1] 79#[L22-1, L44-1]true [2023-10-12 17:37:34,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash 112186076, now seen corresponding path program 2 times [2023-10-12 17:37:34,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:34,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346337809] [2023-10-12 17:37:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:34,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:34,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:34,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 3741, now seen corresponding path program 1 times [2023-10-12 17:37:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078350884] [2023-10-12 17:37:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:34,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:34,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:34,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:34,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash 436639416, now seen corresponding path program 3 times [2023-10-12 17:37:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:34,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461196090] [2023-10-12 17:37:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:34,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:34,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:34,406 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:34,406 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:34,406 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:34,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:34,407 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:37:34,407 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,407 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:34,407 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:34,407 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:37:34,407 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:34,407 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:34,407 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:34,412 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:34,435 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:34,436 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:37:34,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:34,437 INFO L229 MonitoredProcess]: Starting monitored process 17 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:34,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:37:34,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:37:34,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:34,463 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:37:34,463 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, j1=0} Honda state: {m=0, j1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:37:34,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:34,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:34,473 INFO L229 MonitoredProcess]: Starting monitored process 18 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:34,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:37:34,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:37:34,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:34,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:34,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:34,508 INFO L229 MonitoredProcess]: Starting monitored process 19 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:34,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:37:34,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:37:34,512 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:37:34,757 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:37:34,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:34,761 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:34,761 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:34,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:34,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:34,761 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:34,761 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,761 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:34,761 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:34,761 INFO L133 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:37:34,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:34,762 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:34,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:34,768 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:34,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:34,799 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:34,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:34,900 INFO L229 MonitoredProcess]: Starting monitored process 20 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:34,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:37:34,905 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:34,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:34,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:34,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:34,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:34,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:34,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:34,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:34,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:34,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:34,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:34,920 INFO L229 MonitoredProcess]: Starting monitored process 21 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:34,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:37:34,923 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:34,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:34,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:34,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:34,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:34,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:34,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:34,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:34,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:34,945 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:37:34,945 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:37:34,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:34,946 INFO L229 MonitoredProcess]: Starting monitored process 22 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:34,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:34,960 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:37:34,960 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:34,960 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, n) = -1*i1 + 1*n Supporting invariants [] [2023-10-12 17:37:34,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:37:34,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:34,968 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:34,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:34,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:34,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:34,994 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:34,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:35,002 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:35,002 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:37:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:37:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2023-10-12 17:37:35,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 200 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:35,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:35,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 200 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:37:35,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:35,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 200 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:37:35,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:35,100 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 1850 transitions, 23385 flow [2023-10-12 17:37:35,100 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:37:35,100 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 42 places, 1850 transitions, 23385 flow [2023-10-12 17:37:35,164 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][0], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 4:3A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][15], 10:4A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][43], 55:5A:[87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1][149], 143:6A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][421], 243:7A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][768]][244:8A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][1104]] [2023-10-12 17:37:35,177 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][0], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 4:3A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][15], 7:4A:[77] L44-1-->L33: 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][33], 35:5A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][99], 107:6A:[87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1][314], 188:7A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][606], 288:8A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][913]][291:9A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][1224]] [2023-10-12 17:37:35,195 ERROR L47 etriNetUnfolderRabin]: [1:1A:[88] $Ultimate##0-->L44: Formula: (and (= v_i1_14 v_k2_13) (<= 0 v_m_9) (= v_i1_14 v_i2_10) (= v_i1_14 0) (= v_i1_14 v_k1_13)) InVars {m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} OutVars{m=v_m_9, i1=v_i1_14, i2=v_i2_10, k1=v_k1_13, k2=v_k2_13} AuxVars[] AssignedVars[][0], 2:2A:[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 4:3A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][15], 7:4A:[77] L44-1-->L33: 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][33], 35:5A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][99], 103:6A:[84] L33-->thread2EXIT: Formula: (<= v_n_9 v_i2_6) InVars {n=v_n_9, i2=v_i2_6} OutVars{n=v_n_9, i2=v_i2_6} AuxVars[] AssignedVars[][294], 184:7A:[87] L22-1-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (<= v_m_7 v_j1_12)) InVars {m=v_m_7, i1=v_i1_11, j1=v_j1_12} OutVars{m=v_m_7, i1=v_i1_10, j1=v_j1_12} AuxVars[] AssignedVars[i1][579], 280:8A:[83] L20-->L22-1: Formula: (and (< v_i1_8 v_n_7) (= v_j1_6 0)) InVars {n=v_n_7, i1=v_i1_8} OutVars{n=v_n_7, i1=v_i1_8, j1=v_j1_6} AuxVars[] AssignedVars[j1][671], 378:9A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][983]][379:10A:[89] L22-1-->L22-1: Formula: (and (= v_j1_14 (+ v_j1_15 1)) (= (+ v_k1_16 1) v_k1_15) (< v_j1_15 v_m_11)) InVars {m=v_m_11, k1=v_k1_16, j1=v_j1_15} OutVars{m=v_m_11, k1=v_k1_15, j1=v_j1_14} AuxVars[] AssignedVars[k1, j1][1224]] [2023-10-12 17:37:35,244 INFO L124 PetriNetUnfolderBase]: 318/577 cut-off events. [2023-10-12 17:37:35,244 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-10-12 17:37:35,244 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:35,252 INFO L201 PluginConnector]: Adding new model clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:35 BoogieIcfgContainer [2023-10-12 17:37:35,252 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:35,258 INFO L158 Benchmark]: Toolchain (without parser) took 4282.37ms. Allocated memory was 196.1MB in the beginning and 271.6MB in the end (delta: 75.5MB). Free memory was 143.5MB in the beginning and 112.9MB in the end (delta: 30.6MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:35,259 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 196.1MB. Free memory was 144.7MB in the beginning and 144.5MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:35,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.64ms. Allocated memory is still 196.1MB. Free memory was 143.5MB in the beginning and 142.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:35,261 INFO L158 Benchmark]: Boogie Preprocessor took 17.56ms. Allocated memory is still 196.1MB. Free memory was 142.0MB in the beginning and 140.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:35,263 INFO L158 Benchmark]: RCFGBuilder took 201.49ms. Allocated memory is still 196.1MB. Free memory was 140.9MB in the beginning and 131.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:35,265 INFO L158 Benchmark]: BuchiAutomizer took 4032.75ms. Allocated memory was 196.1MB in the beginning and 271.6MB in the end (delta: 75.5MB). Free memory was 131.5MB in the beginning and 112.9MB in the end (delta: 18.5MB). Peak memory consumption was 95.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:35,266 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 196.1MB. Free memory was 144.7MB in the beginning and 144.5MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.64ms. Allocated memory is still 196.1MB. Free memory was 143.5MB in the beginning and 142.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.56ms. Allocated memory is still 196.1MB. Free memory was 142.0MB in the beginning and 140.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 201.49ms. Allocated memory is still 196.1MB. Free memory was 140.9MB in the beginning and 131.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4032.75ms. Allocated memory was 196.1MB in the beginning and 271.6MB in the end (delta: 75.5MB). Free memory was 131.5MB in the beginning and 112.9MB in the end (delta: 18.5MB). Peak memory consumption was 95.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 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i2 + n and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + m and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i1 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j1 + m and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 526 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 261 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s 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, 28 PlacesBefore, 17 PlacesAfterwards, 24 TransitionsBefore, 13 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 64, independent: 64, independent conditional: 0, independent unconditional: 64, 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: 64, independent: 64, independent conditional: 0, independent unconditional: 64, 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: 72, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, 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:35,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:35,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-10-12 17:37:35,680 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...