/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/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-a3464b2-m [2023-08-18 16:43:17,561 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-08-18 16:43:17,609 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-08-18 16:43:17,640 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-18 16:43:17,641 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-18 16:43:17,642 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-18 16:43:17,643 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-18 16:43:17,643 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-08-18 16:43:17,644 INFO L137 SettingsManager]: * Use SBE=true [2023-08-18 16:43:17,647 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-08-18 16:43:17,648 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-08-18 16:43:17,648 INFO L137 SettingsManager]: * Use old map elimination=false [2023-08-18 16:43:17,648 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-08-18 16:43:17,649 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-08-18 16:43:17,650 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-08-18 16:43:17,650 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-18 16:43:17,651 INFO L137 SettingsManager]: * sizeof long=4 [2023-08-18 16:43:17,651 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-18 16:43:17,651 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-18 16:43:17,651 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-08-18 16:43:17,652 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-08-18 16:43:17,653 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-08-18 16:43:17,653 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-08-18 16:43:17,653 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-08-18 16:43:17,653 INFO L137 SettingsManager]: * sizeof long double=12 [2023-08-18 16:43:17,654 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-08-18 16:43:17,654 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-08-18 16:43:17,654 INFO L137 SettingsManager]: * Use constant arrays=true [2023-08-18 16:43:17,654 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-08-18 16:43:17,655 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-18 16:43:17,655 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-18 16:43:17,656 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-18 16:43:17,656 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-18 16:43:17,656 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-08-18 16:43:17,658 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-08-18 16:43:17,658 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-08-18 16:43:17,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-18 16:43:17,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-18 16:43:17,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-18 16:43:17,916 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-18 16:43:17,916 INFO L274 PluginConnector]: CDTParser initialized [2023-08-18 16:43:17,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2023-08-18 16:43:19,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-18 16:43:19,487 INFO L384 CDTParser]: Found 1 translation units. [2023-08-18 16:43:19,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2023-08-18 16:43:19,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2456d4f56/09dee84294ac4081a7dcf2fb156b5b38/FLAGfc6b7d8de [2023-08-18 16:43:19,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2456d4f56/09dee84294ac4081a7dcf2fb156b5b38 [2023-08-18 16:43:19,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-18 16:43:19,525 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-18 16:43:19,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-18 16:43:19,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-18 16:43:19,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-18 16:43:19,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:19,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61626eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19, skipping insertion in model container [2023-08-18 16:43:19,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:19,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-18 16:43:19,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-18 16:43:19,719 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-18 16:43:19,856 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[31403,31416] [2023-08-18 16:43:19,863 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[32483,32496] [2023-08-18 16:43:19,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 16:43:19,886 INFO L203 MainTranslator]: Completed pre-run [2023-08-18 16:43:19,909 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-18 16:43:19,931 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[31403,31416] [2023-08-18 16:43:19,934 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[32483,32496] [2023-08-18 16:43:19,937 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-18 16:43:19,965 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-18 16:43:19,965 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-18 16:43:19,965 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-18 16:43:19,971 INFO L208 MainTranslator]: Completed translation [2023-08-18 16:43:19,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19 WrapperNode [2023-08-18 16:43:19,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-18 16:43:19,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-18 16:43:19,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-18 16:43:19,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-18 16:43:19,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,028 INFO L138 Inliner]: procedures = 172, calls = 60, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2023-08-18 16:43:20,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-18 16:43:20,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-18 16:43:20,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-18 16:43:20,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-18 16:43:20,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-18 16:43:20,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-18 16:43:20,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-18 16:43:20,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-18 16:43:20,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (1/1) ... [2023-08-18 16:43:20,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-08-18 16:43:20,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-18 16:43:20,121 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-08-18 16:43:20,128 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-08-18 16:43:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-18 16:43:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-08-18 16:43:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-08-18 16:43:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-18 16:43:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-18 16:43:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-18 16:43:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-18 16:43:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-18 16:43:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-18 16:43:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-18 16:43:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-18 16:43:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-18 16:43:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-18 16:43:20,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-18 16:43:20,160 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-18 16:43:20,280 INFO L236 CfgBuilder]: Building ICFG [2023-08-18 16:43:20,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-18 16:43:20,438 INFO L277 CfgBuilder]: Performing block encoding [2023-08-18 16:43:20,444 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-18 16:43:20,444 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-18 16:43:20,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:43:20 BoogieIcfgContainer [2023-08-18 16:43:20,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-18 16:43:20,447 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-08-18 16:43:20,447 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-08-18 16:43:20,450 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-08-18 16:43:20,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:43:20,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.08 04:43:19" (1/3) ... [2023-08-18 16:43:20,452 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76464221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 04:43:20, skipping insertion in model container [2023-08-18 16:43:20,452 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:43:20,452 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 04:43:19" (2/3) ... [2023-08-18 16:43:20,456 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76464221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.08 04:43:20, skipping insertion in model container [2023-08-18 16:43:20,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-08-18 16:43:20,456 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 04:43:20" (3/3) ... [2023-08-18 16:43:20,458 INFO L332 chiAutomizerObserver]: Analyzing ICFG dekker.i [2023-08-18 16:43:20,550 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-18 16:43:20,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 100 transitions, 216 flow [2023-08-18 16:43:20,614 INFO L124 PetriNetUnfolderBase]: 13/96 cut-off events. [2023-08-18 16:43:20,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-18 16:43:20,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 96 events. 13/96 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-18 16:43:20,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 100 transitions, 216 flow [2023-08-18 16:43:20,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 96 transitions, 204 flow [2023-08-18 16:43:20,637 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-08-18 16:43:20,637 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-08-18 16:43:20,637 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-08-18 16:43:20,637 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-08-18 16:43:20,637 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-08-18 16:43:20,637 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-08-18 16:43:20,637 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-08-18 16:43:20,638 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-08-18 16:43:20,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-08-18 16:43:20,996 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 1197 [2023-08-18 16:43:20,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:20,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:21,007 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, 1] [2023-08-18 16:43:21,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:43:21,007 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-08-18 16:43:21,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 1812 states, but on-demand construction may add more states [2023-08-18 16:43:21,044 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 1197 [2023-08-18 16:43:21,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:21,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:21,045 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, 1] [2023-08-18 16:43:21,045 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:43:21,049 INFO L748 eck$LassoCheckResult]: Stem: 95#[$Ultimate##0]don't care [187] $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] 98#[L-1]don't care [208] L-1-->L-1-1: Formula: (= (select |v_#valid_9| 0) 0) InVars {#valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|} AuxVars[] AssignedVars[] 100#[L-1-1]don't care [238] L-1-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 102#[L16]don't care [198] L16-->L16-1: Formula: (and (= (select |v_#valid_10| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[] 104#[L16-1]don't care [157] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] 106#[L16-2]don't care [248] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 108#[L16-3]don't care [227] L16-3-->L16-4: Formula: (and (= (select |v_#length_6| 2) 9) (= (select |v_#valid_11| 2) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[] 110#[L16-4]don't care [228] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 112#[L704]don't care [234] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 114#[L705]don't care [206] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 116#[L706]don't care [219] L706-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 118#[L-1-2]don't care [239] 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] 120#[L-1-3]don't care [243] L-1-3-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 122#[L790]don't care [162] L790-->L790-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_12|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_7|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 124#[L790-1]don't care [211] L790-1-->L790-2: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 126#[L790-2]don't care [178] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 128#[L791]don't care [190] L791-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 130#[L2]don't care [160] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 132#[L3]don't care [237] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 136#[L2-1]don't care [189] L2-1-->L792: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 138#[L792]don't care [168] L792-->L792-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 140#[L792-1]don't care [240] L792-1-->L792-2: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre4#1_2|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {#valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{#valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 142#[L792-2]don't care [304] L792-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_16, thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t~0, thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f2~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 144#[L792-3, $Ultimate##0]don't care [277] $Ultimate##0-->L708: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 146#[L792-3, L708]don't care [278] L708-->L710: Formula: (= v_~flag1~0_6 1) InVars {} OutVars{~flag1~0=v_~flag1~0_6} AuxVars[] AssignedVars[~flag1~0] 150#[L792-3, L710]don't care [279] L710-->L736: Formula: (= v_~flag2~0_6 v_thr1Thread1of1ForFork0_~f2~0_1) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_1, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f2~0] 156#[L792-3, L736]don't care [2023-08-18 16:43:21,050 INFO L750 eck$LassoCheckResult]: Loop: 156#[L792-3, L736]don't care [280] L736-->L715: Formula: (<= 1 v_thr1Thread1of1ForFork0_~f2~0_3) InVars {thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_3} OutVars{thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_3} AuxVars[] AssignedVars[] 164#[L792-3, L715]don't care [283] L715-->L717: Formula: (= v_~turn~0_5 v_thr1Thread1of1ForFork0_~t~0_1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t~0] 178#[L792-3, L717]don't care [286] L717-->L718: Formula: (= 0 v_thr1Thread1of1ForFork0_~t~0_5) InVars {thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_5} OutVars{thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_5} AuxVars[] AssignedVars[] 198#[L792-3, L718]don't care [290] L718-->L736: Formula: (= v_~flag2~0_5 v_thr1Thread1of1ForFork0_~f2~0_7) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_7, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f2~0] 156#[L792-3, L736]don't care [2023-08-18 16:43:21,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -297483312, now seen corresponding path program 1 times [2023-08-18 16:43:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329747069] [2023-08-18 16:43:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:21,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 9546120, now seen corresponding path program 1 times [2023-08-18 16:43:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:21,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722653376] [2023-08-18 16:43:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:21,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:21,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash -199103017, now seen corresponding path program 1 times [2023-08-18 16:43:21,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977285138] [2023-08-18 16:43:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:43:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:43:21,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-18 16:43:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977285138] [2023-08-18 16:43:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977285138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-18 16:43:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-18 16:43:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-18 16:43:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225262179] [2023-08-18 16:43:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-18 16:43:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-18 16:43:21,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-18 16:43:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-18 16:43:21,656 INFO L87 Difference]: Start difference. First operand currently 1812 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:43:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-08-18 16:43:21,798 INFO L93 Difference]: Finished difference Result 2412 states and 6722 transitions. [2023-08-18 16:43:21,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2412 states and 6722 transitions. [2023-08-18 16:43:21,844 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1338 [2023-08-18 16:43:21,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2412 states to 1741 states and 4954 transitions. [2023-08-18 16:43:21,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1741 [2023-08-18 16:43:21,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1741 [2023-08-18 16:43:21,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1741 states and 4954 transitions. [2023-08-18 16:43:21,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:43:21,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1741 states and 4954 transitions. [2023-08-18 16:43:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states and 4954 transitions. [2023-08-18 16:43:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1391. [2023-08-18 16:43:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1391 states have (on average 2.8641265276779295) internal successors, (3984), 1390 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:43:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3984 transitions. [2023-08-18 16:43:22,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1391 states and 3984 transitions. [2023-08-18 16:43:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-18 16:43:22,054 INFO L428 stractBuchiCegarLoop]: Abstraction has 1391 states and 3984 transitions. [2023-08-18 16:43:22,054 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-08-18 16:43:22,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1391 states and 3984 transitions. [2023-08-18 16:43:22,072 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 1023 [2023-08-18 16:43:22,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:22,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:22,074 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 16:43:22,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:43:22,079 INFO L748 eck$LassoCheckResult]: Stem: 7341#[$Ultimate##0]don't care [187] $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] 7343#[L-1]don't care [208] L-1-->L-1-1: Formula: (= (select |v_#valid_9| 0) 0) InVars {#valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|} AuxVars[] AssignedVars[] 8619#[L-1-1]don't care [238] L-1-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 8621#[L16]don't care [198] L16-->L16-1: Formula: (and (= (select |v_#valid_10| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[] 8749#[L16-1]don't care [157] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] 8821#[L16-2]don't care [248] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 8809#[L16-3]don't care [227] L16-3-->L16-4: Formula: (and (= (select |v_#length_6| 2) 9) (= (select |v_#valid_11| 2) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[] 7995#[L16-4]don't care [228] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 7997#[L704]don't care [234] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 7665#[L705]don't care [206] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 7667#[L706]don't care [219] L706-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 8893#[L-1-2]don't care [239] 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] 8819#[L-1-3]don't care [243] L-1-3-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 6747#[L790]don't care [162] L790-->L790-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_12|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_7|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 6749#[L790-1]don't care [211] L790-1-->L790-2: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 8209#[L790-2]don't care [178] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 7943#[L791]don't care [190] L791-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 7523#[L2]don't care [160] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 7525#[L3]don't care [237] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 6341#[L2-1]don't care [189] L2-1-->L792: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 6343#[L792]don't care [168] L792-->L792-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 6643#[L792-1]don't care [240] L792-1-->L792-2: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre4#1_2|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {#valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{#valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 6645#[L792-2]don't care [304] L792-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_16, thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t~0, thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f2~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 7941#[L792-3, $Ultimate##0]don't care [203] L792-3-->L792-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 8701#[L792-4, $Ultimate##0]don't care [220] L792-4-->L793: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 8785#[L793, $Ultimate##0]don't care [210] L793-->L793-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 8653#[L793-1, $Ultimate##0]don't care [185] L793-1-->L793-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 8561#[L793-2, $Ultimate##0]don't care [161] L793-2-->L793-3: Formula: (and (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre6#1_2|)))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 8563#[L793-3, $Ultimate##0]don't care [307] L793-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_~f1~0=v_thr2Thread1of1ForFork1_~f1~0_10, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_~t~1=v_thr2Thread1of1ForFork1_~t~1_16, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_~f1~0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_~t~1, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 8753#[$Ultimate##0, $Ultimate##0, L793-4]don't care [252] $Ultimate##0-->L749: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 8685#[$Ultimate##0, L793-4, L749]don't care [253] L749-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 7119#[L751, $Ultimate##0, L793-4]don't care [254] L751-->L777: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{thr2Thread1of1ForFork1_~f1~0=v_thr2Thread1of1ForFork1_~f1~0_1, ~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f1~0] 6705#[$Ultimate##0, L777, L793-4]don't care [2023-08-18 16:43:22,080 INFO L750 eck$LassoCheckResult]: Loop: 6705#[$Ultimate##0, L777, L793-4]don't care [255] L777-->L756: Formula: (<= 1 v_thr2Thread1of1ForFork1_~f1~0_3) InVars {thr2Thread1of1ForFork1_~f1~0=v_thr2Thread1of1ForFork1_~f1~0_3} OutVars{thr2Thread1of1ForFork1_~f1~0=v_thr2Thread1of1ForFork1_~f1~0_3} AuxVars[] AssignedVars[] 7097#[$Ultimate##0, L793-4, L756]don't care [258] L756-->L758: Formula: (= v_thr2Thread1of1ForFork1_~t~1_1 v_~turn~0_1) InVars {~turn~0=v_~turn~0_1} OutVars{~turn~0=v_~turn~0_1, thr2Thread1of1ForFork1_~t~1=v_thr2Thread1of1ForFork1_~t~1_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t~1] 7099#[$Ultimate##0, L793-4, L758]don't care [261] L758-->L759: Formula: (= v_thr2Thread1of1ForFork1_~t~1_5 1) InVars {thr2Thread1of1ForFork1_~t~1=v_thr2Thread1of1ForFork1_~t~1_5} OutVars{thr2Thread1of1ForFork1_~t~1=v_thr2Thread1of1ForFork1_~t~1_5} AuxVars[] AssignedVars[] 6703#[$Ultimate##0, L793-4, L759]don't care [265] L759-->L777: Formula: (= v_~flag1~0_2 v_thr2Thread1of1ForFork1_~f1~0_7) InVars {~flag1~0=v_~flag1~0_2} OutVars{thr2Thread1of1ForFork1_~f1~0=v_thr2Thread1of1ForFork1_~f1~0_7, ~flag1~0=v_~flag1~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f1~0] 6705#[$Ultimate##0, L777, L793-4]don't care [2023-08-18 16:43:22,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash 599335181, now seen corresponding path program 1 times [2023-08-18 16:43:22,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334468929] [2023-08-18 16:43:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 8776520, now seen corresponding path program 1 times [2023-08-18 16:43:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126813907] [2023-08-18 16:43:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1903142484, now seen corresponding path program 1 times [2023-08-18 16:43:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707454307] [2023-08-18 16:43:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-18 16:43:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-18 16:43:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-18 16:43:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707454307] [2023-08-18 16:43:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707454307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-18 16:43:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-18 16:43:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-18 16:43:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574702592] [2023-08-18 16:43:22,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-18 16:43:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-18 16:43:22,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-18 16:43:22,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-18 16:43:22,301 INFO L87 Difference]: Start difference. First operand 1391 states and 3984 transitions. cyclomatic complexity: 2684 Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:43:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-08-18 16:43:22,369 INFO L93 Difference]: Finished difference Result 1686 states and 4742 transitions. [2023-08-18 16:43:22,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1686 states and 4742 transitions. [2023-08-18 16:43:22,390 INFO L131 ngComponentsAnalysis]: Automaton has 119 accepting balls. 1086 [2023-08-18 16:43:22,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1686 states to 1558 states and 4422 transitions. [2023-08-18 16:43:22,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1558 [2023-08-18 16:43:22,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1558 [2023-08-18 16:43:22,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1558 states and 4422 transitions. [2023-08-18 16:43:22,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-18 16:43:22,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1558 states and 4422 transitions. [2023-08-18 16:43:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states and 4422 transitions. [2023-08-18 16:43:22,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1274. [2023-08-18 16:43:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1274 states have (on average 2.857927786499215) internal successors, (3641), 1273 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-18 16:43:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3641 transitions. [2023-08-18 16:43:22,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1274 states and 3641 transitions. [2023-08-18 16:43:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-18 16:43:22,490 INFO L428 stractBuchiCegarLoop]: Abstraction has 1274 states and 3641 transitions. [2023-08-18 16:43:22,490 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-08-18 16:43:22,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1274 states and 3641 transitions. [2023-08-18 16:43:22,499 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 882 [2023-08-18 16:43:22,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-08-18 16:43:22,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-08-18 16:43:22,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-18 16:43:22,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-08-18 16:43:22,505 INFO L748 eck$LassoCheckResult]: Stem: 11652#[$Ultimate##0]don't care [187] $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] 11654#[L-1]don't care [208] L-1-->L-1-1: Formula: (= (select |v_#valid_9| 0) 0) InVars {#valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|} AuxVars[] AssignedVars[] 12804#[L-1-1]don't care [238] L-1-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 12806#[L16]don't care [198] L16-->L16-1: Formula: (and (= (select |v_#valid_10| 1) 1) (= 2 (select |v_#length_5| 1))) InVars {#length=|v_#length_5|, #valid=|v_#valid_10|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[] 12944#[L16-1]don't care [157] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] 13026#[L16-2]don't care [248] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 13014#[L16-3]don't care [227] L16-3-->L16-4: Formula: (and (= (select |v_#length_6| 2) 9) (= (select |v_#valid_11| 2) 1)) InVars {#length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#length=|v_#length_6|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[] 12206#[L16-4]don't care [228] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 12208#[L704]don't care [234] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 11922#[L705]don't care [206] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 11924#[L706]don't care [219] L706-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 13098#[L-1-2]don't care [239] 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] 13024#[L-1-3]don't care [243] L-1-3-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 11134#[L790]don't care [162] L790-->L790-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_12|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_7|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_13|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, 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|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 11136#[L790-1]don't care [211] L790-1-->L790-2: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#valid_15| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_14|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, 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_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 12396#[L790-2]don't care [178] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 12156#[L791]don't care [190] L791-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11794#[L2]don't care [160] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 11796#[L3]don't care [237] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] 10780#[L2-1]don't care [189] L2-1-->L792: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 10782#[L792]don't care [168] L792-->L792-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 11046#[L792-1]don't care [240] L792-1-->L792-2: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre4#1_2|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1)) InVars {#valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{#valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 11048#[L792-2]don't care [304] L792-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_16, thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t~0, thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f2~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 12152#[L792-3, $Ultimate##0]don't care [277] $Ultimate##0-->L708: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 12888#[L792-3, L708]don't care [278] L708-->L710: Formula: (= v_~flag1~0_6 1) InVars {} OutVars{~flag1~0=v_~flag1~0_6} AuxVars[] AssignedVars[~flag1~0] 12214#[L792-3, L710]don't care [203] L792-3-->L792-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 11072#[L792-4, L710]don't care [220] L792-4-->L793: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 11076#[L793, L710]don't care [210] L793-->L793-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 12604#[L793-1, L710]don't care [185] L793-1-->L793-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 12732#[L793-2, L710]don't care [161] L793-2-->L793-3: Formula: (and (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre6#1_2|)))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 12704#[L793-3, L710]don't care [307] L793-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_~f1~0=v_thr2Thread1of1ForFork1_~f1~0_10, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_~t~1=v_thr2Thread1of1ForFork1_~t~1_16, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_~f1~0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_~t~1, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base] 12634#[L710, $Ultimate##0, L793-4]don't care [252] $Ultimate##0-->L749: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 12636#[L710, L793-4, L749]don't care [253] L749-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 11300#[L751, L710, L793-4]don't care [279] L710-->L736: Formula: (= v_~flag2~0_6 v_thr1Thread1of1ForFork0_~f2~0_1) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_1, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f2~0] 11140#[L751, L736, L793-4]don't care [2023-08-18 16:43:22,505 INFO L750 eck$LassoCheckResult]: Loop: 11140#[L751, L736, L793-4]don't care [280] L736-->L715: Formula: (<= 1 v_thr1Thread1of1ForFork0_~f2~0_3) InVars {thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_3} OutVars{thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_3} AuxVars[] AssignedVars[] 11998#[L751, L793-4, L715]don't care [283] L715-->L717: Formula: (= v_~turn~0_5 v_thr1Thread1of1ForFork0_~t~0_1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t~0] 12000#[L751, L793-4, L717]don't care [286] L717-->L718: Formula: (= 0 v_thr1Thread1of1ForFork0_~t~0_5) InVars {thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_5} OutVars{thr1Thread1of1ForFork0_~t~0=v_thr1Thread1of1ForFork0_~t~0_5} AuxVars[] AssignedVars[] 11138#[L751, L718, L793-4]don't care [290] L718-->L736: Formula: (= v_~flag2~0_5 v_thr1Thread1of1ForFork0_~f2~0_7) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork0_~f2~0=v_thr1Thread1of1ForFork0_~f2~0_7, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f2~0] 11140#[L751, L736, L793-4]don't care [2023-08-18 16:43:22,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash -308880091, now seen corresponding path program 1 times [2023-08-18 16:43:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796015568] [2023-08-18 16:43:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 9546120, now seen corresponding path program 2 times [2023-08-18 16:43:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289950297] [2023-08-18 16:43:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:22,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-18 16:43:22,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1601000620, now seen corresponding path program 1 times [2023-08-18 16:43:22,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-18 16:43:22,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56894404] [2023-08-18 16:43:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-18 16:43:22,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-18 16:43:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:22,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-18 16:43:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-18 16:43:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-18 16:43:23,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.08 04:43:23 BoogieIcfgContainer [2023-08-18 16:43:23,812 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-08-18 16:43:23,813 INFO L158 Benchmark]: Toolchain (without parser) took 4287.48ms. Allocated memory is still 269.5MB. Free memory was 223.8MB in the beginning and 216.9MB in the end (delta: 6.9MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2023-08-18 16:43:23,813 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-08-18 16:43:23,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.05ms. Allocated memory is still 269.5MB. Free memory was 223.3MB in the beginning and 203.3MB in the end (delta: 20.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-08-18 16:43:23,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.55ms. Allocated memory is still 269.5MB. Free memory was 203.3MB in the beginning and 201.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-08-18 16:43:23,814 INFO L158 Benchmark]: Boogie Preprocessor took 56.50ms. Allocated memory is still 269.5MB. Free memory was 201.3MB in the beginning and 199.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-08-18 16:43:23,814 INFO L158 Benchmark]: RCFGBuilder took 359.72ms. Allocated memory is still 269.5MB. Free memory was 199.9MB in the beginning and 185.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-08-18 16:43:23,815 INFO L158 Benchmark]: BuchiAutomizer took 3364.97ms. Allocated memory is still 269.5MB. Free memory was 185.2MB in the beginning and 216.9MB in the end (delta: -31.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-08-18 16:43:23,817 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.13ms. Allocated memory is still 187.7MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.05ms. Allocated memory is still 269.5MB. Free memory was 223.3MB in the beginning and 203.3MB in the end (delta: 20.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.55ms. Allocated memory is still 269.5MB. Free memory was 203.3MB in the beginning and 201.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.50ms. Allocated memory is still 269.5MB. Free memory was 201.3MB in the beginning and 199.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 359.72ms. Allocated memory is still 269.5MB. Free memory was 199.9MB in the beginning and 185.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3364.97ms. Allocated memory is still 269.5MB. Free memory was 185.2MB in the beginning and 216.9MB in the end (delta: -31.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 1274 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 634 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 240 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 714]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L704] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L705] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L706] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L790] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={5581:0}, t2={5580:0}, turn=0, x=0] [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=25771, t1={5581:0}, t2={5580:0}, turn=0, x=0] [L709] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=25772, t1={5581:0}, t2={5580:0}, turn=0, x=0] [L750] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L712] 1 int f2 = flag2; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f2=1, flag1=1, flag2=1, turn=0, x=0] Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE !(t != 0) [L735] f2 = flag2 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 714]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L704] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L705] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L706] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L790] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={5581:0}, t2={5580:0}, turn=0, x=0] [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=25771, t1={5581:0}, t2={5580:0}, turn=0, x=0] [L709] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=25772, t1={5581:0}, t2={5580:0}, turn=0, x=0] [L750] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L712] 1 int f2 = flag2; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f2=1, flag1=1, flag2=1, turn=0, x=0] Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE !(t != 0) [L735] f2 = flag2 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-08-18 16:43:23,870 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...