/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/pthread-atomic/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:33:06,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:33:06,603 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:33:06,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:33:06,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:33:06,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:33:06,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:33:06,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:33:06,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:33:06,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:33:06,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:33:06,635 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:33:06,635 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:33:06,636 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:33:06,636 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:33:06,636 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:33:06,636 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:33:06,637 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:33:06,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:33:06,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:33:06,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:33:06,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:33:06,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:33:06,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:33:06,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:33:06,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:33:06,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:33:06,648 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:33:06,648 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:33:06,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:33:06,649 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:33:06,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:33:06,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:33:06,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:33:06,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:33:06,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:33:06,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:33:06,651 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:33:06,651 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:33:06,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:33:06,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:33:06,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:33:06,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:33:06,957 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:33:06,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2024-02-10 00:33:08,256 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:33:08,470 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:33:08,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2024-02-10 00:33:08,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8444320/52c05de3676b479e9f488e42fb93700c/FLAG03dbe0a19 [2024-02-10 00:33:08,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8444320/52c05de3676b479e9f488e42fb93700c [2024-02-10 00:33:08,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:33:08,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:33:08,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:33:08,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:33:08,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:33:08,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:33:08" (1/1) ... [2024-02-10 00:33:08,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247a04e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:08, skipping insertion in model container [2024-02-10 00:33:08,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:33:08" (1/1) ... [2024-02-10 00:33:08,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:33:08,804 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-10 00:33:08,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:33:08,986 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:33:09,012 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-10 00:33:09,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:33:09,078 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:09,079 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:09,079 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:09,086 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:33:09,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09 WrapperNode [2024-02-10 00:33:09,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:33:09,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:33:09,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:33:09,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:33:09,101 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:33:09" (1/1) ... [2024-02-10 00:33:09,129 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:33:09" (1/1) ... [2024-02-10 00:33:09,159 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2024-02-10 00:33:09,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:33:09,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:33:09,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:33:09,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:33:09,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:33:09,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:33:09,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:33:09,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:33:09,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:33:09,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:33:09,244 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:33:09,258 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:33:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:33:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-02-10 00:33:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-02-10 00:33:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-10 00:33:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-10 00:33:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:33:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:33:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:33:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:33:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:33:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:33:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:33:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:33:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:33:09,302 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:33:09,434 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:33:09,436 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:33:09,600 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:33:09,605 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:33:09,605 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 00:33:09,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:33:09 BoogieIcfgContainer [2024-02-10 00:33:09,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:33:09,608 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:33:09,608 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:33:09,611 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:33:09,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:09,612 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:33:08" (1/3) ... [2024-02-10 00:33:09,613 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c40d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:33:09, skipping insertion in model container [2024-02-10 00:33:09,613 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:09,613 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (2/3) ... [2024-02-10 00:33:09,614 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c40d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:33:09, skipping insertion in model container [2024-02-10 00:33:09,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:09,614 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:33:09" (3/3) ... [2024-02-10 00:33:09,615 INFO L332 chiAutomizerObserver]: Analyzing ICFG peterson.i [2024-02-10 00:33:09,706 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:33:09,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 190 flow [2024-02-10 00:33:09,804 INFO L124 PetriNetUnfolderBase]: 8/84 cut-off events. [2024-02-10 00:33:09,804 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:33:09,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 8/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-02-10 00:33:09,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 190 flow [2024-02-10 00:33:09,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 180 flow [2024-02-10 00:33:09,827 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:33:09,827 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:33:09,827 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:33:09,827 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:33:09,827 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:33:09,827 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:33:09,827 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:33:09,828 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:33:09,828 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 83 places, 84 transitions, 180 flow [2024-02-10 00:33:09,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:09,850 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-02-10 00:33:09,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:33:09,851 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:09,856 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:33:09,857 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 83 places, 84 transitions, 180 flow [2024-02-10 00:33:09,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:09,870 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-02-10 00:33:09,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:33:09,870 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:09,881 INFO L748 eck$LassoCheckResult]: Stem: 89#[$Ultimate##0]true [147] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 91#[L-1]true [164] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 93#[L12]true [134] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 95#[L12-1]true [155] L12-1-->L12-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[] 97#[L12-2]true [153] L12-2-->L12-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[] 99#[L12-3]true [178] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 101#[L12-4]true [172] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 103#[L700]true [190] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 105#[L701]true [181] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 107#[L702]true [142] L702-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 109#[L-1-1]true [189] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 111#[L-1-2]true [192] L-1-2-->L760: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_1|, ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_1|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre4#1] 113#[L760]true [180] L760-->L760-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 115#[L760-1]true [162] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~1#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_2|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 117#[L760-2]true [175] L760-2-->L761: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 119#[L761]true [144] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 121#[L761-1]true [173] L761-1-->L761-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~1#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~1#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) |v_ULTIMATE.start_main_~#t1~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] 123#[L761-2]true [252] L761-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_10|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_10|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~f21~0#1, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_~t1~0#1, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base] 125#[L761-3, $Ultimate##0]true [228] $Ultimate##0-->L704: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.base_1| |v_thr1Thread1of1ForFork0_~_#1.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_1| |v_thr1Thread1of1ForFork0_~_#1.offset_1|)) InVars {thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_1|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_~_#1.base] 127#[L704, L761-3]true [229] L704-->L706: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0] 129#[L706, L761-3]true [230] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 131#[L761-3, L709]true [231] L709-->L712: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_1| v_~flag2~0_3) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_1|, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 133#[L712, L761-3]true [232] L712-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 135#[L722, L761-3]true [2024-02-10 00:33:09,882 INFO L750 eck$LassoCheckResult]: Loop: 135#[L722, L761-3]true [233] L722-->L717: Formula: (and (= |v_thr1Thread1of1ForFork0_~t1~0#1_3| 1) (= |v_thr1Thread1of1ForFork0_~f21~0#1_3| 1)) InVars {thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} OutVars{thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} AuxVars[] AssignedVars[] 138#[L717, L761-3]true [236] L717-->L719: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_7| v_~flag2~0_4) InVars {~flag2~0=v_~flag2~0_4} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_7|, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 140#[L761-3, L719]true [238] L719-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_7| v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 135#[L722, L761-3]true [2024-02-10 00:33:09,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash 138993370, now seen corresponding path program 1 times [2024-02-10 00:33:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:09,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485739796] [2024-02-10 00:33:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:10,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 261258, now seen corresponding path program 1 times [2024-02-10 00:33:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531425725] [2024-02-10 00:33:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:10,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 403243793, now seen corresponding path program 1 times [2024-02-10 00:33:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751732657] [2024-02-10 00:33:10,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:10,421 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:33:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751732657] [2024-02-10 00:33:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751732657] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:10,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857853039] [2024-02-10 00:33:10,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:10,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:10,693 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 180 flow. Second operand 5 states and 440 transitions. [2024-02-10 00:33:10,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 180 flow. Second operand 5 states and 440 transitions. [2024-02-10 00:33:10,697 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 88 [2024-02-10 00:33:10,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:10,739 INFO L124 PetriNetUnfolderBase]: 6/138 cut-off events. [2024-02-10 00:33:10,739 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-10 00:33:10,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 138 events. 6/138 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 390 event pairs, 0 based on Foata normal form. 22/151 useless extension candidates. Maximal degree in co-relation 111. Up to 7 conditions per place. [2024-02-10 00:33:10,741 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 5 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2024-02-10 00:33:10,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 194 flow [2024-02-10 00:33:10,742 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 201 flow [2024-02-10 00:33:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:10,752 INFO L428 stractBuchiCegarLoop]: Abstraction has has 90 places, 78 transitions, 201 flow [2024-02-10 00:33:10,752 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:33:10,752 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 90 places, 78 transitions, 201 flow [2024-02-10 00:33:10,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:10,759 INFO L124 PetriNetUnfolderBase]: 0/53 cut-off events. [2024-02-10 00:33:10,759 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-10 00:33:10,759 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:10,764 INFO L748 eck$LassoCheckResult]: Stem: 89#[$Ultimate##0]true [147] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 91#[L-1]true [164] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 93#[L12]true [134] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 95#[L12-1]true [155] L12-1-->L12-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[] 97#[L12-2]true [153] L12-2-->L12-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[] 99#[L12-3]true [178] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 101#[L12-4]true [172] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 103#[L700]true [190] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 105#[L701]true [181] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 107#[L702]true [142] L702-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 109#[L-1-1]true [189] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 111#[L-1-2]true [192] L-1-2-->L760: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_1|, ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_1|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre4#1] 113#[L760]true [180] L760-->L760-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 115#[L760-1]true [162] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~1#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_2|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 117#[L760-2]true [175] L760-2-->L761: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 119#[L761]true [144] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 121#[L761-1]true [173] L761-1-->L761-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~1#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~1#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) |v_ULTIMATE.start_main_~#t1~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] 123#[L761-2]true [252] L761-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_10|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_10|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~f21~0#1, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_~t1~0#1, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base] 125#[L761-3, $Ultimate##0]true [201] L761-3-->L761-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 205#[L761-4, $Ultimate##0]true [165] L761-4-->L762: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 207#[L762, $Ultimate##0]true [140] L762-->L762-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 209#[$Ultimate##0, L762-1]true [152] L762-1-->L762-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 211#[L762-2, $Ultimate##0]true [132] L762-2-->L762-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) |v_ULTIMATE.start_main_~#t2~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_3| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) 1)) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 213#[L762-3, $Ultimate##0]true [255] L762-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork1_thidvar0_2) (= |v_thr2Thread1of1ForFork1_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_4|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_10|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_4|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_10|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_4|, thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork1_~f12~0#1, thr2Thread1of1ForFork1_#in~_#1.offset, thr2Thread1of1ForFork1_~t2~0#1, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_#in~_#1.base, thr2Thread1of1ForFork1_~_#1.offset, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork1_#res#1.base] 215#[L762-4, $Ultimate##0, $Ultimate##0]true [206] $Ultimate##0-->L732: Formula: (and (= |v_thr2Thread1of1ForFork1_~_#1.base_1| |v_thr2Thread1of1ForFork1_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork1_~_#1.offset_1| |v_thr2Thread1of1ForFork1_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_1|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_1|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_~_#1.offset] 217#[L762-4, L732, $Ultimate##0]true [207] L732-->L734: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 219#[L762-4, L734, $Ultimate##0]true [208] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 221#[L762-4, L737, $Ultimate##0]true [209] L737-->L740: Formula: (= v_~flag1~0_1 |v_thr2Thread1of1ForFork1_~f12~0#1_1|) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0#1] 223#[L762-4, L740, $Ultimate##0]true [210] L740-->L750: Formula: (= |v_thr2Thread1of1ForFork1_~t2~0#1_1| v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{~turn~0=v_~turn~0_2, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0#1] 225#[L762-4, L750, $Ultimate##0]true [2024-02-10 00:33:10,764 INFO L750 eck$LassoCheckResult]: Loop: 225#[L762-4, L750, $Ultimate##0]true [211] L750-->L745: Formula: (and (= |v_thr2Thread1of1ForFork1_~t2~0#1_3| 0) (= |v_thr2Thread1of1ForFork1_~f12~0#1_3| 1)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_3|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_3|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_3|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_3|} AuxVars[] AssignedVars[] 228#[L762-4, L745, $Ultimate##0]true [214] L745-->L747: Formula: (= v_~flag1~0_2 |v_thr2Thread1of1ForFork1_~f12~0#1_7|) InVars {~flag1~0=v_~flag1~0_2} OutVars{~flag1~0=v_~flag1~0_2, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0#1] 230#[L762-4, L747, $Ultimate##0]true [216] L747-->L750: Formula: (= |v_thr2Thread1of1ForFork1_~t2~0#1_7| v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{~turn~0=v_~turn~0_3, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0#1] 225#[L762-4, L750, $Ultimate##0]true [2024-02-10 00:33:10,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2053202783, now seen corresponding path program 1 times [2024-02-10 00:33:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132355808] [2024-02-10 00:33:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:10,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 239412, now seen corresponding path program 1 times [2024-02-10 00:33:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082388620] [2024-02-10 00:33:10,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:10,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1960330900, now seen corresponding path program 1 times [2024-02-10 00:33:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787138541] [2024-02-10 00:33:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:10,921 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:33:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787138541] [2024-02-10 00:33:10,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787138541] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:10,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:10,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768026149] [2024-02-10 00:33:10,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:10,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:11,014 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 201 flow. Second operand 5 states and 440 transitions. [2024-02-10 00:33:11,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 201 flow. Second operand 5 states and 440 transitions. [2024-02-10 00:33:11,015 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 88 [2024-02-10 00:33:11,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:11,048 INFO L124 PetriNetUnfolderBase]: 15/275 cut-off events. [2024-02-10 00:33:11,049 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2024-02-10 00:33:11,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 275 events. 15/275 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1403 event pairs, 1 based on Foata normal form. 4/262 useless extension candidates. Maximal degree in co-relation 264. Up to 15 conditions per place. [2024-02-10 00:33:11,052 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 6 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2024-02-10 00:33:11,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 242 flow [2024-02-10 00:33:11,053 INFO L231 Difference]: Finished difference. Result has 97 places, 82 transitions, 242 flow [2024-02-10 00:33:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:11,054 INFO L428 stractBuchiCegarLoop]: Abstraction has has 97 places, 82 transitions, 242 flow [2024-02-10 00:33:11,054 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:33:11,054 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 97 places, 82 transitions, 242 flow [2024-02-10 00:33:11,062 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:11,062 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2024-02-10 00:33:11,062 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-10 00:33:11,063 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:11,064 INFO L748 eck$LassoCheckResult]: Stem: 89#[$Ultimate##0]true [147] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 91#[L-1]true [164] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 93#[L12]true [134] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 95#[L12-1]true [155] L12-1-->L12-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[] 97#[L12-2]true [153] L12-2-->L12-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[] 99#[L12-3]true [178] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 101#[L12-4]true [172] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 103#[L700]true [190] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 105#[L701]true [181] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 107#[L702]true [142] L702-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 109#[L-1-1]true [189] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 111#[L-1-2]true [192] L-1-2-->L760: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_1|, ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_1|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre4#1] 113#[L760]true [180] L760-->L760-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 115#[L760-1]true [162] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~1#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_2|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 117#[L760-2]true [175] L760-2-->L761: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 119#[L761]true [144] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 121#[L761-1]true [173] L761-1-->L761-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~1#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~1#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) |v_ULTIMATE.start_main_~#t1~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] 123#[L761-2]true [252] L761-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_10|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_10|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~f21~0#1, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_~t1~0#1, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base] 125#[L761-3, $Ultimate##0]true [228] $Ultimate##0-->L704: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.base_1| |v_thr1Thread1of1ForFork0_~_#1.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_1| |v_thr1Thread1of1ForFork0_~_#1.offset_1|)) InVars {thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_1|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_~_#1.base] 127#[L704, L761-3]true [201] L761-3-->L761-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 268#[L704, L761-4]true [229] L704-->L706: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0] 270#[L706, L761-4]true [165] L761-4-->L762: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 272#[L706, L762]true [230] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 274#[L762, L709]true [140] L762-->L762-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 276#[L709, L762-1]true [152] L762-1-->L762-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 278#[L762-2, L709]true [132] L762-2-->L762-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) |v_ULTIMATE.start_main_~#t2~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_3| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) 1)) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 280#[L762-3, L709]true [255] L762-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork1_thidvar0_2) (= |v_thr2Thread1of1ForFork1_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_4|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_10|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_4|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_10|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_4|, thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork1_~f12~0#1, thr2Thread1of1ForFork1_#in~_#1.offset, thr2Thread1of1ForFork1_~t2~0#1, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_#in~_#1.base, thr2Thread1of1ForFork1_~_#1.offset, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork1_#res#1.base] 282#[L762-4, $Ultimate##0, L709]true [206] $Ultimate##0-->L732: Formula: (and (= |v_thr2Thread1of1ForFork1_~_#1.base_1| |v_thr2Thread1of1ForFork1_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork1_~_#1.offset_1| |v_thr2Thread1of1ForFork1_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_1|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_1|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_~_#1.offset] 284#[L762-4, L732, L709]true [207] L732-->L734: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 286#[L762-4, L734, L709]true [231] L709-->L712: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_1| v_~flag2~0_3) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_1|, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 288#[L762-4, L712, L734]true [232] L712-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 290#[L762-4, L734, L722]true [2024-02-10 00:33:11,064 INFO L750 eck$LassoCheckResult]: Loop: 290#[L762-4, L734, L722]true [233] L722-->L717: Formula: (and (= |v_thr1Thread1of1ForFork0_~t1~0#1_3| 1) (= |v_thr1Thread1of1ForFork0_~f21~0#1_3| 1)) InVars {thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} OutVars{thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} AuxVars[] AssignedVars[] 293#[L762-4, L734, L717]true [236] L717-->L719: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_7| v_~flag2~0_4) InVars {~flag2~0=v_~flag2~0_4} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_7|, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 295#[L762-4, L734, L719]true [238] L719-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_7| v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 290#[L762-4, L734, L722]true [2024-02-10 00:33:11,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1921528350, now seen corresponding path program 1 times [2024-02-10 00:33:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099964659] [2024-02-10 00:33:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 261258, now seen corresponding path program 2 times [2024-02-10 00:33:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358639061] [2024-02-10 00:33:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash 927185229, now seen corresponding path program 1 times [2024-02-10 00:33:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115164329] [2024-02-10 00:33:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:33:12 BoogieIcfgContainer [2024-02-10 00:33:12,229 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:33:12,230 INFO L158 Benchmark]: Toolchain (without parser) took 3728.14ms. Allocated memory was 201.3MB in the beginning and 290.5MB in the end (delta: 89.1MB). Free memory was 134.5MB in the beginning and 237.1MB in the end (delta: -102.6MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:33:12,230 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:33:12,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.27ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 160.5MB in the end (delta: -26.3MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.97ms. Allocated memory is still 201.3MB. Free memory was 160.5MB in the beginning and 158.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,231 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 157.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,232 INFO L158 Benchmark]: RCFGBuilder took 412.04ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 142.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,232 INFO L158 Benchmark]: BuchiAutomizer took 2621.08ms. Allocated memory was 201.3MB in the beginning and 290.5MB in the end (delta: 89.1MB). Free memory was 142.8MB in the beginning and 237.1MB in the end (delta: -94.2MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:33:12,234 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.11ms. Allocated memory is still 201.3MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 588.27ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 160.5MB in the end (delta: -26.3MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.97ms. Allocated memory is still 201.3MB. Free memory was 160.5MB in the beginning and 158.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 157.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 412.04ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 142.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 2621.08ms. Allocated memory was 201.3MB in the beginning and 290.5MB in the end (delta: 89.1MB). Free memory was 142.8MB in the beginning and 237.1MB in the end (delta: -94.2MB). There was no memory consumed. 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 (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 433 mSDsluCounter, 1040 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 584 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 456 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 716]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L702] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L760] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=22307, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L705] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L708] 1 turn = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L762] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=22308, t1={14732:0}, t2={14731:0}, turn=1, x=0] [L733] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L711] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, turn=1, x=0] [L714] 1 int t1 = turn; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, t1=1, turn=1, x=0] Loop: [L716] COND TRUE f21==1 && t1==1 [L718] f21 = flag2 [L721] t1 = turn End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 716]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L702] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L760] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=22307, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L705] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L708] 1 turn = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L762] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=22308, t1={14732:0}, t2={14731:0}, turn=1, x=0] [L733] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L711] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, turn=1, x=0] [L714] 1 int t1 = turn; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, t1=1, turn=1, x=0] Loop: [L716] COND TRUE f21==1 && t1==1 [L718] f21 = flag2 [L721] t1 = turn End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 00:33:12,292 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...