/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:41:58,902 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:41:58,942 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:41:58,956 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:41:58,956 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:41:58,957 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:41:58,957 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:41:58,958 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:41:58,958 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:41:58,958 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:41:58,958 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:41:58,958 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:41:58,959 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:41:58,959 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:41:58,959 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:41:58,959 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:41:58,959 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:41:58,960 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:41:58,960 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:41:58,960 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:41:58,960 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:41:58,965 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:41:58,965 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:41:58,965 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:41:58,965 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:41:58,965 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:41:58,966 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:41:58,966 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:41:58,966 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:41:58,966 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:41:58,967 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:41:58,967 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:41:58,967 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:41:58,968 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:41:58,968 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:41:59,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:41:59,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:41:59,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:41:59,162 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:41:59,163 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:41:59,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl [2023-10-12 17:41:59,164 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-equiv.wvr.bpl' [2023-10-12 17:41:59,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:41:59,187 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:41:59,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:59,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:41:59,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:41:59,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,207 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:41:59,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:59,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:41:59,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:41:59,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:41:59,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:41:59,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:41:59,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:41:59,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:41:59,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/1) ... [2023-10-12 17:41:59,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:59,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:59,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:41:59,281 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:41:59,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:41:59,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:41:59,281 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:41:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:41:59,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:41:59,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:41:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:41:59,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:41:59,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:41:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:41:59,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:41:59,283 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:41:59,321 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:41:59,323 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:41:59,395 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:41:59,407 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:41:59,408 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:41:59,410 INFO L201 PluginConnector]: Adding new model mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:59 BoogieIcfgContainer [2023-10-12 17:41:59,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:41:59,411 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:41:59,411 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:41:59,415 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:41:59,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:59,416 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:59" (1/2) ... [2023-10-12 17:41:59,417 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@747be712 and model type mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:41:59, skipping insertion in model container [2023-10-12 17:41:59,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:59,417 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:59" (2/2) ... [2023-10-12 17:41:59,425 INFO L332 chiAutomizerObserver]: Analyzing ICFG mult-equiv.wvr.bpl [2023-10-12 17:41:59,482 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:41:59,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 82 flow [2023-10-12 17:41:59,528 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-10-12 17:41:59,528 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:41:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:41:59,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 82 flow [2023-10-12 17:41:59,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2023-10-12 17:41:59,536 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:41:59,544 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 64 flow [2023-10-12 17:41:59,546 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 64 flow [2023-10-12 17:41:59,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 64 flow [2023-10-12 17:41:59,551 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-10-12 17:41:59,551 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:41:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:41:59,552 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:41:59,663 INFO L134 LiptonReduction]: Checked pairs total: 180 [2023-10-12 17:41:59,663 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-10-12 17:41:59,672 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:41:59,672 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:41:59,672 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:41:59,672 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:41:59,672 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:41:59,672 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:41:59,672 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:41:59,672 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:41:59,673 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:41:59,675 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][7], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][8]][3:3A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][0], 4:4A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][6]] [2023-10-12 17:41:59,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:59,677 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:41:59,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:59,677 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:59,679 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:41:59,679 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 17 transitions, 52 flow [2023-10-12 17:41:59,680 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][7], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][8]][3:3A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][0], 4:4A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][6]] [2023-10-12 17:41:59,680 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:59,680 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:41:59,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:59,680 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:59,683 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[] 39#[L52]true [75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 41#[L19-1, L52-1]true [2023-10-12 17:41:59,684 INFO L750 eck$LassoCheckResult]: Loop: 41#[L19-1, L52-1]true [62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[] 44#[L52-1, L19]true [64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N] 41#[L19-1, L52-1]true [2023-10-12 17:41:59,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:59,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2679, now seen corresponding path program 1 times [2023-10-12 17:41:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630926732] [2023-10-12 17:41:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:59,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:59,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:59,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2023-10-12 17:41:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495276736] [2023-10-12 17:41:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:59,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:59,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:59,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2576505, now seen corresponding path program 1 times [2023-10-12 17:41:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319146913] [2023-10-12 17:41:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:59,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:59,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:59,860 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:59,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:59,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:59,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:59,860 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:59,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:59,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:59,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:59,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:59,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:59,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:59,874 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:59,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:59,920 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:59,921 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:59,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:59,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:41:59,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:59,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:59,946 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:41:59,946 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {M=0, p=0} Honda state: {M=0, p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:41:59,953 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:41:59,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:59,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:59,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:59,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:59,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:41:59,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:59,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:59,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:59,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:59,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:41:59,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:59,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:42:00,014 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:42:00,019 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:42:00,019 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:00,020 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:00,020 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:00,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:00,020 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:00,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:00,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:00,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:42:00,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:00,020 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:00,021 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:42:00,028 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:42:00,050 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:00,053 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,055 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:42:00,057 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:42:00,058 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:42:00,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:00,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:00,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:00,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:00,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:00,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:00,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:00,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:00,081 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:42:00,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,082 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:42:00,083 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:42:00,086 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:42:00,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:00,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:00,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:00,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:00,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:00,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:00,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:00,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:00,106 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:42:00,106 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:42:00,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,110 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:42:00,111 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:42:00,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:00,143 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:42:00,144 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:00,144 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N) = 1*N Supporting invariants [] [2023-10-12 17:42:00,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:00,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:00,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:00,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:00,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:00,180 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:00,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:00,191 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:42:00,211 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:42:00,303 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:42:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:42:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-10-12 17:42:00,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 180 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:42:00,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:00,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:42:00,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:00,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 180 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:42:00,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:00,315 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 85 transitions, 430 flow [2023-10-12 17:42:00,315 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:00,315 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 85 transitions, 430 flow [2023-10-12 17:42:00,329 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][36], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][41], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][48]][10:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][14], 11:5A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][20]] [2023-10-12 17:42:00,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:00,330 INFO L124 PetriNetUnfolderBase]: 3/10 cut-off events. [2023-10-12 17:42:00,330 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:00,330 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:00,330 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[] 39#[L52]true [75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 41#[L19-1, L52-1]true [78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 84#[L19-1, L30-1, L53]true [2023-10-12 17:42:00,331 INFO L750 eck$LassoCheckResult]: Loop: 84#[L19-1, L30-1, L53]true [66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 87#[L19-1, L30, L53]true [68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N] 84#[L19-1, L30-1, L53]true [2023-10-12 17:42:00,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 83127, now seen corresponding path program 1 times [2023-10-12 17:42:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:00,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406942766] [2023-10-12 17:42:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:00,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2023-10-12 17:42:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223686060] [2023-10-12 17:42:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:00,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 79887161, now seen corresponding path program 1 times [2023-10-12 17:42:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934382324] [2023-10-12 17:42:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:00,406 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:00,406 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:00,406 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:00,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:00,406 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:42:00,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:00,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:00,407 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:42:00,407 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:00,407 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:00,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:42:00,417 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:42:00,437 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:00,437 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:42:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,438 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:42:00,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:42:00,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:42:00,457 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:42:00,471 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:42:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,472 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:42:00,473 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:42:00,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:42:00,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:42:00,503 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:42:00,509 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:42:00,509 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:00,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:00,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:00,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:00,509 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:00,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:00,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:00,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:42:00,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:00,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:00,510 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:42:00,517 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:42:00,537 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:00,537 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,539 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:42:00,547 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:42:00,553 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:42:00,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:00,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:00,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:00,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:00,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:00,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:00,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:00,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:00,582 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:42:00,582 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:42:00,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,587 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:42:00,589 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:42:00,592 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:00,594 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:42:00,594 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:00,594 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N) = 1*N Supporting invariants [] [2023-10-12 17:42:00,598 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:42:00,598 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:00,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:00,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:00,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:00,624 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:00,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:00,637 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:42:00,637 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:42:00,728 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:42:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-10-12 17:42:00,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 180 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:42:00,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:00,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 180 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:42:00,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:00,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 180 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:42:00,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:00,732 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 425 transitions, 3000 flow [2023-10-12 17:42:00,732 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:00,732 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 425 transitions, 3000 flow [2023-10-12 17:42:00,738 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][184], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][209], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][244], 16:4A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][270]][18:5A:[89] L41-1-->L41-1: Formula: (and (= (+ v_L_12 1) v_L_13) (= (+ v_M_20 v_q_10) v_q_9) (< 0 v_L_13)) InVars {q=v_q_10, M=v_M_20, L=v_L_13} OutVars{q=v_q_9, M=v_M_20, L=v_L_12} AuxVars[] AssignedVars[q, L][372]] [2023-10-12 17:42:00,739 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:00,739 INFO L124 PetriNetUnfolderBase]: 8/17 cut-off events. [2023-10-12 17:42:00,739 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:42:00,739 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:00,740 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[] 39#[L52]true [75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 41#[L19-1, L52-1]true [78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 84#[L19-1, L30-1, L53]true [81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 125#[L54, L19-1, L30-1, L41-1]true [2023-10-12 17:42:00,740 INFO L750 eck$LassoCheckResult]: Loop: 125#[L54, L19-1, L30-1, L41-1]true [89] L41-1-->L41-1: Formula: (and (= (+ v_L_12 1) v_L_13) (= (+ v_M_20 v_q_10) v_q_9) (< 0 v_L_13)) InVars {q=v_q_10, M=v_M_20, L=v_L_13} OutVars{q=v_q_9, M=v_M_20, L=v_L_12} AuxVars[] AssignedVars[q, L] 125#[L54, L19-1, L30-1, L41-1]true [2023-10-12 17:42:00,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2577018, now seen corresponding path program 1 times [2023-10-12 17:42:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453612774] [2023-10-12 17:42:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:00,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2023-10-12 17:42:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:00,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466554128] [2023-10-12 17:42:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:00,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash 79887647, now seen corresponding path program 1 times [2023-10-12 17:42:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633072611] [2023-10-12 17:42:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:00,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:00,808 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:00,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:00,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:00,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:00,808 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:42:00,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:00,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:00,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:42:00,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:00,808 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:00,809 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:42:00,811 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:42:00,830 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:00,830 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:42:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,831 INFO L229 MonitoredProcess]: Starting monitored process 12 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:42:00,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:42:00,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:42:00,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:42:00,862 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:42:00,862 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {q=0, M=0} Honda state: {q=0, M=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:42:00,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,869 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:42:00,870 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:42:00,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:42:00,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:42:00,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:42:00,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,894 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:42:00,895 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:42:00,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:42:00,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:42:00,913 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:42:00,916 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:42:00,916 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:00,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:00,916 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:00,916 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:00,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:00,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:00,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:00,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult-equiv.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:42:00,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:00,917 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:00,917 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:42:00,931 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:42:00,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:00,947 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:00,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,948 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:42:00,953 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:42:00,953 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:42:00,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:00,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:00,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:00,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:00,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:00,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:00,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:00,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:00,978 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:42:00,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:00,979 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:42:00,981 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:42:00,982 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:42:00,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:00,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:00,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:00,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:00,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:00,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:00,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:01,008 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:01,017 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:42:01,017 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:42:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:01,018 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:42:01,019 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:42:01,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:01,021 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:42:01,021 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:01,021 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(L) = 1*L Supporting invariants [] [2023-10-12 17:42:01,025 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:42:01,025 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:01,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:01,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:01,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:01,061 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:01,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:01,062 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:42:01,062 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:42:01,109 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:42:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-10-12 17:42:01,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:42:01,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:01,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:42:01,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:01,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:42:01,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:01,111 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 1700 transitions, 15400 flow [2023-10-12 17:42:01,111 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:42:01,111 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 38 places, 1700 transitions, 15400 flow [2023-10-12 17:42:01,131 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 26:5A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][7]][79:6A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][407], 80:7A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283]] [2023-10-12 17:42:01,134 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 3:3A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][79], 7:4A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][919], 35:5A:[87] L30-1-->thread2EXIT: Formula: (<= v_N_38 1) InVars {N=v_N_38} OutVars{N=v_N_38} AuxVars[] AssignedVars[][1103]][95:6A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][611], 97:7A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][71]] [2023-10-12 17:42:01,143 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 42:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 77:6A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][4]][150:7A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][406], 152:8A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][282]] [2023-10-12 17:42:01,146 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283]][26:5A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][7], 79:6A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][407], 158:7A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][683], 161:8A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][291]] [2023-10-12 17:42:01,156 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 3:3A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][79], 7:4A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][919], 33:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1003], 101:6A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1208]][185:7A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][610], 186:8A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][70]] [2023-10-12 17:42:01,159 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 42:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 117:6A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1204]][199:7A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][406], 202:8A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][282]] [2023-10-12 17:42:01,165 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 42:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 77:6A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][4], 156:7A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1206]][243:8A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][406], 245:9A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][282]] [2023-10-12 17:42:01,168 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 26:5A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][7]][81:6A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][607], 157:7A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][63], 262:8A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][411], 263:9A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][291]] [2023-10-12 17:42:01,169 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 26:5A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][7], 81:6A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][607], 157:7A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][63]][267:8A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][611], 270:9A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][71]] [2023-10-12 17:42:01,171 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 3:3A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][79], 7:4A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][919], 33:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1003], 99:6A:[87] L30-1-->thread2EXIT: Formula: (<= v_N_38 1) InVars {N=v_N_38} OutVars{N=v_N_38} AuxVars[] AssignedVars[][1108], 190:7A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1210]][286:8A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][610], 287:9A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][70]] [2023-10-12 17:42:01,172 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 6:3A:[85] L19-1-->thread1EXIT: Formula: (<= v_N_24 0) InVars {N=v_N_24} OutVars{N=v_N_24} AuxVars[] AssignedVars[][1379], 22:4A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][999], 46:5A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 127:6A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 191:7A:[82] thread1EXIT-->L55: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][304]][290:8A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][406], 293:9A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][282]] [2023-10-12 17:42:01,175 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 6:3A:[85] L19-1-->thread1EXIT: Formula: (<= v_N_24 0) InVars {N=v_N_24} OutVars{N=v_N_24} AuxVars[] AssignedVars[][1379], 22:4A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][999], 46:5A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 127:6A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 218:7A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1204]][308:8A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][406], 309:9A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][282]] [2023-10-12 17:42:01,179 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 42:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 77:6A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][4]][153:7A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][606], 231:8A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][62], 329:9A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][410], 333:10A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][290]] [2023-10-12 17:42:01,180 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 42:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 77:6A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][4], 153:7A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][606], 231:8A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][62]][335:9A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][610], 336:10A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][70]] [2023-10-12 17:42:01,184 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 6:3A:[85] L19-1-->thread1EXIT: Formula: (<= v_N_24 0) InVars {N=v_N_24} OutVars{N=v_N_24} AuxVars[] AssignedVars[][1379], 22:4A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][999], 46:5A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 127:6A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 191:7A:[82] thread1EXIT-->L55: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][304], 295:8A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1206]][354:9A:[68] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_N_17))) (and (= v_N_16 (ite .cse0 (+ (- 2) v_N_17) v_N_17)) (= v_p_11 (ite .cse0 (+ v_p_12 (* 2 v_M_6)) v_p_12)))) InVars {p=v_p_12, N=v_N_17, M=v_M_6} OutVars{p=v_p_11, N=v_N_16, M=v_M_6} AuxVars[] AssignedVars[p, N][406], 355:10A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][282]] [2023-10-12 17:42:01,186 ERROR L47 etriNetUnfolderRabin]: [1:1A:[53] $Ultimate##0-->L52: Formula: (and (= v_p_5 0) (= v_N_11 v_L_1) (= v_q_1 v_p_5)) InVars {q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} OutVars{q=v_q_1, p=v_p_5, N=v_N_11, L=v_L_1} AuxVars[] AssignedVars[][739], 2:2A:[75] L52-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][839], 5:3A:[78] L52-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][979], 13:4A:[66] L30-1-->L30: Formula: (< 1 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[][283], 42:5A:[81] L53-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][1007], 77:6A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][4], 156:7A:[88] L41-1-->thread3EXIT: Formula: (<= v_L_10 0) InVars {L=v_L_10} OutVars{L=v_L_10} AuxVars[] AssignedVars[][1206], 251:8A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][606], 341:9A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][62]][368:10A:[64] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_N_13))) (and (= (ite .cse0 (+ v_M_4 v_p_8) v_p_8) v_p_7) (= (ite .cse0 (+ (- 1) v_N_13) v_N_13) v_N_12))) InVars {p=v_p_8, N=v_N_13, M=v_M_4} OutVars{p=v_p_7, N=v_N_12, M=v_M_4} AuxVars[] AssignedVars[p, N][610], 369:11A:[62] L19-1-->L19: Formula: (< 0 v_N_1) InVars {N=v_N_1} OutVars{N=v_N_1} AuxVars[] AssignedVars[][70]] [2023-10-12 17:42:01,190 INFO L124 PetriNetUnfolderBase]: 268/394 cut-off events. [2023-10-12 17:42:01,191 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-10-12 17:42:01,191 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:42:01,196 INFO L201 PluginConnector]: Adding new model mult-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:01 BoogieIcfgContainer [2023-10-12 17:42:01,196 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:01,196 INFO L158 Benchmark]: Toolchain (without parser) took 2009.60ms. Allocated memory was 197.1MB in the beginning and 249.6MB in the end (delta: 52.4MB). Free memory was 154.2MB in the beginning and 109.4MB in the end (delta: 44.9MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB. [2023-10-12 17:42:01,197 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 197.1MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:01,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.22ms. Allocated memory is still 197.1MB. Free memory was 154.1MB in the beginning and 152.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:01,197 INFO L158 Benchmark]: Boogie Preprocessor took 15.13ms. Allocated memory is still 197.1MB. Free memory was 152.5MB in the beginning and 151.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:01,198 INFO L158 Benchmark]: RCFGBuilder took 185.61ms. Allocated memory is still 197.1MB. Free memory was 151.5MB in the beginning and 141.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:42:01,198 INFO L158 Benchmark]: BuchiAutomizer took 1784.89ms. Allocated memory was 197.1MB in the beginning and 249.6MB in the end (delta: 52.4MB). Free memory was 141.4MB in the beginning and 109.4MB in the end (delta: 32.0MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. [2023-10-12 17:42:01,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21ms. Allocated memory is still 197.1MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.22ms. Allocated memory is still 197.1MB. Free memory was 154.1MB in the beginning and 152.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.13ms. Allocated memory is still 197.1MB. Free memory was 152.5MB in the beginning and 151.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 185.61ms. Allocated memory is still 197.1MB. Free memory was 151.5MB in the beginning and 141.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 1784.89ms. Allocated memory was 197.1MB in the beginning and 249.6MB in the end (delta: 52.4MB). Free memory was 141.4MB in the beginning and 109.4MB in the end (delta: 32.0MB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N and consists of 5 locations. One deterministic module has affine ranking function N and consists of 5 locations. One deterministic module has affine ranking function L and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 129 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf95 smp100 dnf100 smp100 tf113 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 24 PlacesAfterwards, 23 TransitionsBefore, 17 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 180 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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:42:01,217 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:42:01,411 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:42:01,613 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:42:01,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...