/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-08 14:36:30,498 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-08 14:36:30,534 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-08 14:36:30,549 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 14:36:30,550 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 14:36:30,550 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 14:36:30,551 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 14:36:30,551 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 14:36:30,551 INFO L137 SettingsManager]: * Use SBE=true [2023-09-08 14:36:30,552 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-08 14:36:30,552 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-08 14:36:30,552 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-08 14:36:30,552 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-08 14:36:30,552 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-08 14:36:30,553 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-08 14:36:30,553 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 14:36:30,553 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-08 14:36:30,561 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-08 14:36:30,561 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 14:36:30,561 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-08 14:36:30,561 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 14:36:30,563 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-08 14:36:30,563 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-08 14:36:30,563 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-08 14:36:30,563 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-08 14:36:30,563 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 14:36:30,563 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-08 14:36:30,564 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-08 14:36:30,565 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-08 14:36:30,565 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 14:36:30,565 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 14:36:30,565 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 14:36:30,565 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 14:36:30,566 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 14:36:30,566 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-08 14:36:30,566 INFO L137 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: Fairness type for concurrent programs -> NONE [2023-09-08 14:36:30,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 14:36:30,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 14:36:30,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 14:36:30,787 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 14:36:30,788 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 14:36:30,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/spaghetti.wvr.c [2023-09-08 14:36:31,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 14:36:31,992 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 14:36:31,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c [2023-09-08 14:36:32,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00dc2bd5/9147e009641943cebdf95b384fa6e47f/FLAG6c95dcafe [2023-09-08 14:36:32,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00dc2bd5/9147e009641943cebdf95b384fa6e47f [2023-09-08 14:36:32,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 14:36:32,021 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 14:36:32,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 14:36:32,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 14:36:32,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 14:36:32,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2844ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32, skipping insertion in model container [2023-09-08 14:36:32,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-08 14:36:32,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-08 14:36:32,196 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c[3221,3234] [2023-09-08 14:36:32,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:36:32,209 INFO L203 MainTranslator]: Completed pre-run [2023-09-08 14:36:32,235 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/spaghetti.wvr.c[3221,3234] [2023-09-08 14:36:32,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:36:32,241 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:36:32,241 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:36:32,246 INFO L208 MainTranslator]: Completed translation [2023-09-08 14:36:32,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32 WrapperNode [2023-09-08 14:36:32,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 14:36:32,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 14:36:32,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 14:36:32,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 14:36:32,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,275 INFO L138 Inliner]: procedures = 23, calls = 59, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2023-09-08 14:36:32,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 14:36:32,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 14:36:32,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 14:36:32,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 14:36:32,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 14:36:32,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 14:36:32,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 14:36:32,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 14:36:32,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (1/1) ... [2023-09-08 14:36:32,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:36:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:36:32,335 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) [2023-09-08 14:36:32,337 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 [2023-09-08 14:36:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 14:36:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-08 14:36:32,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-08 14:36:32,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-08 14:36:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-08 14:36:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-08 14:36:32,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-08 14:36:32,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 14:36:32,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 14:36:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 14:36:32,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 14:36:32,373 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 14:36:32,450 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 14:36:32,453 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 14:36:32,706 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 14:36:32,719 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 14:36:32,719 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-08 14:36:32,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:36:32 BoogieIcfgContainer [2023-09-08 14:36:32,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 14:36:32,722 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-08 14:36:32,722 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-08 14:36:32,724 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-08 14:36:32,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:36:32,725 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.09 02:36:32" (1/3) ... [2023-09-08 14:36:32,726 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a6cd3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:36:32, skipping insertion in model container [2023-09-08 14:36:32,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:36:32,726 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:36:32" (2/3) ... [2023-09-08 14:36:32,726 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a6cd3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:36:32, skipping insertion in model container [2023-09-08 14:36:32,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:36:32,726 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:36:32" (3/3) ... [2023-09-08 14:36:32,727 INFO L332 chiAutomizerObserver]: Analyzing ICFG spaghetti.wvr.c [2023-09-08 14:36:32,816 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-08 14:36:32,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 129 transitions, 290 flow [2023-09-08 14:36:32,906 INFO L124 PetriNetUnfolderBase]: 9/121 cut-off events. [2023-09-08 14:36:32,906 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-09-08 14:36:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 121 events. 9/121 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/112 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-09-08 14:36:32,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 129 transitions, 290 flow [2023-09-08 14:36:32,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 121 transitions, 266 flow [2023-09-08 14:36:32,932 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-08 14:36:32,933 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-08 14:36:32,933 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-08 14:36:32,933 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-08 14:36:32,933 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-08 14:36:32,933 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-08 14:36:32,933 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-08 14:36:32,933 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-08 14:36:32,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-08 14:36:37,279 INFO L131 ngComponentsAnalysis]: Automaton has 3611 accepting balls. 56151 [2023-09-08 14:36:37,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:36:37,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:36:37,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:36:37,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-08 14:36:37,286 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-08 14:36:37,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 60089 states, but on-demand construction may add more states [2023-09-08 14:36:38,715 INFO L131 ngComponentsAnalysis]: Automaton has 3611 accepting balls. 56151 [2023-09-08 14:36:38,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:36:38,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:36:38,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-08 14:36:38,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-09-08 14:36:38,723 INFO L748 eck$LassoCheckResult]: Stem: 132#[$Ultimate##0]don't care [192] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 135#[L-1]don't care [203] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 137#[L-1-1]don't care [277] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 139#[L21]don't care [258] L21-->L21-1: Formula: (and (= 2 (select |v_#length_5| 1)) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] 141#[L21-1]don't care [270] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_5| 1) 0) 48) InVars {#memory_int=|v_#memory_int_5|} OutVars{#memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[] 143#[L21-2]don't care [211] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_6| 1) 1) 0) InVars {#memory_int=|v_#memory_int_6|} OutVars{#memory_int=|v_#memory_int_6|} AuxVars[] AssignedVars[] 145#[L21-3]don't care [248] L21-3-->L21-4: Formula: (and (= (select |v_#length_6| 2) 16) (= (select |v_#valid_15| 2) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 147#[L21-4]don't care [233] 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] 149#[L38]don't care [234] L38-->L-1-2: Formula: (= v_~x_1~0_13 0) InVars {} OutVars{~x_1~0=v_~x_1~0_13} AuxVars[] AssignedVars[~x_1~0] 151#[L-1-2]don't care [280] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 153#[L-1-3]don't care [284] L-1-3-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_4|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_3|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, 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_1|, 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_1|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, 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_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_4|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~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] 155#[L112]don't care [216] L112-->L112-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_7|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 157#[L112-1]don't care [235] L112-1-->L112-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 159#[L112-2]don't care [276] L112-2-->L112-3: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t3~0#1.base_5| 4) |v_#length_11|) (= (select |v_#valid_21| |v_ULTIMATE.start_main_~#t3~0#1.base_5|) 0) (= (store |v_#valid_21| |v_ULTIMATE.start_main_~#t3~0#1.base_5| 1) |v_#valid_20|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_5| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_5|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 161#[L112-3]don't care [173] L112-3-->L112-4: Formula: (and (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_5|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t4~0#1.base_5|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t4~0#1.base_5| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_5| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_5| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t4~0#1.base_5| 1) |v_#valid_22|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_13|, 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|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 163#[L112-4]don't care [232] L112-4-->L114: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 165#[L114]don't care [217] L114-->L114-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~x_0~0_14) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~x_0~0=v_~x_0~0_14, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~x_0~0] 167#[L114-1]don't care [256] L114-1-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 169#[L115]don't care [220] L115-->L115-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 171#[L115-1]don't care [223] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~x_1~0_14) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~x_1~0=v_~x_1~0_14} AuxVars[] AssignedVars[~x_1~0] 173#[L115-2]don't care [224] L115-2-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 175#[L117]don't care [172] L117-->L117-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 177#[L117-1]don't care [257] 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] 179#[L117-2]don't care [181] L117-2-->L117-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_15| |v_ULTIMATE.start_main_~#t1~0#1.base_6|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_8| |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_3|)) |v_#memory_int_7|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|, 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_3|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_7|, #length=|v_#length_15|, 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] 181#[L117-3]don't care [342] L117-3-->L51: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} 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_6|, 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] 183#[L117-4, L51]don't care [2023-09-08 14:36:38,723 INFO L750 eck$LassoCheckResult]: Loop: 183#[L117-4, L51]don't care [288] L51-->L42: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1] 187#[L117-4, L42]don't care [291] 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[] 199#[L117-4, L42-3]don't care [294] L42-3-->L43: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet1=|v_thread1Thread1of1ForFork2_#t~nondet1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1] 215#[L117-4, L43]don't care [296] 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] 235#[L117-4, L45]don't care [298] 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] 259#[L117-4, L48]don't care [299] 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] 183#[L117-4, L51]don't care [2023-09-08 14:36:38,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:36:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1312177617, now seen corresponding path program 1 times [2023-09-08 14:36:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:36:38,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616992157] [2023-09-08 14:36:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:36:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:36:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:38,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:36:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:38,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:36:38,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:36:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash 820561735, now seen corresponding path program 1 times [2023-09-08 14:36:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:36:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908969282] [2023-09-08 14:36:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:36:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:36:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:38,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:36:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:38,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:36:38,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:36:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1573409035, now seen corresponding path program 1 times [2023-09-08 14:36:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:36:38,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953604681] [2023-09-08 14:36:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:36:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:36:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:38,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:36:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:38,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:36:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:39,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:36:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:36:39,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.09 02:36:39 BoogieIcfgContainer [2023-09-08 14:36:39,880 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-08 14:36:39,882 INFO L158 Benchmark]: Toolchain (without parser) took 7859.72ms. Allocated memory was 271.6MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 226.5MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 517.7MB. Max. memory is 8.0GB. [2023-09-08 14:36:39,882 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-08 14:36:39,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.28ms. Allocated memory is still 271.6MB. Free memory was 226.5MB in the beginning and 214.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-08 14:36:39,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.42ms. Allocated memory is still 271.6MB. Free memory was 214.9MB in the beginning and 213.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-08 14:36:39,883 INFO L158 Benchmark]: Boogie Preprocessor took 24.09ms. Allocated memory is still 271.6MB. Free memory was 213.4MB in the beginning and 211.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:36:39,883 INFO L158 Benchmark]: RCFGBuilder took 414.78ms. Allocated memory is still 271.6MB. Free memory was 211.8MB in the beginning and 196.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-09-08 14:36:39,884 INFO L158 Benchmark]: BuchiAutomizer took 7158.32ms. Allocated memory was 271.6MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 196.1MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 487.3MB. Max. memory is 8.0GB. [2023-09-08 14:36:39,885 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.28ms. Allocated memory is still 271.6MB. Free memory was 226.5MB in the beginning and 214.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.42ms. Allocated memory is still 271.6MB. Free memory was 214.9MB in the beginning and 213.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.09ms. Allocated memory is still 271.6MB. Free memory was 213.4MB in the beginning and 211.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.78ms. Allocated memory is still 271.6MB. Free memory was 211.8MB in the beginning and 196.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 7158.32ms. Allocated memory was 271.6MB in the beginning and 4.4GB in the end (delta: 4.1GB). Free memory was 196.1MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 487.3MB. 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 7.0s and 1 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. 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={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=0] [L114] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, t1={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=0] [L115] 0 x_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=11, t1={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=11] [L117] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [pthread_create(&t1, 0, thread1, 0)=-1, t1={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=11] 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={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=0] [L114] 0 x_0 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=0, t1={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=0] [L115] 0 x_1 = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=11, t1={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=11] [L117] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [pthread_create(&t1, 0, thread1, 0)=-1, t1={17705:0}, t2={17706:0}, t3={17703:0}, t4={17704:0}, x_0=0, x_1=11] 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! [2023-09-08 14:36:39,939 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...