/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:58:08,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:58:08,853 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-09 23:58:08,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:58:08,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:58:08,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:58:08,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:58:08,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:58:08,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:58:08,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:58:08,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:58:08,893 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:58:08,893 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:58:08,893 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:58:08,893 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:58:08,894 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:58:08,894 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:58:08,894 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:58:08,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:58:08,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:58:08,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:58:08,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:58:08,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:58:08,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:58:08,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:58:08,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:58:08,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:58:08,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:58:08,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:58:08,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:58:08,905 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:58:08,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:58:08,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:58:08,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:58:08,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:58:08,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:58:08,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:58:08,906 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:58:08,907 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-09 23:58:09,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:58:09,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:58:09,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:58:09,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 23:58:09,234 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 23:58:09,236 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-09 23:58:10,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 23:58:10,589 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 23:58:10,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2024-02-09 23:58:10,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9db5415a/a3eb56626eab4b089e3eac27fe97eafb/FLAG966f0e399 [2024-02-09 23:58:10,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9db5415a/a3eb56626eab4b089e3eac27fe97eafb [2024-02-09 23:58:10,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:58:10,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-09 23:58:10,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 23:58:10,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 23:58:10,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 23:58:10,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df1f42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10, skipping insertion in model container [2024-02-09 23:58:10,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,663 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 23:58:10,825 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-09 23:58:10,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:58:10,997 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 23:58:11,006 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-09 23:58:11,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:58:11,079 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:58:11,080 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:58:11,080 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:58:11,085 INFO L206 MainTranslator]: Completed translation [2024-02-09 23:58:11,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11 WrapperNode [2024-02-09 23:58:11,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 23:58:11,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:58:11,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:58:11,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:58:11,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,141 INFO L138 Inliner]: procedures = 171, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 207 [2024-02-09 23:58:11,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:58:11,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:58:11,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:58:11,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:58:11,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:58:11,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:58:11,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:58:11,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:58:11,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (1/1) ... [2024-02-09 23:58:11,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:58:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:58:11,211 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-09 23:58:11,228 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-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-02-09 23:58:11,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-02-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-09 23:58:11,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-09 23:58:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-09 23:58:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-09 23:58:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-09 23:58:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-09 23:58:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:58:11,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:58:11,262 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:58:11,427 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:58:11,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:58:11,599 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:58:11,603 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:58:11,603 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2024-02-09 23:58:11,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:58:11 BoogieIcfgContainer [2024-02-09 23:58:11,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:58:11,606 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:58:11,607 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:58:11,609 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:58:11,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:58:11,610 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 11:58:10" (1/3) ... [2024-02-09 23:58:11,610 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46587575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:58:11, skipping insertion in model container [2024-02-09 23:58:11,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:58:11,610 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:11" (2/3) ... [2024-02-09 23:58:11,611 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46587575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:58:11, skipping insertion in model container [2024-02-09 23:58:11,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:58:11,611 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:58:11" (3/3) ... [2024-02-09 23:58:11,612 INFO L332 chiAutomizerObserver]: Analyzing ICFG lamport.i [2024-02-09 23:58:11,691 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:58:11,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 141 transitions, 296 flow [2024-02-09 23:58:11,742 INFO L124 PetriNetUnfolderBase]: 26/137 cut-off events. [2024-02-09 23:58:11,742 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:58:11,749 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-09 23:58:11,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 141 transitions, 296 flow [2024-02-09 23:58:11,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 137 transitions, 286 flow [2024-02-09 23:58:11,762 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:58:11,762 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:58:11,762 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:58:11,762 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:58:11,762 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:58:11,762 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:58:11,762 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:58:11,762 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:58:11,762 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:11,763 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 118 places, 137 transitions, 286 flow [2024-02-09 23:58:11,899 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 5537 states, 5536 states have (on average 3.341221098265896) internal successors, (18497), 5536 states have internal predecessors, (18497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:11,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5537 states, 5536 states have (on average 3.341221098265896) internal successors, (18497), 5536 states have internal predecessors, (18497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:12,119 INFO L131 ngComponentsAnalysis]: Automaton has 133 accepting balls. 4473 [2024-02-09 23:58:12,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:12,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:12,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:58:12,125 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:12,125 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 118 places, 137 transitions, 286 flow [2024-02-09 23:58:12,201 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 5537 states, 5536 states have (on average 3.341221098265896) internal successors, (18497), 5536 states have internal predecessors, (18497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:12,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5537 states, 5536 states have (on average 3.341221098265896) internal successors, (18497), 5536 states have internal predecessors, (18497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:12,310 INFO L131 ngComponentsAnalysis]: Automaton has 133 accepting balls. 4473 [2024-02-09 23:58:12,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:12,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:12,316 INFO L748 eck$LassoCheckResult]: Stem: Black: 11199#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 11202#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 11204#[L12]don't care [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[] 11206#[L12-1]don't care [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[] 11208#[L12-2]don't care [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[] 11210#[L12-3]don't care [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[] 11212#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 11214#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 11216#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 11218#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 11220#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 11222#[L-1-1]don't care [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] 11224#[L-1-2]don't care [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] 11226#[L844]don't care [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] 11228#[L844-1]don't care [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] 11230#[L844-2]don't care [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] 11232#[L845]don't care [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] 11234#[L845-1]don't care [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] 11236#[L845-2]don't care [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] 11238#[$Ultimate##0, L845-3]don't care [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] 11240#[L845-3, $Ultimate##3]don't care [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11246#[L753-1, L845-3]don't care [2024-02-09 23:58:12,316 INFO L750 eck$LassoCheckResult]: Loop: 11246#[L753-1, L845-3]don't care [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11256#[L705, L845-3]don't care [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 11272#[L707, L845-3]don't care [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 11294#[L710, L845-3]don't care [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] 11324#[L713, L845-3]don't care [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[] 11360#[L715, L845-3]don't care [455] L715-->L717: Formula: (= v_~b1~0_6 0) InVars {} OutVars{~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[~b1~0] 11404#[L717, L845-3]don't care [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] 11460#[L724, L845-3]don't care [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[] 11246#[L753-1, L845-3]don't care [2024-02-09 23:58:12,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1185385107, now seen corresponding path program 1 times [2024-02-09 23:58:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530347216] [2024-02-09 23:58:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:12,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2027716720, now seen corresponding path program 1 times [2024-02-09 23:58:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904951296] [2024-02-09 23:58:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:12,667 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-09 23:58:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904951296] [2024-02-09 23:58:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904951296] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425574154] [2024-02-09 23:58:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:12,673 INFO L765 eck$LassoCheckResult]: loop already infeasible [2024-02-09 23:58:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-09 23:58:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-09 23:58:12,943 INFO L175 Difference]: Start difference. First operand has 118 places, 137 transitions, 286 flow. Second operand 7 states and 987 transitions. [2024-02-09 23:58:12,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 137 transitions, 286 flow. Second operand 7 states and 987 transitions. [2024-02-09 23:58:12,949 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-09 23:58:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:13,081 INFO L124 PetriNetUnfolderBase]: 144/774 cut-off events. [2024-02-09 23:58:13,082 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-02-09 23:58:13,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 774 events. 144/774 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4947 event pairs, 1 based on Foata normal form. 188/838 useless extension candidates. Maximal degree in co-relation 869. Up to 37 conditions per place. [2024-02-09 23:58:13,095 INFO L140 encePairwiseOnDemand]: 110/141 looper letters, 32 selfloop transitions, 30 changer transitions 0/162 dead transitions. [2024-02-09 23:58:13,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 162 transitions, 460 flow [2024-02-09 23:58:13,097 INFO L231 Difference]: Finished difference. Result has 130 places, 151 transitions, 490 flow [2024-02-09 23:58:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-09 23:58:13,103 INFO L428 stractBuchiCegarLoop]: Abstraction has has 130 places, 151 transitions, 490 flow [2024-02-09 23:58:13,103 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:58:13,103 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:13,103 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 130 places, 151 transitions, 490 flow [2024-02-09 23:58:13,417 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 10403 states, 10390 states have (on average 2.8720885466794996) internal successors, (29841), 10402 states have internal predecessors, (29841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:13,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10403 states, 10390 states have (on average 2.8720885466794996) internal successors, (29841), 10402 states have internal predecessors, (29841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:13,578 INFO L131 ngComponentsAnalysis]: Automaton has 654 accepting balls. 6028 [2024-02-09 23:58:13,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:13,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:13,581 INFO L748 eck$LassoCheckResult]: Stem: Black: 22294#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 22297#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 22299#[L12]don't care [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[] 22301#[L12-1]don't care [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[] 22303#[L12-2]don't care [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[] 22305#[L12-3]don't care [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[] 22307#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 22309#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 22311#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 22313#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 22315#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 22317#[L-1-1]don't care [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] 22319#[L-1-2]don't care [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] 22321#[L844]don't care [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] 22323#[L844-1]don't care [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] 22325#[L844-2]don't care [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] 22327#[L845]don't care [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] 22329#[L845-1]don't care [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] 22331#[L845-2]don't care [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] 22333#[$Ultimate##0, L845-3]don't care [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] 22337#[$Ultimate##0, L845-4]don't care [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] 22343#[$Ultimate##0, L846]don't care [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] 22351#[L846-1, $Ultimate##0]don't care [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] 22361#[$Ultimate##0, L846-2]don't care [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] 22373#[$Ultimate##0, L846-3]don't care [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] 22387#[L846-4, $Ultimate##0, $Ultimate##0]don't care [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] 22407#[L846-4, $Ultimate##3, $Ultimate##0]don't care [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 22435#[L846-4, L823-1, $Ultimate##0]don't care [2024-02-09 23:58:13,582 INFO L750 eck$LassoCheckResult]: Loop: 22435#[L846-4, L823-1, $Ultimate##0]don't care [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 22473#[L775, L846-4, $Ultimate##0]don't care [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 22523#[L846-4, L777, $Ultimate##0]don't care [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 22583#[L846-4, L780, $Ultimate##0]don't care [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] 22655#[L783, L846-4, $Ultimate##0]don't care [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[] 22741#[L846-4, $Ultimate##0, L785]don't care [407] L785-->L787: Formula: (= v_~b2~0_2 0) InVars {} OutVars{~b2~0=v_~b2~0_2} AuxVars[] AssignedVars[~b2~0] 22847#[L846-4, L787, $Ultimate##0]don't care [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] 22975#[L846-4, $Ultimate##0, L794]don't care [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[] 22435#[L846-4, L823-1, $Ultimate##0]don't care [2024-02-09 23:58:13,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2079341359, now seen corresponding path program 1 times [2024-02-09 23:58:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722790992] [2024-02-09 23:58:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:13,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:13,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:13,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1093310352, now seen corresponding path program 1 times [2024-02-09 23:58:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260264321] [2024-02-09 23:58:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:13,747 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-09 23:58:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260264321] [2024-02-09 23:58:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260264321] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:13,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:13,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509540638] [2024-02-09 23:58:13,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:13,751 INFO L765 eck$LassoCheckResult]: loop already infeasible [2024-02-09 23:58:13,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:13,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-09 23:58:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-09 23:58:13,996 INFO L175 Difference]: Start difference. First operand has 130 places, 151 transitions, 490 flow. Second operand 7 states and 987 transitions. [2024-02-09 23:58:13,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 151 transitions, 490 flow. Second operand 7 states and 987 transitions. [2024-02-09 23:58:13,998 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-09 23:58:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:14,105 INFO L124 PetriNetUnfolderBase]: 163/1166 cut-off events. [2024-02-09 23:58:14,106 INFO L125 PetriNetUnfolderBase]: For 390/424 co-relation queries the response was YES. [2024-02-09 23:58:14,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 1166 events. 163/1166 cut-off events. For 390/424 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9523 event pairs, 3 based on Foata normal form. 13/1065 useless extension candidates. Maximal degree in co-relation 1701. Up to 76 conditions per place. [2024-02-09 23:58:14,121 INFO L140 encePairwiseOnDemand]: 124/141 looper letters, 38 selfloop transitions, 49 changer transitions 0/204 dead transitions. [2024-02-09 23:58:14,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 204 transitions, 861 flow [2024-02-09 23:58:14,124 INFO L231 Difference]: Finished difference. Result has 140 places, 190 transitions, 863 flow [2024-02-09 23:58:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-09 23:58:14,126 INFO L428 stractBuchiCegarLoop]: Abstraction has has 140 places, 190 transitions, 863 flow [2024-02-09 23:58:14,127 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:58:14,127 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:14,130 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 140 places, 190 transitions, 863 flow [2024-02-09 23:58:14,670 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 14763 states, 14731 states have (on average 2.777068766546738) internal successors, (40909), 14762 states have internal predecessors, (40909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:14,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14763 states, 14731 states have (on average 2.777068766546738) internal successors, (40909), 14762 states have internal predecessors, (40909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:14,829 INFO L131 ngComponentsAnalysis]: Automaton has 1380 accepting balls. 2832 [2024-02-09 23:58:14,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:14,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:14,831 INFO L748 eck$LassoCheckResult]: Stem: Black: 43119#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 43122#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 43124#[L12]don't care [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[] 43126#[L12-1]don't care [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[] 43128#[L12-2]don't care [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[] 43130#[L12-3]don't care [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[] 43132#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 43134#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 43136#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 43138#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 43140#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 43142#[L-1-1]don't care [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] 43144#[L-1-2]don't care [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] 43146#[L844]don't care [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] 43148#[L844-1]don't care [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] 43150#[L844-2]don't care [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] 43152#[L845]don't care [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] 43154#[L845-1]don't care [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] 43156#[L845-2]don't care [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] 43158#[L845-3, $Ultimate##0]don't care [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] 43162#[$Ultimate##3, L845-3]don't care [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43168#[L753-1, L845-3]don't care [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 43176#[L705, L845-3]don't care [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 43186#[L707, L845-3]don't care [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 43198#[L710, L845-3]don't care [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] 43212#[L713, L845-3]don't care [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[] 43230#[L715, L845-3]don't care [455] L715-->L717: Formula: (= v_~b1~0_6 0) InVars {} OutVars{~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[~b1~0] 43258#[L717, L845-3]don't care [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] 43296#[L724, L845-3]don't care [2024-02-09 23:58:14,831 INFO L750 eck$LassoCheckResult]: Loop: 43296#[L724, L845-3]don't care [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[] 43344#[L845-3, L722]don't care [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] 43296#[L724, L845-3]don't care [2024-02-09 23:58:14,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -667945488, now seen corresponding path program 1 times [2024-02-09 23:58:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194992912] [2024-02-09 23:58:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:14,875 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-09 23:58:14,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:14,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194992912] [2024-02-09 23:58:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194992912] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890904913] [2024-02-09 23:58:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:14,876 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-09 23:58:14,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 15654, now seen corresponding path program 1 times [2024-02-09 23:58:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507879012] [2024-02-09 23:58:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:14,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:14,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:58:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:58:14,989 INFO L175 Difference]: Start difference. First operand has 140 places, 190 transitions, 863 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:14,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 190 transitions, 863 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:14,990 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-09 23:58:14,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:15,051 INFO L124 PetriNetUnfolderBase]: 131/938 cut-off events. [2024-02-09 23:58:15,051 INFO L125 PetriNetUnfolderBase]: For 979/1096 co-relation queries the response was YES. [2024-02-09 23:58:15,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 938 events. 131/938 cut-off events. For 979/1096 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7260 event pairs, 4 based on Foata normal form. 37/894 useless extension candidates. Maximal degree in co-relation 1733. Up to 64 conditions per place. [2024-02-09 23:58:15,059 INFO L140 encePairwiseOnDemand]: 126/141 looper letters, 33 selfloop transitions, 37 changer transitions 0/188 dead transitions. [2024-02-09 23:58:15,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 188 transitions, 991 flow [2024-02-09 23:58:15,060 INFO L231 Difference]: Finished difference. Result has 144 places, 182 transitions, 891 flow [2024-02-09 23:58:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:58:15,061 INFO L428 stractBuchiCegarLoop]: Abstraction has has 144 places, 182 transitions, 891 flow [2024-02-09 23:58:15,061 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:58:15,061 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:15,062 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 144 places, 182 transitions, 891 flow [2024-02-09 23:58:15,573 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 13747 states, 13717 states have (on average 2.760297441131443) internal successors, (37863), 13746 states have internal predecessors, (37863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:15,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13747 states, 13717 states have (on average 2.760297441131443) internal successors, (37863), 13746 states have internal predecessors, (37863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:15,733 INFO L131 ngComponentsAnalysis]: Automaton has 1226 accepting balls. 2516 [2024-02-09 23:58:15,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:15,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:15,735 INFO L748 eck$LassoCheckResult]: Stem: Black: 72656#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 72659#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 72661#[L12]don't care [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[] 72663#[L12-1]don't care [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[] 72665#[L12-2]don't care [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[] 72667#[L12-3]don't care [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[] 72669#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 72671#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 72673#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 72675#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 72677#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 72679#[L-1-1]don't care [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] 72681#[L-1-2]don't care [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] 72683#[L844]don't care [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] 72685#[L844-1]don't care [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] 72687#[L844-2]don't care [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] 72689#[L845]don't care [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] 72691#[L845-1]don't care [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] 72693#[L845-2]don't care [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] 72695#[$Ultimate##0, L845-3]don't care [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] 72699#[L845-3, $Ultimate##3]don't care [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 72705#[L753-1, L845-3]don't care [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 72713#[L705, L845-3]don't care [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 72723#[L845-3, L707]don't care [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 72735#[L710, L845-3]don't care [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] 72749#[L713, L845-3]don't care [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[] 72767#[L728, L845-3]don't care [456] L728-->L730: Formula: (= v_~y~0_10 1) InVars {} OutVars{~y~0=v_~y~0_10} AuxVars[] AssignedVars[~y~0] 72791#[L845-3, L730]don't care [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] 72823#[L845-3, L733]don't care [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[] 72863#[L845-3, L735]don't care [465] L735-->L737: Formula: (= v_~b1~0_4 0) InVars {} OutVars{~b1~0=v_~b1~0_4} AuxVars[] AssignedVars[~b1~0] 72915#[L845-3, L737]don't care [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] 72977#[L845-3, L744]don't care [2024-02-09 23:58:15,735 INFO L750 eck$LassoCheckResult]: Loop: 72977#[L845-3, L744]don't care [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[] 73055#[L742, L845-3]don't care [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] 72977#[L845-3, L744]don't care [2024-02-09 23:58:15,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash -150509314, now seen corresponding path program 1 times [2024-02-09 23:58:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:15,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192195520] [2024-02-09 23:58:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:15,800 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-09 23:58:15,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:15,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192195520] [2024-02-09 23:58:15,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192195520] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711905532] [2024-02-09 23:58:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:15,801 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-09 23:58:15,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash 15908, now seen corresponding path program 1 times [2024-02-09 23:58:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452577460] [2024-02-09 23:58:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:15,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:15,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:58:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:58:15,861 INFO L175 Difference]: Start difference. First operand has 144 places, 182 transitions, 891 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:15,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 182 transitions, 891 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:15,862 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2024-02-09 23:58:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:15,937 INFO L124 PetriNetUnfolderBase]: 157/1226 cut-off events. [2024-02-09 23:58:15,938 INFO L125 PetriNetUnfolderBase]: For 1079/1118 co-relation queries the response was YES. [2024-02-09 23:58:15,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 1226 events. 157/1226 cut-off events. For 1079/1118 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10500 event pairs, 0 based on Foata normal form. 6/1134 useless extension candidates. Maximal degree in co-relation 2204. Up to 73 conditions per place. [2024-02-09 23:58:15,948 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 9 selfloop transitions, 5 changer transitions 0/189 dead transitions. [2024-02-09 23:58:15,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 189 transitions, 933 flow [2024-02-09 23:58:15,949 INFO L231 Difference]: Finished difference. Result has 152 places, 187 transitions, 935 flow [2024-02-09 23:58:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:58:15,951 INFO L428 stractBuchiCegarLoop]: Abstraction has has 152 places, 187 transitions, 935 flow [2024-02-09 23:58:15,951 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-09 23:58:15,951 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:15,951 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 152 places, 187 transitions, 935 flow [2024-02-09 23:58:16,541 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 18206 states, 18162 states have (on average 2.742043827772272) internal successors, (49801), 18205 states have internal predecessors, (49801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:16,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18206 states, 18162 states have (on average 2.742043827772272) internal successors, (49801), 18205 states have internal predecessors, (49801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:16,881 INFO L131 ngComponentsAnalysis]: Automaton has 1517 accepting balls. 3114 [2024-02-09 23:58:16,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:16,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:16,884 INFO L748 eck$LassoCheckResult]: Stem: Black: 100165#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 100168#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 100170#[L12]don't care [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[] 100172#[L12-1]don't care [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[] 100174#[L12-2]don't care [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[] 100176#[L12-3]don't care [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[] 100178#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 100180#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 100182#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 100184#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 100186#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 100188#[L-1-1]don't care [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] 100190#[L-1-2]don't care [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] 100192#[L844]don't care [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] 100194#[L844-1]don't care [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] 100196#[L844-2]don't care [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] 100198#[L845]don't care [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] 100200#[L845-1]don't care [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] 100202#[L845-2]don't care [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] 100204#[L845-3, $Ultimate##0]don't care [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] 100206#[L845-4, $Ultimate##0]don't care [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] 100210#[$Ultimate##0, L846]don't care [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] 100216#[L846-1, $Ultimate##0]don't care [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] 100224#[$Ultimate##0, L846-2]don't care [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] 100234#[L846-3, $Ultimate##0]don't care [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] 100248#[$Ultimate##0, L846-4, $Ultimate##0]don't care [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] 100266#[$Ultimate##0, $Ultimate##3, L846-4]don't care [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 100290#[$Ultimate##0, L823-1, L846-4]don't care [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 100322#[$Ultimate##0, L775, L846-4]don't care [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 100362#[$Ultimate##0, L846-4, L777]don't care [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 100410#[$Ultimate##0, L846-4, L780]don't care [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] 100466#[L846-4, L783, $Ultimate##0]don't care [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[] 100532#[L846-4, L785, $Ultimate##0]don't care [407] L785-->L787: Formula: (= v_~b2~0_2 0) InVars {} OutVars{~b2~0=v_~b2~0_2} AuxVars[] AssignedVars[~b2~0] 100614#[L787, L846-4, $Ultimate##0]don't care [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] 100712#[L846-4, $Ultimate##0, L794]don't care [2024-02-09 23:58:16,884 INFO L750 eck$LassoCheckResult]: Loop: 100712#[L846-4, $Ultimate##0, L794]don't care [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[] 100828#[L846-4, L792, $Ultimate##0]don't care [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] 100712#[L846-4, $Ultimate##0, L794]don't care [2024-02-09 23:58:16,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 236315582, now seen corresponding path program 1 times [2024-02-09 23:58:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644580285] [2024-02-09 23:58:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:16,970 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-09 23:58:16,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:16,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644580285] [2024-02-09 23:58:16,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644580285] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:16,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:16,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:16,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759289129] [2024-02-09 23:58:16,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:16,971 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-09 23:58:16,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 14118, now seen corresponding path program 1 times [2024-02-09 23:58:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120830200] [2024-02-09 23:58:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:16,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:16,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:17,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:58:17,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:58:17,138 INFO L175 Difference]: Start difference. First operand has 152 places, 187 transitions, 935 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:17,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 187 transitions, 935 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:17,138 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2024-02-09 23:58:17,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:17,350 INFO L124 PetriNetUnfolderBase]: 160/1303 cut-off events. [2024-02-09 23:58:17,350 INFO L125 PetriNetUnfolderBase]: For 1981/2089 co-relation queries the response was YES. [2024-02-09 23:58:17,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 1303 events. 160/1303 cut-off events. For 1981/2089 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11548 event pairs, 9 based on Foata normal form. 40/1246 useless extension candidates. Maximal degree in co-relation 2570. Up to 95 conditions per place. [2024-02-09 23:58:17,386 INFO L140 encePairwiseOnDemand]: 126/141 looper letters, 36 selfloop transitions, 39 changer transitions 0/189 dead transitions. [2024-02-09 23:58:17,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 189 transitions, 1090 flow [2024-02-09 23:58:17,387 INFO L231 Difference]: Finished difference. Result has 156 places, 179 transitions, 969 flow [2024-02-09 23:58:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:58:17,388 INFO L428 stractBuchiCegarLoop]: Abstraction has has 156 places, 179 transitions, 969 flow [2024-02-09 23:58:17,388 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-02-09 23:58:17,388 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:17,388 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 156 places, 179 transitions, 969 flow [2024-02-09 23:58:18,117 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 16777 states, 16736 states have (on average 2.7252629063097515) internal successors, (45610), 16776 states have internal predecessors, (45610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:18,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16777 states, 16736 states have (on average 2.7252629063097515) internal successors, (45610), 16776 states have internal predecessors, (45610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:18,257 INFO L131 ngComponentsAnalysis]: Automaton has 1327 accepting balls. 2734 [2024-02-09 23:58:18,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:18,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:18,258 INFO L748 eck$LassoCheckResult]: Stem: Black: 136588#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 136591#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 136593#[L12]don't care [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[] 136595#[L12-1]don't care [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[] 136597#[L12-2]don't care [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[] 136599#[L12-3]don't care [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[] 136601#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 136603#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 136605#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 136607#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 136609#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 136611#[L-1-1]don't care [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] 136613#[L-1-2]don't care [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] 136615#[L844]don't care [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] 136617#[L844-1]don't care [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] 136619#[L844-2]don't care [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] 136621#[L845]don't care [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] 136623#[L845-1]don't care [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] 136625#[L845-2]don't care [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] 136627#[$Ultimate##0, L845-3]don't care [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] 136629#[$Ultimate##0, L845-4]don't care [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] 136633#[$Ultimate##0, L846]don't care [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] 136639#[L846-1, $Ultimate##0]don't care [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] 136647#[$Ultimate##0, L846-2]don't care [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] 136657#[$Ultimate##0, L846-3]don't care [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] 136671#[L846-4, $Ultimate##0, $Ultimate##0]don't care [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] 136689#[L846-4, $Ultimate##3, $Ultimate##0]don't care [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 136713#[L846-4, $Ultimate##0, L823-1]don't care [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 136745#[L846-4, $Ultimate##0, L775]don't care [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 136785#[L846-4, L777, $Ultimate##0]don't care [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 136833#[L846-4, $Ultimate##0, L780]don't care [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] 136889#[$Ultimate##0, L783, L846-4]don't care [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[] 136955#[$Ultimate##0, L798, L846-4]don't care [408] L798-->L800: Formula: (= 2 v_~y~0_5) InVars {} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[~y~0] 137031#[L846-4, $Ultimate##0, L800]don't care [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] 137117#[L846-4, $Ultimate##0, L803]don't care [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[] 137213#[L846-4, L805, $Ultimate##0]don't care [417] L805-->L807: Formula: (= v_~b2~0_4 0) InVars {} OutVars{~b2~0=v_~b2~0_4} AuxVars[] AssignedVars[~b2~0] 137329#[L846-4, $Ultimate##0, L807]don't care [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] 137463#[L846-4, L814, $Ultimate##0]don't care [2024-02-09 23:58:18,258 INFO L750 eck$LassoCheckResult]: Loop: 137463#[L846-4, L814, $Ultimate##0]don't care [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[] 137627#[L846-4, L812, $Ultimate##0]don't care [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] 137463#[L846-4, L814, $Ultimate##0]don't care [2024-02-09 23:58:18,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash 656098880, now seen corresponding path program 1 times [2024-02-09 23:58:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636905801] [2024-02-09 23:58:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:18,308 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-09 23:58:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636905801] [2024-02-09 23:58:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636905801] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:18,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436453578] [2024-02-09 23:58:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:18,309 INFO L753 eck$LassoCheckResult]: stem already infeasible [2024-02-09 23:58:18,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 14372, now seen corresponding path program 1 times [2024-02-09 23:58:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:18,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865523239] [2024-02-09 23:58:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:18,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:58:18,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:58:18,364 INFO L175 Difference]: Start difference. First operand has 156 places, 179 transitions, 969 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:18,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 179 transitions, 969 flow. Second operand 5 states and 705 transitions. [2024-02-09 23:58:18,364 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2024-02-09 23:58:18,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:18,417 INFO L124 PetriNetUnfolderBase]: 79/792 cut-off events. [2024-02-09 23:58:18,417 INFO L125 PetriNetUnfolderBase]: For 1047/1067 co-relation queries the response was YES. [2024-02-09 23:58:18,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 792 events. 79/792 cut-off events. For 1047/1067 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6189 event pairs, 1 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 1524. Up to 49 conditions per place. [2024-02-09 23:58:18,421 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 10 selfloop transitions, 7 changer transitions 0/182 dead transitions. [2024-02-09 23:58:18,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 182 transitions, 975 flow [2024-02-09 23:58:18,422 INFO L231 Difference]: Finished difference. Result has 164 places, 180 transitions, 975 flow [2024-02-09 23:58:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:58:18,424 INFO L428 stractBuchiCegarLoop]: Abstraction has has 164 places, 180 transitions, 975 flow [2024-02-09 23:58:18,424 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-02-09 23:58:18,424 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:18,424 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 164 places, 180 transitions, 975 flow [2024-02-09 23:58:18,814 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 10051 states, 10025 states have (on average 2.650374064837905) internal successors, (26570), 10050 states have internal predecessors, (26570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:18,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10051 states, 10025 states have (on average 2.650374064837905) internal successors, (26570), 10050 states have internal predecessors, (26570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:58:18,894 INFO L131 ngComponentsAnalysis]: Automaton has 577 accepting balls. 1186 [2024-02-09 23:58:18,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:18,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:18,900 INFO L748 eck$LassoCheckResult]: Stem: Black: 170157#[$Ultimate##0]don't care [273] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 170160#[L-1]don't care [280] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 170162#[L12]don't care [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[] 170164#[L12-1]don't care [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[] 170166#[L12-2]don't care [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[] 170168#[L12-3]don't care [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[] 170170#[L12-4]don't care [354] L12-4-->L700: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 170172#[L700]don't care [296] L700-->L701: Formula: (= v_~y~0_17 0) InVars {} OutVars{~y~0=v_~y~0_17} AuxVars[] AssignedVars[~y~0] 170174#[L701]don't care [366] L701-->L701-1: Formula: (= v_~b1~0_7 0) InVars {} OutVars{~b1~0=v_~b1~0_7} AuxVars[] AssignedVars[~b1~0] 170176#[L701-1]don't care [261] L701-1-->L702: Formula: (= v_~b2~0_7 0) InVars {} OutVars{~b2~0=v_~b2~0_7} AuxVars[] AssignedVars[~b2~0] 170178#[L702]don't care [266] L702-->L-1-1: Formula: (= v_~X~0_7 0) InVars {} OutVars{~X~0=v_~X~0_7} AuxVars[] AssignedVars[~X~0] 170180#[L-1-1]don't care [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] 170182#[L-1-2]don't care [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] 170184#[L844]don't care [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] 170186#[L844-1]don't care [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] 170188#[L844-2]don't care [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] 170190#[L845]don't care [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] 170192#[L845-1]don't care [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] 170194#[L845-2]don't care [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] 170196#[$Ultimate##0, L845-3]don't care [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] 170200#[$Ultimate##3, L845-3]don't care [434] $Ultimate##3-->L753-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 170206#[L753-1, L845-3]don't care [436] L753-1-->L705: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 170214#[L705, L845-3]don't care [440] L705-->L707: Formula: (= v_~b1~0_5 1) InVars {} OutVars{~b1~0=v_~b1~0_5} AuxVars[] AssignedVars[~b1~0] 170224#[L707, L845-3]don't care [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] 170234#[L707, L845-4]don't care [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] 170246#[L707, L846]don't care [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] 170262#[L707, L846-1]don't care [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] 170284#[L707, L846-2]don't care [443] L707-->L710: Formula: (= v_~x~0_4 1) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] 170316#[L710, L846-2]don't care [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] 170346#[L710, L846-3]don't care [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] 170392#[L710, $Ultimate##0, L846-4]don't care [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] 170446#[$Ultimate##3, L710, L846-4]don't care [386] $Ultimate##3-->L823-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 170510#[L823-1, L710, L846-4]don't care [388] L823-1-->L775: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 170584#[L775, L710, L846-4]don't care [392] L775-->L777: Formula: (= v_~b2~0_1 1) InVars {} OutVars{~b2~0=v_~b2~0_1} AuxVars[] AssignedVars[~b2~0] 170668#[L710, L777, L846-4]don't care [395] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 170762#[L710, L846-4, L780]don't care [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] 170868#[L713, L846-4, L780]don't care [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[] 170986#[L728, L846-4, L780]don't care [456] L728-->L730: Formula: (= v_~y~0_10 1) InVars {} OutVars{~y~0=v_~y~0_10} AuxVars[] AssignedVars[~y~0] 171124#[L730, L846-4, L780]don't care [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] 171294#[L733, L846-4, L780]don't care [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[] 171516#[L735, L846-4, L780]don't care [465] L735-->L737: Formula: (= v_~b1~0_4 0) InVars {} OutVars{~b1~0=v_~b1~0_4} AuxVars[] AssignedVars[~b1~0] 171802#[L737, L846-4, L780]don't care [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] 172164#[L846-4, L744, L780]don't care [2024-02-09 23:58:18,900 INFO L750 eck$LassoCheckResult]: Loop: 172164#[L846-4, L744, L780]don't care [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[] 172610#[L742, L846-4, L780]don't care [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] 172164#[L846-4, L744, L780]don't care [2024-02-09 23:58:18,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash -569087887, now seen corresponding path program 1 times [2024-02-09 23:58:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342000099] [2024-02-09 23:58:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:18,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash 15908, now seen corresponding path program 2 times [2024-02-09 23:58:18,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:18,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844040106] [2024-02-09 23:58:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:18,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1432597868, now seen corresponding path program 1 times [2024-02-09 23:58:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119401684] [2024-02-09 23:58:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:18,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:19,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:19,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:58:19 BoogieIcfgContainer [2024-02-09 23:58:19,909 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:58:19,909 INFO L158 Benchmark]: Toolchain (without parser) took 9290.20ms. Allocated memory was 261.1MB in the beginning and 984.6MB in the end (delta: 723.5MB). Free memory was 191.3MB in the beginning and 662.7MB in the end (delta: -471.4MB). Peak memory consumption was 252.9MB. Max. memory is 8.0GB. [2024-02-09 23:58:19,909 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:58:19,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.79ms. Allocated memory is still 261.1MB. Free memory was 191.1MB in the beginning and 221.1MB in the end (delta: -30.0MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2024-02-09 23:58:19,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.78ms. Allocated memory is still 261.1MB. Free memory was 221.1MB in the beginning and 219.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:58:19,910 INFO L158 Benchmark]: Boogie Preprocessor took 21.50ms. Allocated memory is still 261.1MB. Free memory was 219.1MB in the beginning and 217.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:58:19,910 INFO L158 Benchmark]: RCFGBuilder took 440.71ms. Allocated memory is still 261.1MB. Free memory was 217.0MB in the beginning and 201.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-02-09 23:58:19,911 INFO L158 Benchmark]: BuchiAutomizer took 8302.29ms. Allocated memory was 261.1MB in the beginning and 984.6MB in the end (delta: 723.5MB). Free memory was 200.8MB in the beginning and 662.7MB in the end (delta: -461.9MB). Peak memory consumption was 262.2MB. Max. memory is 8.0GB. [2024-02-09 23:58:19,912 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.16ms. Allocated memory is still 151.0MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 465.79ms. Allocated memory is still 261.1MB. Free memory was 191.1MB in the beginning and 221.1MB in the end (delta: -30.0MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.78ms. Allocated memory is still 261.1MB. Free memory was 221.1MB in the beginning and 219.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.50ms. Allocated memory is still 261.1MB. Free memory was 219.1MB in the beginning and 217.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 440.71ms. Allocated memory is still 261.1MB. Free memory was 217.0MB in the beginning and 201.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 8302.29ms. Allocated memory was 261.1MB in the beginning and 984.6MB in the end (delta: 723.5MB). Free memory was 200.8MB in the beginning and 662.7MB in the end (delta: -461.9MB). Peak memory consumption was 262.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 975 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 7 iterations. TraceHistogramMax:0. Analysis of lassos took 1.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. 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.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1618 mSDsluCounter, 6778 SdHoareTripleChecker+Invalid, 0.5s 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: 741]: 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={11913:0}, t2={11914: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)=27725, t1={11913:0}, t2={11914: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)=27726, t1={11913:0}, t2={11914:0}, x=1, y=0] [L774] COND TRUE 2 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L776] 2 b2 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=1, y=0] [L779] 2 x = 2 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] [L712] 1 int y1 = y; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y1=0, y=0] [L714] COND FALSE 1 !(y1 != 0) VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y1=0, y=0] [L729] 1 y = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y1=0, y=1] [L732] 1 int x1 = x; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x1=2, x=2, y1=0, y=1] [L734] COND TRUE 1 x1 != 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x1=2, x=2, y1=0, y=1] [L736] 1 b1 = 0 VAL [X=0, _={0:0}, _={0:0}, b1=0, b2=1, x1=2, x=2, y1=0, y=1] [L739] 1 int b21 = b2; VAL [X=0, _={0:0}, _={0:0}, b1=0, b21=1, b2=1, x1=2, x=2, y1=0, y=1] Loop: [L741] COND TRUE b21 >= 1 [L743] b21 = b2 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 741]: 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={11913:0}, t2={11914: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)=27725, t1={11913:0}, t2={11914: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)=27726, t1={11913:0}, t2={11914:0}, x=1, y=0] [L774] COND TRUE 2 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=0, x=1, y=0] [L776] 2 b2 = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=1, y=0] [L779] 2 x = 2 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y=0] [L712] 1 int y1 = y; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y1=0, y=0] [L714] COND FALSE 1 !(y1 != 0) VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y1=0, y=0] [L729] 1 y = 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x=2, y1=0, y=1] [L732] 1 int x1 = x; VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x1=2, x=2, y1=0, y=1] [L734] COND TRUE 1 x1 != 1 VAL [X=0, _={0:0}, _={0:0}, b1=1, b2=1, x1=2, x=2, y1=0, y=1] [L736] 1 b1 = 0 VAL [X=0, _={0:0}, _={0:0}, b1=0, b2=1, x1=2, x=2, y1=0, y=1] [L739] 1 int b21 = b2; VAL [X=0, _={0:0}, _={0:0}, b1=0, b21=1, b2=1, x1=2, x=2, y1=0, y=1] Loop: [L741] COND TRUE b21 >= 1 [L743] b21 = b2 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:58:19,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...