/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 false -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:38:11,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:38:11,079 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:38:11,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:38:11,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:38:11,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:38:11,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:38:11,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:38:11,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:38:11,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:38:11,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:38:11,127 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:38:11,127 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:38:11,127 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:38:11,128 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:38:11,128 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:38:11,128 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:38:11,128 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:38:11,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:38:11,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:38:11,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:38:11,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:38:11,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:38:11,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:38:11,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:38:11,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:38:11,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:38:11,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:38:11,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:38:11,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:38:11,136 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:38:11,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:38:11,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:38:11,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:38:11,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:38:11,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:38:11,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:38:11,138 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:38:11,138 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 -> false [2024-02-10 00:38:11,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:38:11,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:38:11,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:38:11,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:38:11,433 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:38:11,434 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:38:12,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:38:12,801 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:38:12,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2024-02-10 00:38:12,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2930ff75/7bfc58b97a074c8eb2216318e1337c03/FLAGe1870c811 [2024-02-10 00:38:12,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2930ff75/7bfc58b97a074c8eb2216318e1337c03 [2024-02-10 00:38:12,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:38:12,823 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:38:12,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:38:12,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:38:12,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:38:12,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:38:12" (1/1) ... [2024-02-10 00:38:12,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137b6fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:12, skipping insertion in model container [2024-02-10 00:38:12,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:38:12" (1/1) ... [2024-02-10 00:38:12,855 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:38:12,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:38:12,991 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:38:13,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:38:13,012 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:38:13,013 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:38:13,019 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:38:13,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13 WrapperNode [2024-02-10 00:38:13,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:38:13,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:38:13,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:38:13,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:38:13,026 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:38:13" (1/1) ... [2024-02-10 00:38:13,036 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:38:13" (1/1) ... [2024-02-10 00:38:13,054 INFO L138 Inliner]: procedures = 20, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2024-02-10 00:38:13,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:38:13,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:38:13,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:38:13,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:38:13,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:38:13,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:38:13,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:38:13,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:38:13,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (1/1) ... [2024-02-10 00:38:13,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:13,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:13,108 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:38:13,127 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:38:13,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:38:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:38:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:38:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:38:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:38:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:38:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:38:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:38:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:38:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:38:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:38:13,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:38:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:38:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:38:13,152 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:38:13,224 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:38:13,226 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:38:13,371 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:38:13,410 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:38:13,410 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 00:38:13,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:38:13 BoogieIcfgContainer [2024-02-10 00:38:13,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:38:13,413 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:38:13,413 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:38:13,416 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:38:13,417 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:38:13,417 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:38:12" (1/3) ... [2024-02-10 00:38:13,418 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7063e43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:38:13, skipping insertion in model container [2024-02-10 00:38:13,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:38:13,418 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:38:13" (2/3) ... [2024-02-10 00:38:13,418 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7063e43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:38:13, skipping insertion in model container [2024-02-10 00:38:13,418 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:38:13,418 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:38:13" (3/3) ... [2024-02-10 00:38:13,419 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c [2024-02-10 00:38:13,508 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:38:13,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 206 flow [2024-02-10 00:38:13,574 INFO L124 PetriNetUnfolderBase]: 7/92 cut-off events. [2024-02-10 00:38:13,574 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:38:13,578 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:38:13,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 206 flow [2024-02-10 00:38:13,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 92 transitions, 196 flow [2024-02-10 00:38:13,588 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:38:13,588 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:38:13,588 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:38:13,588 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:38:13,589 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:38:13,589 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:38:13,589 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:38:13,589 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:38:13,589 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 places, 92 transitions, 196 flow [2024-02-10 00:38:13,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:38:13,608 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-02-10 00:38:13,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:38:13,609 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:38:13,612 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:38:13,613 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 places, 92 transitions, 196 flow [2024-02-10 00:38:13,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:38:13,643 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-02-10 00:38:13,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:38:13,643 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:38:13,664 INFO L748 eck$LassoCheckResult]: Stem: 98#[$Ultimate##0]true [193] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 100#[L-1]true [199] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 102#[L21]true [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[] 104#[L21-1]true [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[] 106#[L21-2]true [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[] 108#[L21-3]true [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[] 110#[L21-4]true [244] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] 112#[L37]true [226] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] 114#[L37-1]true [227] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] 116#[L37-2]true [176] L37-2-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 118#[L-1-1]true [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] 120#[L-1-2]true [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] 122#[L66]true [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] 124#[L66-1]true [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] 126#[L66-2]true [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] 128#[L69]true [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] 130#[L69-1]true [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] 132#[L70]true [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] 134#[L70-1]true [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] 136#[L70-2]true [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] 138#[L71]true [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] 140#[L71-1]true [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] 142#[L71-2]true [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] 144#[L72]true [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] 146#[L72-1]true [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] 148#[L72-2]true [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] 150#[L75]true [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] 152#[L75-1]true [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] 154#[L33]true [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] 156#[L34]true [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[] 158#[L33-1]true [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] 160#[L75-2]true [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] 162#[L76]true [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] 164#[L76-1]true [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] 166#[L33-2]true [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] 168#[L34-3]true [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[] 170#[L33-3]true [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] 172#[L76-2]true [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] 174#[L78]true [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] 176#[L78-1]true [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] 178#[L78-2]true [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] 180#[L78-3]true [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] 182#[L46, L78-4]true [2024-02-10 00:38:13,665 INFO L750 eck$LassoCheckResult]: Loop: 182#[L46, L78-4]true [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[] 185#[L41, L78-4]true [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] 182#[L46, L78-4]true [2024-02-10 00:38:13,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -696388194, now seen corresponding path program 1 times [2024-02-10 00:38:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:38:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4031551] [2024-02-10 00:38:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:38:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:38:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:13,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:38:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:13,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:38:13,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 8996, now seen corresponding path program 1 times [2024-02-10 00:38:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:38:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794909309] [2024-02-10 00:38:13,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:38:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:38:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:13,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:38:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:13,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:38:14,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 785851777, now seen corresponding path program 1 times [2024-02-10 00:38:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:38:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378964599] [2024-02-10 00:38:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:38:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:38:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:14,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:38:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:14,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:38:14,119 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:38:14,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:38:14,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:38:14,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:38:14,120 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:38:14,121 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:14,121 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:38:14,121 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:38:14,122 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:38:14,122 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:38:14,122 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:38:14,137 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:38:14,155 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:38:14,158 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:38:14,162 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:38:14,166 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:38:14,170 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:38:14,173 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:38:14,177 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:38:14,179 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:38:14,181 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:38:14,284 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:38:14,285 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:38:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:14,289 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:38:14,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:38:14,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:14,304 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:38:14,343 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:38:14,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:14,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:14,357 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:38:14,401 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:38:14,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:38:14,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:14,483 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:38:14,490 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:38:14,490 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:38:14,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:38:14,491 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:38:14,491 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:38:14,491 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:38:14,491 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:14,491 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:38:14,491 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:38:14,491 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:38:14,491 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:38:14,491 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:38:14,493 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:38:14,500 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:38:14,503 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:38:14,506 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:38:14,508 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:38:14,514 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:38:14,516 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:38:14,518 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:38:14,521 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:38:14,523 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:38:14,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:38:14,602 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:38:14,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:14,605 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:38:14,624 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:38:14,626 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:38:14,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:38:14,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:38:14,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:38:14,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:38:14,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:38:14,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:38:14,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:38:14,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:38:14,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:38:14,676 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:38:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:14,717 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:38:14,719 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:38:14,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:38:14,720 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:38:14,721 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:38:14,721 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:38:14,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 00:38:14,728 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:38:14,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:38:14,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:38:14,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:38:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:38:14,953 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:38:14,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:38:14,966 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:38:14,969 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:38:15,000 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:38:15,003 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:38:15,133 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:38:15,134 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:38:15,134 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:38:15,135 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:38:15,194 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:38:15,194 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:38:15,197 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:38:15,202 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:38:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2024-02-10 00:38:15,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 42 letters. Loop has 2 letters. [2024-02-10 00:38:15,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:38:15,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 44 letters. Loop has 2 letters. [2024-02-10 00:38:15,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:38:15,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 42 letters. Loop has 4 letters. [2024-02-10 00:38:15,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:38:15,211 INFO L428 stractBuchiCegarLoop]: Abstraction has has 101 places, 1128 transitions, 4662 flow [2024-02-10 00:38:15,211 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:38:15,211 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 101 places, 1128 transitions, 4662 flow [2024-02-10 00:38:15,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:38:15,347 INFO L124 PetriNetUnfolderBase]: 245/445 cut-off events. [2024-02-10 00:38:15,347 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-10 00:38:15,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:38:15,352 INFO L748 eck$LassoCheckResult]: Stem: 98#[$Ultimate##0]true [193] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 100#[L-1]true [199] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 102#[L21]true [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[] 104#[L21-1]true [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[] 106#[L21-2]true [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[] 108#[L21-3]true [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[] 110#[L21-4]true [244] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] 112#[L37]true [226] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] 114#[L37-1]true [227] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] 116#[L37-2]true [176] L37-2-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 118#[L-1-1]true [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] 120#[L-1-2]true [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] 122#[L66]true [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] 124#[L66-1]true [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] 126#[L66-2]true [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] 128#[L69]true [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] 130#[L69-1]true [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] 132#[L70]true [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] 134#[L70-1]true [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] 136#[L70-2]true [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] 138#[L71]true [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] 140#[L71-1]true [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] 142#[L71-2]true [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] 144#[L72]true [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] 146#[L72-1]true [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] 148#[L72-2]true [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] 150#[L75]true [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] 152#[L75-1]true [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] 154#[L33]true [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] 156#[L34]true [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[] 158#[L33-1]true [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] 160#[L75-2]true [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] 162#[L76]true [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] 164#[L76-1]true [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] 166#[L33-2]true [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] 168#[L34-3]true [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[] 170#[L33-3]true [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] 172#[L76-2]true [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] 174#[L78]true [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] 176#[L78-1]true [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] 178#[L78-2]true [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] 180#[L78-3]true [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] 182#[L46, L78-4]true [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] 434#[L78-5, L46]true [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] 436#[L79, L46]true [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] 438#[L79-1, L46]true [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] 440#[L79-2, L46]true [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] 442#[L46, L79-3]true [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] 444#[L79-4, L59, L46]true [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[] 446#[L79-4, L46, L54]true [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] 444#[L79-4, L59, L46]true [2024-02-10 00:38:15,352 INFO L750 eck$LassoCheckResult]: Loop: 444#[L79-4, L59, L46]true [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[] 446#[L79-4, L46, L54]true [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] 444#[L79-4, L59, L46]true [2024-02-10 00:38:15,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash -74462990, now seen corresponding path program 1 times [2024-02-10 00:38:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:38:15,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703392386] [2024-02-10 00:38:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:38:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:38:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:15,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:38:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:15,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:38:15,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash 9188, now seen corresponding path program 1 times [2024-02-10 00:38:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:38:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219401090] [2024-02-10 00:38:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:38:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:38:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:15,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:38:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:15,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:38:15,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1455518869, now seen corresponding path program 2 times [2024-02-10 00:38:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:38:15,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193630645] [2024-02-10 00:38:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:38:15,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:38:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:15,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:38:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:38:15,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:38:15,503 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:38:15,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:38:15,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:38:15,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:38:15,503 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:38:15,503 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,503 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:38:15,503 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:38:15,503 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration2_Loop [2024-02-10 00:38:15,503 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:38:15,503 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:38:15,507 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:38:15,509 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:38:15,511 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:38:15,513 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:38:15,516 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:38:15,523 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:38:15,526 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:38:15,528 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:38:15,578 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:38:15,578 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:38:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:15,593 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:38:15,644 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:38:15,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:38:15,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:15,662 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:38:15,663 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:38:15,669 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:38:15,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:15,671 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:38:15,673 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:38:15,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:38:15,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:15,691 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:38:15,691 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:38:15,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 00:38:15,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:15,709 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:38:15,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:38:15,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:15,736 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:38:15,753 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:38:15,753 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:38:15,775 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:38:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:15,778 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:38:15,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:38:15,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:15,792 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:38:15,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:38:15,806 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:38:15,812 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:38:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:15,814 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:38:15,819 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:38:15,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:15,829 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:38:15,847 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:38:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:15,849 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:38:15,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:38:15,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:38:15,876 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:38:15,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:38:15,962 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:38:15,962 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:38:15,962 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:38:15,962 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:38:15,962 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:38:15,962 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:38:15,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:15,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:38:15,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:38:15,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-2-unrolled-atomic.wvr.c_BEv2_Iteration2_Loop [2024-02-10 00:38:15,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:38:15,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:38:15,964 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:38:15,967 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:38:15,969 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:38:15,972 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:38:15,974 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:38:15,978 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:38:15,982 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:38:15,984 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:38:16,045 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:38:16,046 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:38:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:16,050 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:38:16,053 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:38:16,054 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:38:16,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:38:16,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:38:16,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:38:16,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:38:16,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:38:16,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:38:16,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:38:16,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:38:16,122 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:38:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:16,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:16,145 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:38:16,169 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:38:16,178 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:38:16,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:38:16,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:38:16,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:38:16,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:38:16,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:38:16,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:38:16,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:38:16,214 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:38:16,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:16,229 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:38:16,256 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:38:16,257 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:38:16,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:38:16,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:38:16,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:38:16,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:38:16,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:38:16,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:38:16,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:38:16,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-02-10 00:38:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:16,345 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:38:16,355 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:38:16,355 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:38:16,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:38:16,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:38:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:38:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:38:16,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:38:16,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:38:16,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:38:16,388 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:38:16,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:16,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:16,389 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:38:16,392 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:38:16,392 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:38:16,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:38:16,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:38:16,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:38:16,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:38:16,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:38:16,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:38:16,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:38:16,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:38:16,405 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:38:16,405 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:38:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:38:16,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:38:16,412 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:38:16,416 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:38:16,416 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:38:16,416 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:38:16,416 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:38:16,417 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:38:16,421 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:38:16,422 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:38:16,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:38:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:38:16,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:38:16,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:38:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:38:16,523 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:38:16,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:38:16,536 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:38:16,537 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:38:16,537 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:38:16,647 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:38:16,648 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:38:16,648 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:38:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 1180 transitions. [2024-02-10 00:38:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1180 transitions. [2024-02-10 00:38:16,663 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:38:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 1180 transitions. [2024-02-10 00:38:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1180 transitions. [2024-02-10 00:38:16,754 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:38:17,362 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:38:17,362 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:38:17,362 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:38:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:38:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2024-02-10 00:38:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 50 letters. Loop has 2 letters. [2024-02-10 00:38:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:38:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 52 letters. Loop has 2 letters. [2024-02-10 00:38:17,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:38:17,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 468 transitions. Stem has 50 letters. Loop has 4 letters. [2024-02-10 00:38:17,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:38:17,367 INFO L428 stractBuchiCegarLoop]: Abstraction has has 114 places, 18405 transitions, 112980 flow [2024-02-10 00:38:17,367 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:38:17,367 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 places, 18405 transitions, 112980 flow [2024-02-10 00:38:26,317 INFO L124 PetriNetUnfolderBase]: 6771/8692 cut-off events. [2024-02-10 00:38:26,318 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-02-10 00:38:26,318 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 00:38:26,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:38:26 BoogieIcfgContainer [2024-02-10 00:38:26,324 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:38:26,325 INFO L158 Benchmark]: Toolchain (without parser) took 13501.44ms. Allocated memory was 309.3MB in the beginning and 1.1GB in the end (delta: 823.1MB). Free memory was 240.1MB in the beginning and 810.2MB in the end (delta: -570.1MB). Peak memory consumption was 464.6MB. Max. memory is 8.0GB. [2024-02-10 00:38:26,325 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:38:26,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.66ms. Allocated memory is still 309.3MB. Free memory was 240.1MB in the beginning and 229.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:38:26,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.97ms. Allocated memory is still 309.3MB. Free memory was 229.0MB in the beginning and 227.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:38:26,326 INFO L158 Benchmark]: Boogie Preprocessor took 21.96ms. Allocated memory is still 309.3MB. Free memory was 227.5MB in the beginning and 226.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:38:26,326 INFO L158 Benchmark]: RCFGBuilder took 335.15ms. Allocated memory is still 309.3MB. Free memory was 226.2MB in the beginning and 209.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-02-10 00:38:26,326 INFO L158 Benchmark]: BuchiAutomizer took 12910.71ms. Allocated memory was 309.3MB in the beginning and 1.1GB in the end (delta: 823.1MB). Free memory was 209.1MB in the beginning and 810.2MB in the end (delta: -601.1MB). Peak memory consumption was 433.1MB. Max. memory is 8.0GB. [2024-02-10 00:38:26,328 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 164.6MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.66ms. Allocated memory is still 309.3MB. Free memory was 240.1MB in the beginning and 229.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.97ms. Allocated memory is still 309.3MB. Free memory was 229.0MB in the beginning and 227.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.96ms. Allocated memory is still 309.3MB. Free memory was 227.5MB in the beginning and 226.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.15ms. Allocated memory is still 309.3MB. Free memory was 226.2MB in the beginning and 209.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 12910.71ms. Allocated memory was 309.3MB in the beginning and 1.1GB in the end (delta: 823.1MB). Free memory was 209.1MB in the beginning and 810.2MB in the end (delta: -601.1MB). Peak memory consumption was 433.1MB. 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 12.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 1.3s. 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, 516 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 924 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 480 mSDtfsCounter, 156 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: 73ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s 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:38:26,340 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...