/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:55:04,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:55:04,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:55:04,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:55:04,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:55:04,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:55:04,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:55:04,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:55:04,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:55:04,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:55:04,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:55:04,704 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:55:04,704 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:55:04,705 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:55:04,705 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:55:04,705 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:55:04,705 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:55:04,706 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:55:04,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:55:04,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:55:04,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:55:04,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:55:04,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:55:04,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:55:04,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:55:04,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:55:04,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:55:04,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:55:04,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:55:04,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:55:04,709 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:55:04,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:55:04,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:55:04,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:55:04,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:55:04,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:55:04,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:55:04,711 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:55:04,712 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:55:05,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:55:05,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:55:05,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:55:05,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:55:05,070 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:55:05,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c [2024-02-10 00:55:06,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:55:06,514 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:55:06,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c [2024-02-10 00:55:06,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df6b4530/e8577d3b27a24b849bf1653273f66bf0/FLAG5a1aaecd3 [2024-02-10 00:55:06,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df6b4530/e8577d3b27a24b849bf1653273f66bf0 [2024-02-10 00:55:06,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:55:06,536 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:55:06,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:55:06,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:55:06,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:55:06,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1bdbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06, skipping insertion in model container [2024-02-10 00:55:06,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,575 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:55:06,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:55:06,780 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:55:06,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:55:06,804 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:55:06,804 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:55:06,810 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:55:06,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06 WrapperNode [2024-02-10 00:55:06,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:55:06,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:55:06,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:55:06,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:55:06,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,874 INFO L138 Inliner]: procedures = 23, calls = 60, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-02-10 00:55:06,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:55:06,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:55:06,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:55:06,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:55:06,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:55:06,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:55:06,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:55:06,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:55:06,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (1/1) ... [2024-02-10 00:55:06,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:55:06,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:55:06,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:55:06,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:55:07,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:55:07,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:55:07,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:55:07,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:55:07,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:55:07,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 00:55:07,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 00:55:07,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-10 00:55:07,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-10 00:55:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:55:07,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:55:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:55:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:55:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:55:07,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:55:07,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:55:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:55:07,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:55:07,013 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:55:07,122 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:55:07,123 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:55:07,376 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:55:07,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:55:07,390 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-10 00:55:07,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:55:07 BoogieIcfgContainer [2024-02-10 00:55:07,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:55:07,396 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:55:07,396 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:55:07,399 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:55:07,400 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:07,400 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:55:06" (1/3) ... [2024-02-10 00:55:07,401 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a45ff59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:55:07, skipping insertion in model container [2024-02-10 00:55:07,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:07,402 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:55:06" (2/3) ... [2024-02-10 00:55:07,402 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a45ff59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:55:07, skipping insertion in model container [2024-02-10 00:55:07,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:55:07,403 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:55:07" (3/3) ... [2024-02-10 00:55:07,404 INFO L332 chiAutomizerObserver]: Analyzing ICFG spaghetti.wvr.c [2024-02-10 00:55:07,527 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-10 00:55:07,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 134 transitions, 296 flow [2024-02-10 00:55:07,620 INFO L124 PetriNetUnfolderBase]: 9/126 cut-off events. [2024-02-10 00:55:07,621 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-10 00:55:07,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 9/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2024-02-10 00:55:07,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 134 transitions, 296 flow [2024-02-10 00:55:07,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 126 transitions, 276 flow [2024-02-10 00:55:07,646 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:55:07,646 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:55:07,646 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:55:07,646 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:55:07,646 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:55:07,646 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:55:07,646 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:55:07,647 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:55:07,647 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 places, 126 transitions, 276 flow [2024-02-10 00:55:07,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:07,665 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-02-10 00:55:07,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:07,665 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:07,670 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:55:07,671 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 places, 126 transitions, 276 flow [2024-02-10 00:55:07,687 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:55:07,687 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2024-02-10 00:55:07,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:55:07,690 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:55:07,695 INFO L748 eck$LassoCheckResult]: Stem: 138#[$Ultimate##0]true [198] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_12| 0) 0) InVars {#valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|} AuxVars[] AssignedVars[] 140#[L-1]true [209] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 142#[L21]true [266] L21-->L21-1: Formula: (and (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_13| 1) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_13|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[] 144#[L21-1]true [278] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_4| 1) 0)) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] 146#[L21-2]true [217] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_5| 1) 1) 0) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 148#[L21-3]true [255] L21-3-->L21-4: Formula: (and (= 16 (select |v_#length_5| 2)) (= (select |v_#valid_14| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 150#[L21-4]true [239] L21-4-->L38: Formula: (= v_~x_0~0_13 0) InVars {} OutVars{~x_0~0=v_~x_0~0_13} AuxVars[] AssignedVars[~x_0~0] 152#[L38]true [240] L38-->L-1-1: Formula: (= v_~x_1~0_13 0) InVars {} OutVars{~x_1~0=v_~x_1~0_13} AuxVars[] AssignedVars[~x_1~0] 154#[L-1-1]true [286] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 156#[L-1-2]true [290] L-1-2-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_4|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_4|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_4|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_5|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] 158#[L112]true [222] L112-->L112-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4)) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_#valid_15| (store |v_#valid_16| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 160#[L112-1]true [241] L112-1-->L112-2: Formula: (and (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_17|) (= |v_#length_8| (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 162#[L112-2]true [285] L112-2-->L112-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1) |v_#valid_19|) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 164#[L112-3]true [179] L112-3-->L112-4: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t4~0#1.base_6| 1)) (= |v_#length_12| (store |v_#length_13| |v_ULTIMATE.start_main_~#t4~0#1.base_6| 4)) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_6|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_6| 0) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t4~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_6| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, #valid=|v_#valid_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_12|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 166#[L112-4]true [238] L112-4-->L114: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 168#[L114]true [223] L114-->L114-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~x_0~0_14) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{~x_0~0=v_~x_0~0_14, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[~x_0~0] 170#[L114-1]true [264] L114-1-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 172#[L115]true [226] L115-->L115-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 174#[L115-1]true [229] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~x_1~0_14) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~x_1~0=v_~x_1~0_14} AuxVars[] AssignedVars[~x_1~0] 176#[L115-2]true [230] L115-2-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 178#[L117]true [178] L117-->L117-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 180#[L117-1]true [265] L117-1-->L117-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 182#[L117-2]true [187] L117-2-->L117-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre9#1_4|)) |v_#memory_int_6|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_6|, #length=|v_#length_14|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 184#[L117-3]true [353] L117-3-->L51: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread1Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_#t~nondet2=|v_thread1Thread1of1ForFork2_#t~nondet2_4|, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_12|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_#t~nondet2, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~nondet1, thread1Thread1of1ForFork2_#res.offset] 186#[L117-4, L51]true [2024-02-10 00:55:07,696 INFO L750 eck$LassoCheckResult]: Loop: 186#[L117-4, L51]true [299] L51-->L42: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1] 189#[L42, L117-4]true [302] L42-->L42-3: Formula: (not (= (mod |v_thread1Thread1of1ForFork2_#t~nondet1_5| 256) 0)) InVars {thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_5|} OutVars{thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_5|} AuxVars[] AssignedVars[] 191#[L42-3, L117-4]true [305] L42-3-->L43: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1] 193#[L43, L117-4]true [307] L43-->L45: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet2=|v_thread1Thread1of1ForFork2_#t~nondet2_1|, ~x_0~0=v_~x_0~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet2, ~x_0~0] 195#[L45, L117-4]true [309] L45-->L48: Formula: (= v_~x_0~0_2 (+ 3 v_~x_0~0_3)) InVars {~x_0~0=v_~x_0~0_3} OutVars{~x_0~0=v_~x_0~0_2} AuxVars[] AssignedVars[~x_0~0] 197#[L48, L117-4]true [310] L48-->L51: Formula: (= (* 2 v_~x_0~0_5) v_~x_0~0_4) InVars {~x_0~0=v_~x_0~0_5} OutVars{~x_0~0=v_~x_0~0_4} AuxVars[] AssignedVars[~x_0~0] 186#[L117-4, L51]true [2024-02-10 00:55:07,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1481131861, now seen corresponding path program 1 times [2024-02-10 00:55:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528943883] [2024-02-10 00:55:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:07,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:07,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:07,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:07,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1145979751, now seen corresponding path program 1 times [2024-02-10 00:55:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:07,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344214516] [2024-02-10 00:55:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:07,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:07,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:07,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:55:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2089860027, now seen corresponding path program 1 times [2024-02-10 00:55:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:55:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640221453] [2024-02-10 00:55:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:55:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:55:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:07,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:07,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:55:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:08,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:55:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:55:08,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:55:08 BoogieIcfgContainer [2024-02-10 00:55:08,827 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:55:08,829 INFO L158 Benchmark]: Toolchain (without parser) took 2292.60ms. Allocated memory was 167.8MB in the beginning and 223.3MB in the end (delta: 55.6MB). Free memory was 104.4MB in the beginning and 198.1MB in the end (delta: -93.7MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2024-02-10 00:55:08,830 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:55:08,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.82ms. Allocated memory was 167.8MB in the beginning and 223.3MB in the end (delta: 55.6MB). Free memory was 104.2MB in the beginning and 192.9MB in the end (delta: -88.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2024-02-10 00:55:08,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.09ms. Allocated memory is still 223.3MB. Free memory was 192.9MB in the beginning and 191.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:55:08,831 INFO L158 Benchmark]: Boogie Preprocessor took 34.63ms. Allocated memory is still 223.3MB. Free memory was 190.8MB in the beginning and 189.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:55:08,848 INFO L158 Benchmark]: RCFGBuilder took 485.42ms. Allocated memory is still 223.3MB. Free memory was 189.2MB in the beginning and 173.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-02-10 00:55:08,850 INFO L158 Benchmark]: BuchiAutomizer took 1431.31ms. Allocated memory is still 223.3MB. Free memory was 173.0MB in the beginning and 198.1MB in the end (delta: -25.1MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. [2024-02-10 00:55:08,856 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.82ms. Allocated memory was 167.8MB in the beginning and 223.3MB in the end (delta: 55.6MB). Free memory was 104.2MB in the beginning and 192.9MB in the end (delta: -88.7MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.09ms. Allocated memory is still 223.3MB. Free memory was 192.9MB in the beginning and 191.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.63ms. Allocated memory is still 223.3MB. Free memory was 190.8MB in the beginning and 189.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 485.42ms. Allocated memory is still 223.3MB. Free memory was 189.2MB in the beginning and 173.0MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 1431.31ms. Allocated memory is still 223.3MB. Free memory was 173.0MB in the beginning and 198.1MB in the end (delta: -25.1MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Trivial decomposition into one nonterminating module. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 1 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.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: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 unsigned int x_0, x_1; VAL [x_0=0, x_1=0] [L112] 0 pthread_t t1, t2, t3, t4; VAL [t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=0] [L114] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=0] [L115] 0 x_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=12, t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=12] [L117] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [pthread_create(&t1, 0, thread1, 0)=1241, t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=12] Loop: [L42] COND TRUE __VERIFIER_nondet_bool() [L44] x_0 = __VERIFIER_nondet_uint() [L47] x_0 = x_0 + 3 [L50] x_0 = 2 * x_0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 unsigned int x_0, x_1; VAL [x_0=0, x_1=0] [L112] 0 pthread_t t1, t2, t3, t4; VAL [t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=0] [L114] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=0] [L115] 0 x_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=12, t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=12] [L117] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [pthread_create(&t1, 0, thread1, 0)=1241, t1={10953:0}, t2={10952:0}, t3={10951:0}, t4={10954:0}, x_0=0, x_1=12] Loop: [L42] COND TRUE __VERIFIER_nondet_bool() [L44] x_0 = __VERIFIER_nondet_uint() [L47] x_0 = x_0 + 3 [L50] x_0 = 2 * x_0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 00:55:08,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...