/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/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:33:07,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:33:07,817 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:07,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:33:07,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:33:07,822 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:07,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:33:07,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:33:07,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:33:07,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:33:07,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:33:07,871 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:33:07,871 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:33:07,872 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:33:07,872 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:33:07,872 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:33:07,872 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:33:07,873 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:33:07,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:33:07,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:33:07,873 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:33:07,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:33:07,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:33:07,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:33:07,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:33:07,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:33:07,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:33:07,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:33:07,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:33:07,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:33:07,876 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:33:07,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:33:07,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:33:07,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:33:07,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:33:07,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:33:07,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:33:07,878 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:33:07,878 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:08,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:33:08,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:33:08,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:33:08,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:33:08,426 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:33:08,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2024-02-10 00:33:09,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:33:09,890 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:33:09,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2024-02-10 00:33:09,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a06bc17/337ba587064047dfa303385bb8cca327/FLAG3dd7d8c00 [2024-02-10 00:33:09,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a06bc17/337ba587064047dfa303385bb8cca327 [2024-02-10 00:33:09,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:33:09,927 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:33:09,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:33:09,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:33:09,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:33:09,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45359e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09, skipping insertion in model container [2024-02-10 00:33:09,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:10,004 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:33:10,138 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-10 00:33:10,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:33:10,320 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:33:10,335 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-10 00:33:10,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:33:10,374 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:10,375 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:10,375 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:10,380 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:33:10,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:10 WrapperNode [2024-02-10 00:33:10,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:33:10,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:33:10,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:33:10,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:33:10,387 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:10" (1/1) ... [2024-02-10 00:33:10,412 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:10" (1/1) ... [2024-02-10 00:33:10,437 INFO L138 Inliner]: procedures = 171, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 207 [2024-02-10 00:33:10,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:33:10,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:33:10,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:33:10,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:33:10,475 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:10" (1/1) ... [2024-02-10 00:33:10,475 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:10" (1/1) ... [2024-02-10 00:33:10,492 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:10" (1/1) ... [2024-02-10 00:33:10,492 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:10" (1/1) ... [2024-02-10 00:33:10,495 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:10" (1/1) ... [2024-02-10 00:33:10,498 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:10" (1/1) ... [2024-02-10 00:33:10,500 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:10" (1/1) ... [2024-02-10 00:33:10,500 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:10" (1/1) ... [2024-02-10 00:33:10,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:33:10,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:33:10,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:33:10,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:33:10,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:10" (1/1) ... [2024-02-10 00:33:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:33:10,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:33:10,554 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:10,556 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:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:33:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-02-10 00:33:10,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-10 00:33:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:33:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:33:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:33:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:33:10,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:33:10,608 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:10,747 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:33:10,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:33:10,931 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:33:10,937 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:33:10,937 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2024-02-10 00:33:10,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:33:10 BoogieIcfgContainer [2024-02-10 00:33:10,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:33:10,940 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:33:10,940 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:33:10,943 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:33:10,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:10,944 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:33:09" (1/3) ... [2024-02-10 00:33:10,945 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f139992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:33:10, skipping insertion in model container [2024-02-10 00:33:10,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:10,945 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:10" (2/3) ... [2024-02-10 00:33:10,945 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f139992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:33:10, skipping insertion in model container [2024-02-10 00:33:10,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:10,946 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:33:10" (3/3) ... [2024-02-10 00:33:10,947 INFO L332 chiAutomizerObserver]: Analyzing ICFG lamport.i [2024-02-10 00:33:11,028 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:33:11,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 141 transitions, 296 flow [2024-02-10 00:33:11,092 INFO L124 PetriNetUnfolderBase]: 26/137 cut-off events. [2024-02-10 00:33:11,092 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:33:11,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 137 events. 26/137 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 305 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 107. Up to 5 conditions per place. [2024-02-10 00:33:11,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 141 transitions, 296 flow [2024-02-10 00:33:11,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 137 transitions, 286 flow [2024-02-10 00:33:11,112 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:33:11,112 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:33:11,112 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:33:11,112 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:33:11,112 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:33:11,113 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:33:11,113 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:33:11,113 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:33:11,113 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 118 places, 137 transitions, 286 flow [2024-02-10 00:33:11,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:11,127 INFO L124 PetriNetUnfolderBase]: 5/60 cut-off events. [2024-02-10 00:33:11,127 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:33:11,128 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:11,130 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:33:11,130 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 118 places, 137 transitions, 286 flow [2024-02-10 00:33:11,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:11,139 INFO L124 PetriNetUnfolderBase]: 5/60 cut-off events. [2024-02-10 00:33:11,139 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:33:11,139 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:11,145 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [432] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 164#[$Ultimate##3, L845-3]true [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 166#[L753-1, L845-3]true [2024-02-10 00:33:11,146 INFO L750 eck$LassoCheckResult]: Loop: 166#[L753-1, L845-3]true [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 169#[L705, L845-3]true [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 171#[L707, L845-3]true [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 173#[L710, L845-3]true [447] L710-->L713: Formula: (= v_~y~0_15 |v_thr1Thread1of1ForFork1_~y1~0#1_1|) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 175#[L845-3, L713]true [451] L713-->L715: Formula: (not (= |v_thr1Thread1of1ForFork1_~y1~0#1_3| 0)) InVars {thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_3|} OutVars{thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_3|} AuxVars[] AssignedVars[] 177#[L715, L845-3]true [455] L715-->L717: Formula: (= v_~b1~0_6 0) InVars {} OutVars{~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[~b1~0] 179#[L717, L845-3]true [457] L717-->L724: Formula: (= v_~y~0_16 |v_thr1Thread1of1ForFork1_~y1~0#1_7|) InVars {~y~0=v_~y~0_16} OutVars{~y~0=v_~y~0_16, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 181#[L724, L845-3]true [460] L724-->L753-1: Formula: (= |v_thr1Thread1of1ForFork1_~y1~0#1_11| 0) InVars {thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_11|} OutVars{thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_11|} AuxVars[] AssignedVars[] 166#[L753-1, L845-3]true [2024-02-10 00:33:11,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1185385107, now seen corresponding path program 1 times [2024-02-10 00:33:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908770312] [2024-02-10 00:33:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716720, now seen corresponding path program 1 times [2024-02-10 00:33:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761948340] [2024-02-10 00:33:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:11,390 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:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761948340] [2024-02-10 00:33:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761948340] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171338076] [2024-02-10 00:33:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:11,451 INFO L765 eck$LassoCheckResult]: loop already infeasible [2024-02-10 00:33:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:11,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-10 00:33:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-10 00:33:12,026 INFO L175 Difference]: Start difference. First operand has 118 places, 137 transitions, 286 flow. Second operand 7 states and 987 transitions. [2024-02-10 00:33:12,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 137 transitions, 286 flow. Second operand 7 states and 987 transitions. [2024-02-10 00:33:12,032 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-10 00:33:12,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:12,137 INFO L124 PetriNetUnfolderBase]: 144/768 cut-off events. [2024-02-10 00:33:12,137 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-10 00:33:12,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 768 events. 144/768 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4891 event pairs, 0 based on Foata normal form. 189/833 useless extension candidates. Maximal degree in co-relation 861. Up to 37 conditions per place. [2024-02-10 00:33:12,148 INFO L140 encePairwiseOnDemand]: 110/141 looper letters, 32 selfloop transitions, 30 changer transitions 0/162 dead transitions. [2024-02-10 00:33:12,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 162 transitions, 460 flow [2024-02-10 00:33:12,150 INFO L231 Difference]: Finished difference. Result has 130 places, 151 transitions, 490 flow [2024-02-10 00:33:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-10 00:33:12,154 INFO L428 stractBuchiCegarLoop]: Abstraction has has 130 places, 151 transitions, 490 flow [2024-02-10 00:33:12,154 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:33:12,154 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 places, 151 transitions, 490 flow [2024-02-10 00:33:12,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:12,157 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2024-02-10 00:33:12,157 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-10 00:33:12,157 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:12,158 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [432] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 164#[$Ultimate##3, L845-3]true [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 166#[L753-1, L845-3]true [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 169#[L705, L845-3]true [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 171#[L707, L845-3]true [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 173#[L710, L845-3]true [447] L710-->L713: Formula: (= v_~y~0_15 |v_thr1Thread1of1ForFork1_~y1~0#1_1|) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 175#[L845-3, L713]true [451] L713-->L715: Formula: (not (= |v_thr1Thread1of1ForFork1_~y1~0#1_3| 0)) InVars {thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_3|} OutVars{thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_3|} AuxVars[] AssignedVars[] 177#[L715, L845-3]true [455] L715-->L717: Formula: (= v_~b1~0_6 0) InVars {} OutVars{~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[~b1~0] 179#[L717, L845-3]true [457] L717-->L724: Formula: (= v_~y~0_16 |v_thr1Thread1of1ForFork1_~y1~0#1_7|) InVars {~y~0=v_~y~0_16} OutVars{~y~0=v_~y~0_16, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 181#[L724, L845-3]true [2024-02-10 00:33:12,158 INFO L750 eck$LassoCheckResult]: Loop: 181#[L724, L845-3]true [459] L724-->L722: Formula: (not (= |v_thr1Thread1of1ForFork1_~y1~0#1_9| 0)) InVars {thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_9|} OutVars{thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_9|} AuxVars[] AssignedVars[] 265#[L722, L845-3]true [464] L722-->L724: Formula: (= |v_thr1Thread1of1ForFork1_~y1~0#1_13| v_~y~0_9) InVars {~y~0=v_~y~0_9} OutVars{~y~0=v_~y~0_9, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_13|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 181#[L724, L845-3]true [2024-02-10 00:33:12,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash -667945488, now seen corresponding path program 1 times [2024-02-10 00:33:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499318448] [2024-02-10 00:33:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:12,239 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:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499318448] [2024-02-10 00:33:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499318448] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:12,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:12,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:12,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631429389] [2024-02-10 00:33:12,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:12,241 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 00:33:12,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash 15654, now seen corresponding path program 1 times [2024-02-10 00:33:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:12,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791425619] [2024-02-10 00:33:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:12,383 INFO L175 Difference]: Start difference. First operand has 130 places, 151 transitions, 490 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:12,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 151 transitions, 490 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:12,385 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-10 00:33:12,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:12,446 INFO L124 PetriNetUnfolderBase]: 114/626 cut-off events. [2024-02-10 00:33:12,447 INFO L125 PetriNetUnfolderBase]: For 227/272 co-relation queries the response was YES. [2024-02-10 00:33:12,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 626 events. 114/626 cut-off events. For 227/272 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3678 event pairs, 5 based on Foata normal form. 25/554 useless extension candidates. Maximal degree in co-relation 909. Up to 54 conditions per place. [2024-02-10 00:33:12,458 INFO L140 encePairwiseOnDemand]: 126/141 looper letters, 34 selfloop transitions, 20 changer transitions 0/154 dead transitions. [2024-02-10 00:33:12,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 154 transitions, 612 flow [2024-02-10 00:33:12,460 INFO L231 Difference]: Finished difference. Result has 134 places, 147 transitions, 506 flow [2024-02-10 00:33:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:12,461 INFO L428 stractBuchiCegarLoop]: Abstraction has has 134 places, 147 transitions, 506 flow [2024-02-10 00:33:12,461 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:33:12,462 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 134 places, 147 transitions, 506 flow [2024-02-10 00:33:12,466 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:12,466 INFO L124 PetriNetUnfolderBase]: 0/51 cut-off events. [2024-02-10 00:33:12,468 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-02-10 00:33:12,468 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:12,469 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [432] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 164#[$Ultimate##3, L845-3]true [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 166#[L753-1, L845-3]true [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 169#[L705, L845-3]true [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 171#[L707, L845-3]true [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 173#[L710, L845-3]true [447] L710-->L713: Formula: (= v_~y~0_15 |v_thr1Thread1of1ForFork1_~y1~0#1_1|) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 175#[L845-3, L713]true [452] L713-->L728: Formula: (= |v_thr1Thread1of1ForFork1_~y1~0#1_5| 0) InVars {thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_5|} OutVars{thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_5|} AuxVars[] AssignedVars[] 304#[L728, L845-3]true [456] L728-->L730: Formula: (= v_~y~0_10 1) InVars {} OutVars{~y~0=v_~y~0_10} AuxVars[] AssignedVars[~y~0] 306#[L845-3, L730]true [458] L730-->L733: Formula: (= |v_thr1Thread1of1ForFork1_~x1~0#1_1| v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_1|, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~x1~0#1] 308#[L733, L845-3]true [462] L733-->L735: Formula: (not (= |v_thr1Thread1of1ForFork1_~x1~0#1_3| 1)) InVars {thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_3|} OutVars{thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_3|} AuxVars[] AssignedVars[] 310#[L735, L845-3]true [465] L735-->L737: Formula: (= v_~b1~0_4 0) InVars {} OutVars{~b1~0=v_~b1~0_4} AuxVars[] AssignedVars[~b1~0] 312#[L737, L845-3]true [466] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork1_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0#1] 314#[L744, L845-3]true [2024-02-10 00:33:12,469 INFO L750 eck$LassoCheckResult]: Loop: 314#[L744, L845-3]true [467] L744-->L742: Formula: (<= 1 |v_thr1Thread1of1ForFork1_~b21~0#1_3|) InVars {thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_3|} OutVars{thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_3|} AuxVars[] AssignedVars[] 317#[L742, L845-3]true [470] L742-->L744: Formula: (= v_~b2~0_6 |v_thr1Thread1of1ForFork1_~b21~0#1_7|) InVars {~b2~0=v_~b2~0_6} OutVars{~b2~0=v_~b2~0_6, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0#1] 314#[L744, L845-3]true [2024-02-10 00:33:12,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -150509314, now seen corresponding path program 1 times [2024-02-10 00:33:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:12,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396693126] [2024-02-10 00:33:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:12,567 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:12,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:12,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396693126] [2024-02-10 00:33:12,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396693126] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:12,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:12,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:12,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151192208] [2024-02-10 00:33:12,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:12,568 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 00:33:12,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 15908, now seen corresponding path program 1 times [2024-02-10 00:33:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610104039] [2024-02-10 00:33:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:12,633 INFO L175 Difference]: Start difference. First operand has 134 places, 147 transitions, 506 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:12,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 147 transitions, 506 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:12,634 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2024-02-10 00:33:12,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:12,730 INFO L124 PetriNetUnfolderBase]: 147/901 cut-off events. [2024-02-10 00:33:12,731 INFO L125 PetriNetUnfolderBase]: For 191/199 co-relation queries the response was YES. [2024-02-10 00:33:12,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 901 events. 147/901 cut-off events. For 191/199 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6146 event pairs, 5 based on Foata normal form. 1/770 useless extension candidates. Maximal degree in co-relation 1190. Up to 34 conditions per place. [2024-02-10 00:33:12,758 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 9 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2024-02-10 00:33:12,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 154 transitions, 548 flow [2024-02-10 00:33:12,760 INFO L231 Difference]: Finished difference. Result has 142 places, 152 transitions, 550 flow [2024-02-10 00:33:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:12,762 INFO L428 stractBuchiCegarLoop]: Abstraction has has 142 places, 152 transitions, 550 flow [2024-02-10 00:33:12,762 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:33:12,762 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 places, 152 transitions, 550 flow [2024-02-10 00:33:12,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:12,766 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2024-02-10 00:33:12,766 INFO L125 PetriNetUnfolderBase]: For 21/23 co-relation queries the response was YES. [2024-02-10 00:33:12,766 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:12,767 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [346] L845-3-->L845-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] 354#[L845-4, $Ultimate##0]true [272] L845-4-->L846: 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] 356#[$Ultimate##0, L846]true [257] L846-->L846-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] 358#[$Ultimate##0, L846-1]true [250] L846-1-->L846-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 360#[L846-2, $Ultimate##0]true [271] L846-2-->L846-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} AuxVars[] AssignedVars[#memory_int] 362#[L846-3, $Ultimate##0]true [482] L846-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_8|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_30|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~x2~0#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_~y2~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_#res#1.base] 364#[L846-4, $Ultimate##0, $Ultimate##0]true [384] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 366#[L846-4, $Ultimate##0, $Ultimate##3]true [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 368#[L823-1, L846-4, $Ultimate##0]true [2024-02-10 00:33:12,767 INFO L750 eck$LassoCheckResult]: Loop: 368#[L823-1, L846-4, $Ultimate##0]true [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 371#[L846-4, $Ultimate##0, L775]true [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 373#[L846-4, $Ultimate##0, L777]true [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 375#[L846-4, $Ultimate##0, L780]true [399] L780-->L783: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 377#[L846-4, $Ultimate##0, L783]true [403] L783-->L785: Formula: (not (= |v_thr2Thread1of1ForFork0_~y2~0#1_3| 0)) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_3|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_3|} AuxVars[] AssignedVars[] 379#[L846-4, $Ultimate##0, L785]true [407] L785-->L787: Formula: (= v_~b2~0_2 0) InVars {} OutVars{~b2~0=v_~b2~0_2} AuxVars[] AssignedVars[~b2~0] 381#[L787, L846-4, $Ultimate##0]true [409] L787-->L794: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_7| v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 383#[L794, L846-4, $Ultimate##0]true [412] L794-->L823-1: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_11| 0) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_11|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_11|} AuxVars[] AssignedVars[] 368#[L823-1, L846-4, $Ultimate##0]true [2024-02-10 00:33:12,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2079341359, now seen corresponding path program 1 times [2024-02-10 00:33:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751938934] [2024-02-10 00:33:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:12,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1093310352, now seen corresponding path program 1 times [2024-02-10 00:33:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:12,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896387139] [2024-02-10 00:33:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:12,839 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:12,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:12,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896387139] [2024-02-10 00:33:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896387139] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:12,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:12,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:12,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374432507] [2024-02-10 00:33:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:12,841 INFO L765 eck$LassoCheckResult]: loop already infeasible [2024-02-10 00:33:12,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-10 00:33:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-10 00:33:13,056 INFO L175 Difference]: Start difference. First operand has 142 places, 152 transitions, 550 flow. Second operand 7 states and 987 transitions. [2024-02-10 00:33:13,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 152 transitions, 550 flow. Second operand 7 states and 987 transitions. [2024-02-10 00:33:13,057 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-10 00:33:13,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:13,246 INFO L124 PetriNetUnfolderBase]: 200/1498 cut-off events. [2024-02-10 00:33:13,246 INFO L125 PetriNetUnfolderBase]: For 1051/1098 co-relation queries the response was YES. [2024-02-10 00:33:13,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1498 events. 200/1498 cut-off events. For 1051/1098 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13658 event pairs, 2 based on Foata normal form. 15/1383 useless extension candidates. Maximal degree in co-relation 2515. Up to 113 conditions per place. [2024-02-10 00:33:13,261 INFO L140 encePairwiseOnDemand]: 124/141 looper letters, 36 selfloop transitions, 51 changer transitions 0/201 dead transitions. [2024-02-10 00:33:13,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 201 transitions, 931 flow [2024-02-10 00:33:13,262 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 933 flow [2024-02-10 00:33:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-10 00:33:13,264 INFO L428 stractBuchiCegarLoop]: Abstraction has has 152 places, 187 transitions, 933 flow [2024-02-10 00:33:13,264 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 00:33:13,264 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 152 places, 187 transitions, 933 flow [2024-02-10 00:33:13,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:13,270 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2024-02-10 00:33:13,270 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2024-02-10 00:33:13,271 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:13,274 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [346] L845-3-->L845-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] 354#[L845-4, $Ultimate##0]true [272] L845-4-->L846: 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] 356#[$Ultimate##0, L846]true [257] L846-->L846-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] 358#[$Ultimate##0, L846-1]true [250] L846-1-->L846-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 360#[L846-2, $Ultimate##0]true [271] L846-2-->L846-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} AuxVars[] AssignedVars[#memory_int] 362#[L846-3, $Ultimate##0]true [482] L846-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_8|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_30|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~x2~0#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_~y2~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_#res#1.base] 364#[L846-4, $Ultimate##0, $Ultimate##0]true [384] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 366#[L846-4, $Ultimate##0, $Ultimate##3]true [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 368#[L823-1, L846-4, $Ultimate##0]true [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 371#[L846-4, $Ultimate##0, L775]true [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 373#[L846-4, $Ultimate##0, L777]true [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 375#[L846-4, $Ultimate##0, L780]true [399] L780-->L783: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 377#[L846-4, $Ultimate##0, L783]true [403] L783-->L785: Formula: (not (= |v_thr2Thread1of1ForFork0_~y2~0#1_3| 0)) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_3|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_3|} AuxVars[] AssignedVars[] 379#[L846-4, $Ultimate##0, L785]true [407] L785-->L787: Formula: (= v_~b2~0_2 0) InVars {} OutVars{~b2~0=v_~b2~0_2} AuxVars[] AssignedVars[~b2~0] 381#[L787, L846-4, $Ultimate##0]true [409] L787-->L794: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_7| v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 383#[L794, L846-4, $Ultimate##0]true [2024-02-10 00:33:13,275 INFO L750 eck$LassoCheckResult]: Loop: 383#[L794, L846-4, $Ultimate##0]true [411] L794-->L792: Formula: (not (= |v_thr2Thread1of1ForFork0_~y2~0#1_9| 0)) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_9|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_9|} AuxVars[] AssignedVars[] 440#[L792, L846-4, $Ultimate##0]true [416] L792-->L794: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_13| v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_13|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 383#[L794, L846-4, $Ultimate##0]true [2024-02-10 00:33:13,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash 236315582, now seen corresponding path program 1 times [2024-02-10 00:33:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48665048] [2024-02-10 00:33:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:13,365 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:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48665048] [2024-02-10 00:33:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48665048] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:13,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:13,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948568835] [2024-02-10 00:33:13,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:13,368 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 00:33:13,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash 14118, now seen corresponding path program 1 times [2024-02-10 00:33:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20749648] [2024-02-10 00:33:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:13,482 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 933 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:13,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 933 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:13,482 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-10 00:33:13,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:13,591 INFO L124 PetriNetUnfolderBase]: 160/1303 cut-off events. [2024-02-10 00:33:13,591 INFO L125 PetriNetUnfolderBase]: For 1981/2079 co-relation queries the response was YES. [2024-02-10 00:33:13,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1303 events. 160/1303 cut-off events. For 1981/2079 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11543 event pairs, 9 based on Foata normal form. 40/1246 useless extension candidates. Maximal degree in co-relation 2568. Up to 95 conditions per place. [2024-02-10 00:33:13,605 INFO L140 encePairwiseOnDemand]: 126/141 looper letters, 36 selfloop transitions, 39 changer transitions 0/189 dead transitions. [2024-02-10 00:33:13,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 189 transitions, 1088 flow [2024-02-10 00:33:13,606 INFO L231 Difference]: Finished difference. Result has 156 places, 179 transitions, 967 flow [2024-02-10 00:33:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:13,609 INFO L428 stractBuchiCegarLoop]: Abstraction has has 156 places, 179 transitions, 967 flow [2024-02-10 00:33:13,609 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-02-10 00:33:13,609 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 156 places, 179 transitions, 967 flow [2024-02-10 00:33:13,617 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:13,618 INFO L124 PetriNetUnfolderBase]: 0/71 cut-off events. [2024-02-10 00:33:13,618 INFO L125 PetriNetUnfolderBase]: For 130/134 co-relation queries the response was YES. [2024-02-10 00:33:13,618 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:13,620 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [346] L845-3-->L845-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] 354#[L845-4, $Ultimate##0]true [272] L845-4-->L846: 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] 356#[$Ultimate##0, L846]true [257] L846-->L846-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] 358#[$Ultimate##0, L846-1]true [250] L846-1-->L846-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 360#[L846-2, $Ultimate##0]true [271] L846-2-->L846-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} AuxVars[] AssignedVars[#memory_int] 362#[L846-3, $Ultimate##0]true [482] L846-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_8|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_30|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~x2~0#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_~y2~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_#res#1.base] 364#[L846-4, $Ultimate##0, $Ultimate##0]true [384] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 366#[L846-4, $Ultimate##0, $Ultimate##3]true [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 368#[L823-1, L846-4, $Ultimate##0]true [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 371#[L846-4, $Ultimate##0, L775]true [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 373#[L846-4, $Ultimate##0, L777]true [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 375#[L846-4, $Ultimate##0, L780]true [399] L780-->L783: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 377#[L846-4, $Ultimate##0, L783]true [404] L783-->L798: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_5| 0) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_5|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_5|} AuxVars[] AssignedVars[] 485#[L846-4, $Ultimate##0, L798]true [408] L798-->L800: Formula: (= 2 v_~y~0_5) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] 487#[L800, L846-4, $Ultimate##0]true [410] L800-->L803: Formula: (= |v_thr2Thread1of1ForFork0_~x2~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~x2~0#1] 489#[L803, L846-4, $Ultimate##0]true [414] L803-->L805: Formula: (not (= |v_thr2Thread1of1ForFork0_~x2~0#1_3| 2)) InVars {thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_3|} OutVars{thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_3|} AuxVars[] AssignedVars[] 491#[L846-4, $Ultimate##0, L805]true [417] L805-->L807: Formula: (= v_~b2~0_4 0) InVars {} OutVars{~b2~0=v_~b2~0_4} AuxVars[] AssignedVars[~b2~0] 493#[L846-4, $Ultimate##0, L807]true [418] L807-->L814: Formula: (= v_~b1~0_1 |v_thr2Thread1of1ForFork0_~b12~0#1_1|) InVars {~b1~0=v_~b1~0_1} OutVars{~b1~0=v_~b1~0_1, thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0#1] 495#[L814, L846-4, $Ultimate##0]true [2024-02-10 00:33:13,620 INFO L750 eck$LassoCheckResult]: Loop: 495#[L814, L846-4, $Ultimate##0]true [419] L814-->L812: Formula: (<= 1 |v_thr2Thread1of1ForFork0_~b12~0#1_3|) InVars {thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_3|} OutVars{thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_3|} AuxVars[] AssignedVars[] 498#[L846-4, $Ultimate##0, L812]true [422] L812-->L814: Formula: (= v_~b1~0_2 |v_thr2Thread1of1ForFork0_~b12~0#1_7|) InVars {~b1~0=v_~b1~0_2} OutVars{~b1~0=v_~b1~0_2, thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0#1] 495#[L814, L846-4, $Ultimate##0]true [2024-02-10 00:33:13,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 656098880, now seen corresponding path program 1 times [2024-02-10 00:33:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594970893] [2024-02-10 00:33:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:13,666 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:13,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:13,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594970893] [2024-02-10 00:33:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594970893] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:13,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:13,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407280622] [2024-02-10 00:33:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:13,667 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-10 00:33:13,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 14372, now seen corresponding path program 1 times [2024-02-10 00:33:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600975948] [2024-02-10 00:33:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:13,729 INFO L175 Difference]: Start difference. First operand has 156 places, 179 transitions, 967 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:13,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 179 transitions, 967 flow. Second operand 5 states and 705 transitions. [2024-02-10 00:33:13,730 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2024-02-10 00:33:13,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:13,826 INFO L124 PetriNetUnfolderBase]: 79/792 cut-off events. [2024-02-10 00:33:13,826 INFO L125 PetriNetUnfolderBase]: For 1055/1075 co-relation queries the response was YES. [2024-02-10 00:33:13,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 792 events. 79/792 cut-off events. For 1055/1075 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6181 event pairs, 1 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 1522. Up to 49 conditions per place. [2024-02-10 00:33:13,833 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 10 selfloop transitions, 7 changer transitions 0/182 dead transitions. [2024-02-10 00:33:13,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 182 transitions, 973 flow [2024-02-10 00:33:13,834 INFO L231 Difference]: Finished difference. Result has 164 places, 180 transitions, 973 flow [2024-02-10 00:33:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:13,836 INFO L428 stractBuchiCegarLoop]: Abstraction has has 164 places, 180 transitions, 973 flow [2024-02-10 00:33:13,836 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-02-10 00:33:13,837 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 164 places, 180 transitions, 973 flow [2024-02-10 00:33:13,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:13,854 INFO L124 PetriNetUnfolderBase]: 5/162 cut-off events. [2024-02-10 00:33:13,854 INFO L125 PetriNetUnfolderBase]: For 443/452 co-relation queries the response was YES. [2024-02-10 00:33:13,855 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:13,858 INFO L748 eck$LassoCheckResult]: Stem: 124#[$Ultimate##0]true [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 126#[L-1]true [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 128#[L12]true [320] 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[] 130#[L12-1]true [338] 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[] 132#[L12-2]true [336] 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[] 134#[L12-3]true [361] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 10) (= (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[] 136#[L12-4]true [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 138#[L700]true [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 140#[L701]true [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 142#[L701-1]true [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 144#[L702]true [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 146#[L-1-1]true [371] 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] 148#[L-1-2]true [373] L-1-2-->L844: Formula: true InVars {} OutVars{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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_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_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 150#[L844]true [310] L844-->L844-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 152#[L844-1]true [294] L844-1-->L844-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 154#[L844-2]true [330] L844-2-->L845: 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] 156#[L845]true [358] L845-->L845-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 158#[L845-1]true [258] L845-1-->L845-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|))) InVars {#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #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_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 160#[L845-2]true [485] L845-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_~b21~0#1=|v_thr1Thread1of1ForFork1_~b21~0#1_12|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~x1~0#1=|v_thr1Thread1of1ForFork1_~x1~0#1_8|, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_30|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~b21~0#1, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~x1~0#1, thr1Thread1of1ForFork1_~y1~0#1, thr1Thread1of1ForFork1_~_#1.base] 162#[$Ultimate##0, L845-3]true [432] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 164#[$Ultimate##3, L845-3]true [346] L845-3-->L845-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] 536#[L845-4, $Ultimate##3]true [272] L845-4-->L846: 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] 538#[$Ultimate##3, L846]true [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 540#[L753-1, L846]true [257] L846-->L846-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] 542#[L753-1, L846-1]true [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 544#[L705, L846-1]true [250] L846-1-->L846-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 546#[L846-2, L705]true [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 548#[L846-2, L707]true [271] L846-2-->L846-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #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_3|} AuxVars[] AssignedVars[#memory_int] 550#[L846-3, L707]true [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 552#[L846-3, L710]true [482] L846-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{thr2Thread1of1ForFork0_~b12~0#1=|v_thr2Thread1of1ForFork0_~b12~0#1_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~x2~0#1=|v_thr2Thread1of1ForFork0_~x2~0#1_8|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_30|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~x2~0#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_~y2~0#1, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_#res#1.base] 554#[L846-4, L710, $Ultimate##0]true [447] L710-->L713: Formula: (= v_~y~0_15 |v_thr1Thread1of1ForFork1_~y1~0#1_1|) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15, thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0#1] 556#[L846-4, $Ultimate##0, L713]true [384] $Ultimate##0-->$Ultimate##3: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 558#[L846-4, $Ultimate##3, L713]true [452] L713-->L728: Formula: (= |v_thr1Thread1of1ForFork1_~y1~0#1_5| 0) InVars {thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_5|} OutVars{thr1Thread1of1ForFork1_~y1~0#1=|v_thr1Thread1of1ForFork1_~y1~0#1_5|} AuxVars[] AssignedVars[] 560#[L728, L846-4, $Ultimate##3]true [456] L728-->L730: Formula: (= v_~y~0_10 1) InVars {} OutVars{~y~0=v_~y~0_10} AuxVars[] AssignedVars[~y~0] 562#[L846-4, $Ultimate##3, L730]true [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 564#[L823-1, L846-4, L730]true [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 566#[L846-4, L775, L730]true [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 568#[L846-4, L777, L730]true [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 570#[L846-4, L780, L730]true [399] L780-->L783: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 572#[L846-4, L783, L730]true [403] L783-->L785: Formula: (not (= |v_thr2Thread1of1ForFork0_~y2~0#1_3| 0)) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_3|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_3|} AuxVars[] AssignedVars[] 574#[L846-4, L730, L785]true [407] L785-->L787: Formula: (= v_~b2~0_2 0) InVars {} OutVars{~b2~0=v_~b2~0_2} AuxVars[] AssignedVars[~b2~0] 576#[L787, L846-4, L730]true [409] L787-->L794: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_7| v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 578#[L794, L846-4, L730]true [2024-02-10 00:33:13,858 INFO L750 eck$LassoCheckResult]: Loop: 578#[L794, L846-4, L730]true [411] L794-->L792: Formula: (not (= |v_thr2Thread1of1ForFork0_~y2~0#1_9| 0)) InVars {thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_9|} OutVars{thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_9|} AuxVars[] AssignedVars[] 581#[L792, L846-4, L730]true [416] L792-->L794: Formula: (= |v_thr2Thread1of1ForFork0_~y2~0#1_13| v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, thr2Thread1of1ForFork0_~y2~0#1=|v_thr2Thread1of1ForFork0_~y2~0#1_13|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0#1] 578#[L794, L846-4, L730]true [2024-02-10 00:33:13,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1051425602, now seen corresponding path program 1 times [2024-02-10 00:33:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185999371] [2024-02-10 00:33:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:13,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash 14118, now seen corresponding path program 2 times [2024-02-10 00:33:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704199756] [2024-02-10 00:33:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:13,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1102675805, now seen corresponding path program 1 times [2024-02-10 00:33:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:13,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618509528] [2024-02-10 00:33:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:13,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:13,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:14,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:14,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:33:14 BoogieIcfgContainer [2024-02-10 00:33:14,849 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:33:14,849 INFO L158 Benchmark]: Toolchain (without parser) took 4921.55ms. Allocated memory was 195.0MB in the beginning and 358.6MB in the end (delta: 163.6MB). Free memory was 124.9MB in the beginning and 154.6MB in the end (delta: -29.7MB). Peak memory consumption was 134.7MB. Max. memory is 8.0GB. [2024-02-10 00:33:14,849 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:33:14,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.80ms. Allocated memory is still 195.0MB. Free memory was 124.9MB in the beginning and 104.3MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-02-10 00:33:14,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.19ms. Allocated memory is still 195.0MB. Free memory was 104.3MB in the beginning and 102.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:33:14,850 INFO L158 Benchmark]: Boogie Preprocessor took 64.90ms. Allocated memory was 195.0MB in the beginning and 255.9MB in the end (delta: 60.8MB). Free memory was 102.1MB in the beginning and 225.5MB in the end (delta: -123.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2024-02-10 00:33:14,850 INFO L158 Benchmark]: RCFGBuilder took 436.52ms. Allocated memory is still 255.9MB. Free memory was 225.5MB in the beginning and 209.3MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-02-10 00:33:14,850 INFO L158 Benchmark]: BuchiAutomizer took 3908.49ms. Allocated memory was 255.9MB in the beginning and 358.6MB in the end (delta: 102.8MB). Free memory was 209.3MB in the beginning and 154.6MB in the end (delta: 54.7MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. [2024-02-10 00:33:14,852 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.09ms. Allocated memory is still 195.0MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 452.80ms. Allocated memory is still 195.0MB. Free memory was 124.9MB in the beginning and 104.3MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.19ms. Allocated memory is still 195.0MB. Free memory was 104.3MB in the beginning and 102.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.90ms. Allocated memory was 195.0MB in the beginning and 255.9MB in the end (delta: 60.8MB). Free memory was 102.1MB in the beginning and 225.5MB in the end (delta: -123.4MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * RCFGBuilder took 436.52ms. Allocated memory is still 255.9MB. Free memory was 225.5MB in the beginning and 209.3MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3908.49ms. Allocated memory was 255.9MB in the beginning and 358.6MB in the end (delta: 102.8MB). Free memory was 209.3MB in the beginning and 154.6MB in the end (delta: 54.7MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 973 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:0. Analysis of lassos took 1.7s. Construction of modules took 0.5s. Büchi inclusion checks took 1.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, 1618 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1618 mSDsluCounter, 6778 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3796 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 964 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 2982 mSDtfsCounter, 964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN4 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: 791]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L700] 0 int x, y; VAL [x=0, y=0] [L701] 0 int b1, b2; VAL [b1=0, b2=0, x=0, y=0] [L702] 0 int X; VAL [X=0, b1=0, b2=0, x=0, y=0] [L844] 0 pthread_t t1, t2; VAL [X=0, b1=0, b2=0, t1={28245:0}, t2={28244:0}, x=0, y=0] [L845] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [X=0, b1=0, b2=0, pthread_create(&t1, 0, thr1, 0)=31299, t1={28245:0}, t2={28244:0}, x=0, y=0] [L704] COND TRUE 1 1 VAL [X=0, _={0:0}, _={0:0}, b1=0, b2=0, x=0, y=0] [L706] 1 b1 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=0, y=0] [L709] 1 x = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L846] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [X=0, b1=1, b2=0, pthread_create(&t2, 0, thr2, 0)=31300, t1={28245:0}, t2={28244:0}, x=1, y=0] [L712] 1 int y1 = y; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y1=0, y=0] [L714] COND FALSE 1 !(y1 != 0) VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y1=0, y=0] [L729] 1 y = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y1=0, y=1] [L774] COND TRUE 2 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=1] [L776] 2 b2 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=1, y=1] [L779] 2 x = 2 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y=1] [L782] 2 int y2 = y; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y2=1, y=1] [L784] COND TRUE 2 y2 != 0 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y2=1, y=1] [L786] 2 b2 = 0 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=2, y2=1, y=1] [L789] 2 y2 = y VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=2, y2=1, y=1] Loop: [L791] COND TRUE y2 != 0 [L793] y2 = y End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 791]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int x, y; VAL [x=0, y=0] [L701] 0 int b1, b2; VAL [b1=0, b2=0, x=0, y=0] [L702] 0 int X; VAL [X=0, b1=0, b2=0, x=0, y=0] [L844] 0 pthread_t t1, t2; VAL [X=0, b1=0, b2=0, t1={28245:0}, t2={28244:0}, x=0, y=0] [L845] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [X=0, b1=0, b2=0, pthread_create(&t1, 0, thr1, 0)=31299, t1={28245:0}, t2={28244:0}, x=0, y=0] [L704] COND TRUE 1 1 VAL [X=0, _={0:0}, _={0:0}, b1=0, b2=0, x=0, y=0] [L706] 1 b1 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=0, y=0] [L709] 1 x = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L846] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [X=0, b1=1, b2=0, pthread_create(&t2, 0, thr2, 0)=31300, t1={28245:0}, t2={28244:0}, x=1, y=0] [L712] 1 int y1 = y; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y1=0, y=0] [L714] COND FALSE 1 !(y1 != 0) VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y1=0, y=0] [L729] 1 y = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y1=0, y=1] [L774] COND TRUE 2 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=1] [L776] 2 b2 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=1, y=1] [L779] 2 x = 2 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y=1] [L782] 2 int y2 = y; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y2=1, y=1] [L784] COND TRUE 2 y2 != 0 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y2=1, y=1] [L786] 2 b2 = 0 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=2, y2=1, y=1] [L789] 2 y2 = y VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=2, y2=1, y=1] Loop: [L791] COND TRUE y2 != 0 [L793] y2 = y End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 00:33:14,933 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...