/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:04:08,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:04:08,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:04:08,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:04:08,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:04:08,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:04:08,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:04:08,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:04:08,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:04:08,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:04:08,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:04:08,583 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:04:08,583 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:04:08,584 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:04:08,584 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:04:08,584 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:04:08,584 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:04:08,584 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:04:08,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:04:08,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:04:08,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:04:08,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:04:08,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:04:08,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:04:08,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:04:08,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:04:08,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:04:08,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:04:08,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:04:08,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:04:08,588 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:04:08,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:04:08,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:04:08,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:04:08,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:04:08,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:04:08,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:04:08,590 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:04:08,590 INFO L153 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 -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:04:08,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:04:08,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:04:08,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:04:08,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:04:08,946 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:04:08,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2024-02-10 00:04:10,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:04:10,336 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:04:10,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2024-02-10 00:04:10,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca908f8b5/6e5537a936194cceab4b30dc01c45155/FLAGf6a0d804f [2024-02-10 00:04:10,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca908f8b5/6e5537a936194cceab4b30dc01c45155 [2024-02-10 00:04:10,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:04:10,366 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:04:10,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:04:10,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:04:10,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:04:10,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e76bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10, skipping insertion in model container [2024-02-10 00:04:10,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,396 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:04:10,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:04:10,522 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:04:10,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:04:10,590 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:04:10,591 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:04:10,598 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:04:10,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10 WrapperNode [2024-02-10 00:04:10,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:04:10,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:04:10,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:04:10,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:04:10,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,629 INFO L138 Inliner]: procedures = 20, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2024-02-10 00:04:10,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:04:10,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:04:10,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:04:10,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:04:10,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:04:10,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:04:10,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:04:10,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:04:10,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (1/1) ... [2024-02-10 00:04:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:10,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:10,689 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) [2024-02-10 00:04:10,698 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 [2024-02-10 00:04:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:04:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:04:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:04:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:04:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:04:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:04:10,736 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:04:10,823 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:04:10,825 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:04:10,997 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:04:11,039 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:04:11,040 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 00:04:11,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:04:11 BoogieIcfgContainer [2024-02-10 00:04:11,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:04:11,043 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:04:11,043 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:04:11,046 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:04:11,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:04:11,047 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:04:10" (1/3) ... [2024-02-10 00:04:11,048 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d327afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:04:11, skipping insertion in model container [2024-02-10 00:04:11,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:04:11,048 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:04:10" (2/3) ... [2024-02-10 00:04:11,048 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d327afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:04:11, skipping insertion in model container [2024-02-10 00:04:11,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:04:11,049 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:04:11" (3/3) ... [2024-02-10 00:04:11,050 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c [2024-02-10 00:04:11,110 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:04:11,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 206 flow [2024-02-10 00:04:11,179 INFO L124 PetriNetUnfolderBase]: 7/92 cut-off events. [2024-02-10 00:04:11,179 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:04:11,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 92 events. 7/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2024-02-10 00:04:11,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 206 flow [2024-02-10 00:04:11,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 92 transitions, 196 flow [2024-02-10 00:04:11,195 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:04:11,195 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:04:11,195 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:04:11,195 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:04:11,195 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:04:11,196 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:04:11,196 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:04:11,196 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:04:11,196 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:11,197 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 92 places, 92 transitions, 196 flow [2024-02-10 00:04:11,224 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 210 states, 209 states have (on average 2.3062200956937797) internal successors, (482), 209 states have internal predecessors, (482), 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) [2024-02-10 00:04:11,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 states, 209 states have (on average 2.3062200956937797) internal successors, (482), 209 states have internal predecessors, (482), 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) [2024-02-10 00:04:11,256 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 82 [2024-02-10 00:04:11,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:04:11,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:04:11,262 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:04:11,262 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:11,262 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 92 places, 92 transitions, 196 flow [2024-02-10 00:04:11,275 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 210 states, 209 states have (on average 2.3062200956937797) internal successors, (482), 209 states have internal predecessors, (482), 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) [2024-02-10 00:04:11,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 210 states, 209 states have (on average 2.3062200956937797) internal successors, (482), 209 states have internal predecessors, (482), 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) [2024-02-10 00:04:11,286 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 82 [2024-02-10 00:04:11,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:04:11,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:04:11,294 INFO L748 eck$LassoCheckResult]: Stem: Black: 519#[$Ultimate##0]don't care [193] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 522#[L-1]don't care [199] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 524#[L21]don't care [192] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 526#[L21-1]don't care [216] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 528#[L21-2]don't care [210] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 530#[L21-3]don't care [175] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 532#[L21-4]don't care [244] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] 534#[L37]don't care [226] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] 536#[L37-1]don't care [227] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] 538#[L37-2]don't care [176] L37-2-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 540#[L-1-1]don't care [228] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 542#[L-1-2]don't care [232] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base] 544#[L66]don't care [197] L66-->L66-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 546#[L66-1]don't care [233] L66-1-->L66-2: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_5|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 548#[L66-2]don't care [203] L66-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 550#[L69]don't care [169] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] 552#[L69-1]don't care [234] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 554#[L70]don't care [247] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 556#[L70-1]don't care [187] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0] 558#[L70-2]don't care [186] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 560#[L71]don't care [165] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 562#[L71-1]don't care [180] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0] 564#[L71-2]don't care [230] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 566#[L72]don't care [246] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 568#[L72-1]don't care [159] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 570#[L72-2]don't care [166] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 572#[L75]don't care [239] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 574#[L75-1]don't care [191] L75-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 576#[L33]don't care [181] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 578#[L34]don't care [189] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 582#[L33-1]don't care [223] L33-1-->L75-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 584#[L75-2]don't care [215] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 586#[L76]don't care [248] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 588#[L76-1]don't care [213] L76-1-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 590#[L33-2]don't care [182] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 592#[L34-3]don't care [173] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] 594#[L33-3]don't care [245] L33-3-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 598#[L76-2]don't care [224] L76-2-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 600#[L78]don't care [178] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 602#[L78-1]don't care [183] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 604#[L78-2]don't care [206] L78-2-->L78-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre11#1_4|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_6|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 606#[L78-3]don't care [265] L78-3-->L46: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_4|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 608#[L46, L78-4]don't care [2024-02-10 00:04:11,295 INFO L750 eck$LassoCheckResult]: Loop: 608#[L46, L78-4]don't care [251] L46-->L41: Formula: (< v_~i1~0_2 (* 2 v_~N~0_2)) InVars {~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} OutVars{~i1~0=v_~i1~0_2, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 610#[L41, L78-4]don't care [254] L41-->L46: Formula: (and (= v_~pos~0_54 v_~pos~0_53) (= v_~i1~0_34 (+ v_~i1~0_36 2))) InVars {~i1~0=v_~i1~0_36, ~pos~0=v_~pos~0_54} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_1|, ~i1~0=v_~i1~0_34, ~pos~0=v_~pos~0_53} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_#t~post4, ~i1~0, ~pos~0] 608#[L46, L78-4]don't care [2024-02-10 00:04:11,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -696388194, now seen corresponding path program 1 times [2024-02-10 00:04:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660717272] [2024-02-10 00:04:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:11,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:11,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:11,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 8996, now seen corresponding path program 1 times [2024-02-10 00:04:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246758081] [2024-02-10 00:04:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:11,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:11,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:11,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 785851777, now seen corresponding path program 1 times [2024-02-10 00:04:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549287078] [2024-02-10 00:04:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:11,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:11,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:11,632 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:04:11,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:04:11,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:04:11,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:04:11,634 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:04:11,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:11,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:04:11,634 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:04:11,634 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:04:11,634 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:04:11,634 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:04:11,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,768 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:04:11,769 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:04:11,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:11,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:11,773 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) [2024-02-10 00:04:11,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:04:11,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:11,791 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 [2024-02-10 00:04:11,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:04:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:11,806 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) [2024-02-10 00:04:11,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:04:11,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:11,832 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 [2024-02-10 00:04:11,897 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:04:11,903 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 [2024-02-10 00:04:11,904 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:04:11,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:04:11,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:04:11,904 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:04:11,904 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:04:11,904 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:11,904 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:04:11,904 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:04:11,904 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:04:11,904 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:04:11,904 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:04:11,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:11,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,003 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:04:12,009 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:04:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:12,015 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) [2024-02-10 00:04:12,032 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 [2024-02-10 00:04:12,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:04:12,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:04:12,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:04:12,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:04:12,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:04:12,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:04:12,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:04:12,048 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 [2024-02-10 00:04:12,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:04:12,088 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:04:12,088 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:04:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:12,093 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) [2024-02-10 00:04:12,094 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 [2024-02-10 00:04:12,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:04:12,095 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:04:12,096 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:04:12,097 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~N~0) = -1*~i1~0 + 2*~N~0 Supporting invariants [] [2024-02-10 00:04:12,101 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 [2024-02-10 00:04:12,104 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:04:12,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:04:12,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:04:12,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:04:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:04:12,239 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:04:12,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:04:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:04:12,285 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 [2024-02-10 00:04:12,287 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2024-02-10 00:04:12,430 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 1180 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:04:12,431 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:04:12,431 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:04:12,432 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:04:12,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 00:04:12,529 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:04:12,529 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:04:12,531 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 [2024-02-10 00:04:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2024-02-10 00:04:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2024-02-10 00:04:12,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 42 letters. Loop has 2 letters. [2024-02-10 00:04:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:04:12,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 44 letters. Loop has 2 letters. [2024-02-10 00:04:12,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:04:12,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 42 letters. Loop has 4 letters. [2024-02-10 00:04:12,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:04:12,541 INFO L428 stractBuchiCegarLoop]: Abstraction has has 101 places, 1128 transitions, 4662 flow [2024-02-10 00:04:12,541 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:04:12,542 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:12,542 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 101 places, 1128 transitions, 4662 flow [2024-02-10 00:04:12,605 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 600 states, 593 states have (on average 3.2225969645868466) internal successors, (1911), 599 states have internal predecessors, (1911), 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) [2024-02-10 00:04:12,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 600 states, 593 states have (on average 3.2225969645868466) internal successors, (1911), 599 states have internal predecessors, (1911), 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) [2024-02-10 00:04:12,634 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 46 [2024-02-10 00:04:12,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:04:12,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:04:12,638 INFO L748 eck$LassoCheckResult]: Stem: Black: 1097#[$Ultimate##0]don't care [193] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] Black: 1100#[L-1]don't care [199] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] Black: 1105#[L21]don't care [192] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] Black: 1110#[L21-1]don't care [216] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] Black: 1115#[L21-2]don't care [210] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] Black: 1120#[L21-3]don't care [175] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] Black: 1125#[L21-4]don't care [244] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] Black: 1130#[L37]don't care [226] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] Black: 1135#[L37-1]don't care [227] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] Black: 1140#[L37-2]don't care [176] L37-2-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] Black: 1145#[L-1-1]don't care [228] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] Black: 1150#[L-1-2]don't care [232] L-1-2-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base] Black: 1155#[L66]don't care [197] L66-->L66-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] Black: 1160#[L66-1]don't care [233] L66-1-->L66-2: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_5|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] Black: 1165#[L66-2]don't care [203] L66-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] Black: 1170#[L69]don't care [169] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] Black: 1175#[L69-1]don't care [234] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] Black: 1180#[L70]don't care [247] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] Black: 1185#[L70-1]don't care [187] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0] Black: 1190#[L70-2]don't care [186] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] Black: 1195#[L71]don't care [165] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] Black: 1200#[L71-1]don't care [180] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0] Black: 1205#[L71-2]don't care [230] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] Black: 1210#[L72]don't care [246] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] Black: 1215#[L72-1]don't care [159] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_4| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] Black: 1220#[L72-2]don't care [166] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] Black: 1225#[L75]don't care [239] L75-->L75-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 1230#[L75-1]don't care [191] L75-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 1235#[L33]don't care [181] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 1240#[L34]don't care [189] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] Black: 1250#[L33-1]don't care [223] L33-1-->L75-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 1258#[L75-2]don't care [215] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 1266#[L76]don't care [248] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 1274#[L76-1]don't care [213] L76-1-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 1282#[L33-2]don't care [182] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 1290#[L34-3]don't care [173] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] Black: 1303#[L33-3]don't care [245] L33-3-->L76-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 1314#[L76-2]don't care [224] L76-2-->L78: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 1322#[L78]don't care [178] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] Black: 1330#[L78-1]don't care [183] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] Black: 1338#[L78-2]don't care [206] L78-2-->L78-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre11#1_4|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_6|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] Black: 1346#[L78-3]don't care [265] L78-3-->L46: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_4|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] Black: 1354#[L46, L78-4]don't care [200] L78-4-->L78-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] Black: 1360#[L46, L78-5]don't care [190] L78-5-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] Black: 1397#[L79, L46]don't care [222] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] Black: 1440#[L46, L79-1]don't care [211] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] Black: 1491#[L46, L79-2]don't care [198] L79-2-->L79-3: Formula: (and (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) |v_ULTIMATE.start_main_~#t2~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre13#1_4|)) |v_#memory_int_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_6|))) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} AuxVars[] AssignedVars[#memory_int] 1537#[L46, L79-3]don't care [268] L79-3-->L59: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_7|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_4|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_#t~post6, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1580#[L59, L46, L79-4]don't care [2024-02-10 00:04:12,638 INFO L750 eck$LassoCheckResult]: Loop: 1580#[L59, L46, L79-4]don't care [257] L59-->L54: Formula: (< v_~i2~0_1 (* 2 v_~N~0_3)) InVars {~i2~0=v_~i2~0_1, ~N~0=v_~N~0_3} OutVars{~i2~0=v_~i2~0_1, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[] 1623#[L46, L79-4, L54]don't care [260] L54-->L59: Formula: (and (= v_~pos~0_45 v_~pos~0_43) (= v_~i2~0_34 (+ v_~i2~0_35 2))) InVars {~i2~0=v_~i2~0_35, ~pos~0=v_~pos~0_45} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_1|, ~i2~0=v_~i2~0_34, ~pos~0=v_~pos~0_43, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#t~post6, ~i2~0, ~pos~0] 1580#[L59, L46, L79-4]don't care [2024-02-10 00:04:12,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1582198641, now seen corresponding path program 1 times [2024-02-10 00:04:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080185433] [2024-02-10 00:04:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:12,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:12,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:12,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 9188, now seen corresponding path program 1 times [2024-02-10 00:04:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383388441] [2024-02-10 00:04:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:12,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:12,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:12,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:12,717 INFO L85 PathProgramCache]: Analyzing trace with hash -74462990, now seen corresponding path program 1 times [2024-02-10 00:04:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:04:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62619511] [2024-02-10 00:04:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:04:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:04:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:12,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:04:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:04:12,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:04:12,812 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:04:12,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:04:12,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:04:12,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:04:12,813 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:04:12,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:12,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:04:12,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:04:12,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration2_Loop [2024-02-10 00:04:12,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:04:12,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:04:12,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:12,934 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:04:12,934 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:04:12,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:12,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:12,938 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) [2024-02-10 00:04:12,943 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 [2024-02-10 00:04:12,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:04:12,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:12,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:04:12,961 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post5=0} Honda state: {thread2Thread1of1ForFork1_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:04:12,972 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 [2024-02-10 00:04:12,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:12,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:12,989 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) [2024-02-10 00:04:12,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:04:12,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:13,011 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 [2024-02-10 00:04:13,020 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:04:13,021 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_3=1} Honda state: {v_rep#funAddr~thread2.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:04:13,047 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 [2024-02-10 00:04:13,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:04:13,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:04:13,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:13,070 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 [2024-02-10 00:04:13,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:04:13,089 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_3=-1} Honda state: {v_rep#funAddr~thread1.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:04:13,096 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 [2024-02-10 00:04:13,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,099 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:04:13,109 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 [2024-02-10 00:04:13,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:04:13,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:13,127 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:04:13,128 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_3=-1} Honda state: {v_rep#funAddr~thread2.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:04:13,132 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 [2024-02-10 00:04:13,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,133 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) [2024-02-10 00:04:13,136 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 [2024-02-10 00:04:13,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:04:13,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:13,164 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 [2024-02-10 00:04:13,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,166 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) [2024-02-10 00:04:13,180 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 [2024-02-10 00:04:13,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:04:13,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:04:13,309 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:04:13,317 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 [2024-02-10 00:04:13,317 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:04:13,317 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:04:13,318 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:04:13,318 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:04:13,318 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:04:13,318 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,318 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:04:13,318 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:04:13,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration2_Loop [2024-02-10 00:04:13,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:04:13,318 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:04:13,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:04:13,417 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:04:13,418 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:04:13,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,432 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) [2024-02-10 00:04:13,437 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 [2024-02-10 00:04:13,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:04:13,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:04:13,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:04:13,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:04:13,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:04:13,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:04:13,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:04:13,448 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 [2024-02-10 00:04:13,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:04:13,472 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 [2024-02-10 00:04:13,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,475 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) [2024-02-10 00:04:13,481 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 [2024-02-10 00:04:13,488 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 [2024-02-10 00:04:13,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:04:13,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:04:13,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:04:13,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:04:13,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:04:13,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:04:13,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:04:13,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:04:13,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,521 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) [2024-02-10 00:04:13,528 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 [2024-02-10 00:04:13,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:04:13,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:04:13,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:04:13,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:04:13,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:04:13,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:04:13,546 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 [2024-02-10 00:04:13,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:04:13,567 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 [2024-02-10 00:04:13,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,569 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) [2024-02-10 00:04:13,575 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 [2024-02-10 00:04:13,584 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 [2024-02-10 00:04:13,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:04:13,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:04:13,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:04:13,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:04:13,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:04:13,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:04:13,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:04:13,611 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 [2024-02-10 00:04:13,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,613 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) [2024-02-10 00:04:13,619 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 [2024-02-10 00:04:13,619 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 [2024-02-10 00:04:13,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:04:13,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:04:13,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:04:13,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:04:13,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:04:13,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:04:13,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:04:13,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:04:13,667 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:04:13,667 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:04:13,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:04:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:04:13,669 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) [2024-02-10 00:04:13,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:04:13,676 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:04:13,676 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:04:13,676 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i2~0, ~N~0) = -1*~i2~0 + 2*~N~0 Supporting invariants [] [2024-02-10 00:04:13,680 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 [2024-02-10 00:04:13,683 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 [2024-02-10 00:04:13,684 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:04:13,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:04:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:04:13,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:04:13,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:04:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:04:13,794 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:04:13,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:04:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:04:13,810 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 [2024-02-10 00:04:13,810 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-02-10 00:04:13,908 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 1180 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:04:13,908 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:04:13,908 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:04:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 1180 transitions. [2024-02-10 00:04:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1180 transitions. [2024-02-10 00:04:13,914 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:04:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 1180 transitions. [2024-02-10 00:04:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1180 transitions. [2024-02-10 00:04:13,972 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 [2024-02-10 00:04:14,540 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:04:14,541 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:04:14,541 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 [2024-02-10 00:04:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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) [2024-02-10 00:04:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2024-02-10 00:04:14,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 48 letters. Loop has 2 letters. [2024-02-10 00:04:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:04:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 50 letters. Loop has 2 letters. [2024-02-10 00:04:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:04:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 48 letters. Loop has 4 letters. [2024-02-10 00:04:14,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:04:14,543 INFO L428 stractBuchiCegarLoop]: Abstraction has has 114 places, 18405 transitions, 112863 flow [2024-02-10 00:04:14,543 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:04:14,543 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:04:14,543 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 114 places, 18405 transitions, 112863 flow [2024-02-10 00:04:15,877 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1257 states, 1224 states have (on average 4.330882352941177) internal successors, (5301), 1256 states have internal predecessors, (5301), 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) [2024-02-10 00:04:15,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1257 states, 1224 states have (on average 4.330882352941177) internal successors, (5301), 1256 states have internal predecessors, (5301), 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) [2024-02-10 00:04:15,892 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:04:15,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:04:15,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:04:15 BoogieIcfgContainer [2024-02-10 00:04:15,898 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:04:15,899 INFO L158 Benchmark]: Toolchain (without parser) took 5532.83ms. Allocated memory was 246.4MB in the beginning and 448.8MB in the end (delta: 202.4MB). Free memory was 181.1MB in the beginning and 216.5MB in the end (delta: -35.5MB). Peak memory consumption was 244.5MB. Max. memory is 8.0GB. [2024-02-10 00:04:15,899 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:04:15,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.86ms. Allocated memory is still 246.4MB. Free memory was 180.9MB in the beginning and 218.0MB in the end (delta: -37.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-02-10 00:04:15,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.40ms. Allocated memory is still 246.4MB. Free memory was 218.0MB in the beginning and 216.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:04:15,900 INFO L158 Benchmark]: Boogie Preprocessor took 22.91ms. Allocated memory is still 246.4MB. Free memory was 216.4MB in the beginning and 215.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:04:15,900 INFO L158 Benchmark]: RCFGBuilder took 385.79ms. Allocated memory is still 246.4MB. Free memory was 214.9MB in the beginning and 198.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-02-10 00:04:15,901 INFO L158 Benchmark]: BuchiAutomizer took 4855.52ms. Allocated memory was 246.4MB in the beginning and 448.8MB in the end (delta: 202.4MB). Free memory was 198.1MB in the beginning and 216.5MB in the end (delta: -18.4MB). Peak memory consumption was 261.0MB. Max. memory is 8.0GB. [2024-02-10 00:04:15,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.86ms. Allocated memory is still 246.4MB. Free memory was 180.9MB in the beginning and 218.0MB in the end (delta: -37.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.40ms. Allocated memory is still 246.4MB. Free memory was 218.0MB in the beginning and 216.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.91ms. Allocated memory is still 246.4MB. Free memory was 216.4MB in the beginning and 215.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 385.79ms. Allocated memory is still 246.4MB. Free memory was 214.9MB in the beginning and 198.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 4855.52ms. Allocated memory was 246.4MB in the beginning and 448.8MB in the end (delta: 202.4MB). Free memory was 198.1MB in the beginning and 216.5MB in the end (delta: -18.4MB). Peak memory consumption was 261.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function ((2 * N) + (-1 * i1)) and consists of 5 locations. One deterministic module has affine ranking function ((2 * N) + (-1 * i2)) and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 513 mSDsluCounter, 924 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 480 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax288 hnf100 lsp28 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq142 hnf94 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:04:15,917 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...