/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/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-08 14:26:39,324 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-08 14:26:39,401 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-08 14:26:39,429 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-08 14:26:39,430 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-08 14:26:39,430 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-08 14:26:39,431 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-08 14:26:39,431 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-08 14:26:39,432 INFO L137 SettingsManager]: * Use SBE=true [2023-09-08 14:26:39,435 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-08 14:26:39,436 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-08 14:26:39,436 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-08 14:26:39,436 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-08 14:26:39,437 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-08 14:26:39,438 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-08 14:26:39,438 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-08 14:26:39,438 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-08 14:26:39,439 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-08 14:26:39,439 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-08 14:26:39,439 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-08 14:26:39,439 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-08 14:26:39,440 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-08 14:26:39,441 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-08 14:26:39,441 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-08 14:26:39,441 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-08 14:26:39,441 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-08 14:26:39,442 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-08 14:26:39,442 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-08 14:26:39,442 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-08 14:26:39,442 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-08 14:26:39,443 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-08 14:26:39,444 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-08 14:26:39,444 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-08 14:26:39,444 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-08 14:26:39,445 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-08 14:26:39,446 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> NONE [2023-09-08 14:26:39,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-08 14:26:39,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-08 14:26:39,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-08 14:26:39,704 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-08 14:26:39,705 INFO L274 PluginConnector]: CDTParser initialized [2023-09-08 14:26:39,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2023-09-08 14:26:40,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-08 14:26:41,141 INFO L384 CDTParser]: Found 1 translation units. [2023-09-08 14:26:41,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2023-09-08 14:26:41,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6e33f07/b75d9a479268401c96bbf981ab9a38b6/FLAGd7b8a306b [2023-09-08 14:26:41,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6e33f07/b75d9a479268401c96bbf981ab9a38b6 [2023-09-08 14:26:41,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-08 14:26:41,182 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-08 14:26:41,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-08 14:26:41,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-08 14:26:41,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-08 14:26:41,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38405acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41, skipping insertion in model container [2023-09-08 14:26:41,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-08 14:26:41,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-08 14:26:41,401 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-08 14:26:41,546 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/szymanski.i[31505,31518] [2023-09-08 14:26:41,552 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/szymanski.i[32915,32928] [2023-09-08 14:26:41,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:26:41,575 INFO L203 MainTranslator]: Completed pre-run [2023-09-08 14:26:41,589 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-08 14:26:41,606 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/szymanski.i[31505,31518] [2023-09-08 14:26:41,609 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/szymanski.i[32915,32928] [2023-09-08 14:26:41,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-08 14:26:41,643 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:26:41,643 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:26:41,643 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-08 14:26:41,649 INFO L208 MainTranslator]: Completed translation [2023-09-08 14:26:41,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41 WrapperNode [2023-09-08 14:26:41,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-08 14:26:41,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-08 14:26:41,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-08 14:26:41,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-08 14:26:41,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,703 INFO L138 Inliner]: procedures = 171, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-09-08 14:26:41,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-08 14:26:41,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-08 14:26:41,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-08 14:26:41,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-08 14:26:41,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-08 14:26:41,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-08 14:26:41,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-08 14:26:41,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-08 14:26:41,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (1/1) ... [2023-09-08 14:26:41,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-08 14:26:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-08 14:26:41,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-08 14:26:41,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-09-08 14:26:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-08 14:26:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-09-08 14:26:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-09-08 14:26:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-09-08 14:26:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-09-08 14:26:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-08 14:26:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-08 14:26:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-08 14:26:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-08 14:26:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-08 14:26:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-08 14:26:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-08 14:26:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-08 14:26:41,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-08 14:26:41,831 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-08 14:26:41,945 INFO L236 CfgBuilder]: Building ICFG [2023-09-08 14:26:41,947 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-08 14:26:42,097 INFO L277 CfgBuilder]: Performing block encoding [2023-09-08 14:26:42,103 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-08 14:26:42,103 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-09-08 14:26:42,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:26:42 BoogieIcfgContainer [2023-09-08 14:26:42,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-08 14:26:42,106 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-08 14:26:42,106 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-08 14:26:42,110 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-08 14:26:42,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:26:42,111 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.09 02:26:41" (1/3) ... [2023-09-08 14:26:42,113 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46edddc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:26:42, skipping insertion in model container [2023-09-08 14:26:42,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:26:42,114 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:26:41" (2/3) ... [2023-09-08 14:26:42,115 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46edddc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.09 02:26:42, skipping insertion in model container [2023-09-08 14:26:42,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-08 14:26:42,115 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:26:42" (3/3) ... [2023-09-08 14:26:42,116 INFO L332 chiAutomizerObserver]: Analyzing ICFG szymanski.i [2023-09-08 14:26:42,223 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-08 14:26:42,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 113 transitions, 242 flow [2023-09-08 14:26:42,288 INFO L124 PetriNetUnfolderBase]: 20/109 cut-off events. [2023-09-08 14:26:42,289 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-09-08 14:26:42,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 20/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2023-09-08 14:26:42,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 113 transitions, 242 flow [2023-09-08 14:26:42,301 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 109 transitions, 230 flow [2023-09-08 14:26:42,313 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-08 14:26:42,313 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-08 14:26:42,316 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-08 14:26:42,317 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-08 14:26:42,317 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-08 14:26:42,317 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-08 14:26:42,317 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-08 14:26:42,317 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-08 14:26:42,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-08 14:26:42,637 INFO L131 ngComponentsAnalysis]: Automaton has 676 accepting balls. 1480 [2023-09-08 14:26:42,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:26:42,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:26:42,644 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] [2023-09-08 14:26:42,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:26:42,644 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-08 14:26:42,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2964 states, but on-demand construction may add more states [2023-09-08 14:26:42,704 INFO L131 ngComponentsAnalysis]: Automaton has 676 accepting balls. 1480 [2023-09-08 14:26:42,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:26:42,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:26:42,705 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] [2023-09-08 14:26:42,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:26:42,713 INFO L748 eck$LassoCheckResult]: Stem: 101#[$Ultimate##0]don't care [239] $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] 104#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 106#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 108#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 110#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 112#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 114#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 116#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 118#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 120#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 122#[L-1-2]don't care [296] 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] 124#[L-1-3]don't care [298] L-1-3-->L817: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 126#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 128#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 130#[L817-2]don't care [207] L817-2-->L818: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 132#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 134#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 136#[L818-2]don't care [382] L818-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_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, 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_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 138#[$Ultimate##0, L818-3]don't care [345] $Ultimate##0-->L703: 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] 142#[L703, L818-3]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 148#[L705, L818-3]don't care [347] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 156#[L712, L818-3]don't care [2023-09-08 14:26:42,714 INFO L750 eck$LassoCheckResult]: Loop: 156#[L712, L818-3]don't care [348] L712-->L710: Formula: (<= 3 v_thr1Thread1of1ForFork0_~f21~0_3) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} AuxVars[] AssignedVars[] 166#[L710, L818-3]don't care [351] L710-->L712: Formula: (= v_thr1Thread1of1ForFork0_~f21~0_7 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_7, ~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 156#[L712, L818-3]don't care [2023-09-08 14:26:42,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1499277610, now seen corresponding path program 1 times [2023-09-08 14:26:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148562332] [2023-09-08 14:26:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:42,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:42,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:42,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 12100, now seen corresponding path program 1 times [2023-09-08 14:26:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560766937] [2023-09-08 14:26:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:42,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:42,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:42,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1991727911, now seen corresponding path program 1 times [2023-09-08 14:26:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424874632] [2023-09-08 14:26:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:26:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:26:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 14:26:43,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424874632] [2023-09-08 14:26:43,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424874632] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 14:26:43,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 14:26:43,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 14:26:43,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761701560] [2023-09-08 14:26:43,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 14:26:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 14:26:43,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 14:26:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 14:26:43,191 INFO L87 Difference]: Start difference. First operand currently 2964 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-09-08 14:26:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-08 14:26:43,415 INFO L93 Difference]: Finished difference Result 4508 states and 13098 transitions. [2023-09-08 14:26:43,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4508 states and 13098 transitions. [2023-09-08 14:26:43,472 INFO L131 ngComponentsAnalysis]: Automaton has 852 accepting balls. 1832 [2023-09-08 14:26:43,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4508 states to 3928 states and 11529 transitions. [2023-09-08 14:26:43,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3928 [2023-09-08 14:26:43,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3928 [2023-09-08 14:26:43,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3928 states and 11529 transitions. [2023-09-08 14:26:43,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:26:43,619 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3928 states and 11529 transitions. [2023-09-08 14:26:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states and 11529 transitions. [2023-09-08 14:26:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 2879. [2023-09-08 14:26:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2879 states have (on average 2.975686002084057) internal successors, (8567), 2878 states have internal predecessors, (8567), 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-09-08 14:26:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 8567 transitions. [2023-09-08 14:26:43,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2879 states and 8567 transitions. [2023-09-08 14:26:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 14:26:43,778 INFO L428 stractBuchiCegarLoop]: Abstraction has 2879 states and 8567 transitions. [2023-09-08 14:26:43,778 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-08 14:26:43,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2879 states and 8567 transitions. [2023-09-08 14:26:43,800 INFO L131 ngComponentsAnalysis]: Automaton has 648 accepting balls. 1424 [2023-09-08 14:26:43,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:26:43,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:26:43,801 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] [2023-09-08 14:26:43,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:26:43,803 INFO L748 eck$LassoCheckResult]: Stem: 11973#[$Ultimate##0]don't care [239] $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] 11975#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 13993#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 13995#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 16051#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 14459#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 14461#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 13257#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 13259#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 15121#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 15555#[L-1-2]don't care [296] 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] 14891#[L-1-3]don't care [298] L-1-3-->L817: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 11055#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 11057#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 16137#[L817-2]don't care [207] L817-2-->L818: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 15165#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 15167#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 10769#[L818-2]don't care [382] L818-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_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, 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_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 10771#[$Ultimate##0, L818-3]don't care [273] L818-3-->L818-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 11125#[$Ultimate##0, L818-4]don't care [253] L818-4-->L819: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 11129#[L819, $Ultimate##0]don't care [272] L819-->L819-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 15993#[$Ultimate##0, L819-1]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 11495#[$Ultimate##0, L819-2]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 11499#[L819-3, $Ultimate##0]don't care [385] L819-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_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_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 11527#[L819-4, $Ultimate##0, $Ultimate##0]don't care [310] $Ultimate##0-->L760: 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] 16081#[L760, L819-4, $Ultimate##0]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 14887#[L819-4, L762, $Ultimate##0]don't care [312] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 13185#[L819-4, L769, $Ultimate##0]don't care [2023-09-08 14:26:43,803 INFO L750 eck$LassoCheckResult]: Loop: 13185#[L819-4, L769, $Ultimate##0]don't care [313] L769-->L767: Formula: (<= 3 v_thr2Thread1of1ForFork1_~f12~0_3) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 13179#[L767, L819-4, $Ultimate##0]don't care [316] L767-->L769: Formula: (= v_~flag1~0_3 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 13185#[L819-4, L769, $Ultimate##0]don't care [2023-09-08 14:26:43,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash -550132775, now seen corresponding path program 1 times [2023-09-08 14:26:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:43,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848870797] [2023-09-08 14:26:43,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:43,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:43,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:43,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:43,860 INFO L85 PathProgramCache]: Analyzing trace with hash 10980, now seen corresponding path program 1 times [2023-09-08 14:26:43,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:43,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30655486] [2023-09-08 14:26:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:43,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:43,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:43,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -396609348, now seen corresponding path program 1 times [2023-09-08 14:26:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761280454] [2023-09-08 14:26:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:26:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:26:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 14:26:43,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761280454] [2023-09-08 14:26:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761280454] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 14:26:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 14:26:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 14:26:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22910443] [2023-09-08 14:26:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 14:26:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 14:26:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 14:26:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 14:26:43,952 INFO L87 Difference]: Start difference. First operand 2879 states and 8567 transitions. cyclomatic complexity: 6336 Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-09-08 14:26:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-08 14:26:44,109 INFO L93 Difference]: Finished difference Result 4154 states and 12105 transitions. [2023-09-08 14:26:44,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4154 states and 12105 transitions. [2023-09-08 14:26:44,149 INFO L131 ngComponentsAnalysis]: Automaton has 791 accepting balls. 1710 [2023-09-08 14:26:44,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4154 states to 3723 states and 10957 transitions. [2023-09-08 14:26:44,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3723 [2023-09-08 14:26:44,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3723 [2023-09-08 14:26:44,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3723 states and 10957 transitions. [2023-09-08 14:26:44,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:26:44,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3723 states and 10957 transitions. [2023-09-08 14:26:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states and 10957 transitions. [2023-09-08 14:26:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 2893. [2023-09-08 14:26:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2893 states have (on average 2.979260283442793) internal successors, (8619), 2892 states have internal predecessors, (8619), 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-09-08 14:26:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 8619 transitions. [2023-09-08 14:26:44,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2893 states and 8619 transitions. [2023-09-08 14:26:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 14:26:44,385 INFO L428 stractBuchiCegarLoop]: Abstraction has 2893 states and 8619 transitions. [2023-09-08 14:26:44,385 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-09-08 14:26:44,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2893 states and 8619 transitions. [2023-09-08 14:26:44,405 INFO L131 ngComponentsAnalysis]: Automaton has 635 accepting balls. 1398 [2023-09-08 14:26:44,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:26:44,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:26:44,407 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] [2023-09-08 14:26:44,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:26:44,408 INFO L748 eck$LassoCheckResult]: Stem: 21672#[$Ultimate##0]don't care [239] $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] 21674#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 23518#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 23520#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 25680#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 23968#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 23970#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 22826#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 22828#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 24638#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 25070#[L-1-2]don't care [296] 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] 24416#[L-1-3]don't care [298] L-1-3-->L817: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 20922#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 20924#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 25778#[L817-2]don't care [207] L817-2-->L818: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 24688#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 24690#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 20674#[L818-2]don't care [382] L818-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_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, 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_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 20676#[$Ultimate##0, L818-3]don't care [273] L818-3-->L818-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 20974#[$Ultimate##0, L818-4]don't care [345] $Ultimate##0-->L703: 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] 20976#[L703, L818-4]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 23932#[L705, L818-4]don't care [253] L818-4-->L819: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 24996#[L819, L705]don't care [272] L819-->L819-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 23168#[L705, L819-1]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 24614#[L705, L819-2]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 22792#[L819-3, L705]don't care [385] L819-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_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_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 25742#[L819-4, L705, $Ultimate##0]don't care [310] $Ultimate##0-->L760: 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] 21644#[L760, L819-4, L705]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 20758#[L819-4, L762, L705]don't care [312] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 20760#[L819-4, L705, L769]don't care [2023-09-08 14:26:44,409 INFO L750 eck$LassoCheckResult]: Loop: 20760#[L819-4, L705, L769]don't care [313] L769-->L767: Formula: (<= 3 v_thr2Thread1of1ForFork1_~f12~0_3) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 24500#[L819-4, L705, L767]don't care [316] L767-->L769: Formula: (= v_~flag1~0_3 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 20760#[L819-4, L705, L769]don't care [2023-09-08 14:26:44,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash -75534662, now seen corresponding path program 1 times [2023-09-08 14:26:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:44,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958143100] [2023-09-08 14:26:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:44,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:44,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:44,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 10980, now seen corresponding path program 2 times [2023-09-08 14:26:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945812683] [2023-09-08 14:26:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:44,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:44,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:44,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash 425643869, now seen corresponding path program 1 times [2023-09-08 14:26:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:44,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400031903] [2023-09-08 14:26:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:44,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:26:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:26:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 14:26:44,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400031903] [2023-09-08 14:26:44,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400031903] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 14:26:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 14:26:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 14:26:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701388561] [2023-09-08 14:26:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 14:26:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 14:26:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 14:26:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 14:26:44,627 INFO L87 Difference]: Start difference. First operand 2893 states and 8619 transitions. cyclomatic complexity: 6361 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-09-08 14:26:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-08 14:26:44,741 INFO L93 Difference]: Finished difference Result 3882 states and 11324 transitions. [2023-09-08 14:26:44,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3882 states and 11324 transitions. [2023-09-08 14:26:44,776 INFO L131 ngComponentsAnalysis]: Automaton has 795 accepting balls. 1694 [2023-09-08 14:26:44,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3882 states to 3874 states and 11310 transitions. [2023-09-08 14:26:44,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3874 [2023-09-08 14:26:44,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3874 [2023-09-08 14:26:44,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3874 states and 11310 transitions. [2023-09-08 14:26:44,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:26:44,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3874 states and 11310 transitions. [2023-09-08 14:26:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states and 11310 transitions. [2023-09-08 14:26:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 2885. [2023-09-08 14:26:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2885 states have (on average 2.9493934142114386) internal successors, (8509), 2884 states have internal predecessors, (8509), 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-09-08 14:26:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 8509 transitions. [2023-09-08 14:26:44,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2885 states and 8509 transitions. [2023-09-08 14:26:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 14:26:44,971 INFO L428 stractBuchiCegarLoop]: Abstraction has 2885 states and 8509 transitions. [2023-09-08 14:26:44,971 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-09-08 14:26:44,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2885 states and 8509 transitions. [2023-09-08 14:26:44,991 INFO L131 ngComponentsAnalysis]: Automaton has 611 accepting balls. 1326 [2023-09-08 14:26:44,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:26:44,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:26:44,993 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] [2023-09-08 14:26:44,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:26:44,994 INFO L748 eck$LassoCheckResult]: Stem: 31319#[$Ultimate##0]don't care [239] $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] 31321#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 33115#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 33117#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 35289#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 33567#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 33569#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 32465#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 32467#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 34197#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 34661#[L-1-2]don't care [296] 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] 33985#[L-1-3]don't care [298] L-1-3-->L817: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 30575#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 30577#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 35389#[L817-2]don't care [207] L817-2-->L818: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 34249#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 34251#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 30349#[L818-2]don't care [382] L818-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_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, 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_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 30351#[$Ultimate##0, L818-3]don't care [273] L818-3-->L818-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 30637#[$Ultimate##0, L818-4]don't care [345] $Ultimate##0-->L703: 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] 30639#[L703, L818-4]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 33527#[L705, L818-4]don't care [253] L818-4-->L819: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 34583#[L819, L705]don't care [272] L819-->L819-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 32805#[L705, L819-1]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 34175#[L705, L819-2]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 32427#[L819-3, L705]don't care [385] L819-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_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_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 35349#[L819-4, L705, $Ultimate##0]don't care [310] $Ultimate##0-->L760: 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] 31291#[L760, L819-4, L705]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 30431#[L819-4, L762, L705]don't care [347] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 30437#[L819-4, L762, L712]don't care [2023-09-08 14:26:44,994 INFO L750 eck$LassoCheckResult]: Loop: 30437#[L819-4, L762, L712]don't care [348] L712-->L710: Formula: (<= 3 v_thr1Thread1of1ForFork0_~f21~0_3) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3} AuxVars[] AssignedVars[] 35337#[L710, L819-4, L762]don't care [351] L710-->L712: Formula: (= v_thr1Thread1of1ForFork0_~f21~0_7 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_7, ~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 30437#[L819-4, L762, L712]don't care [2023-09-08 14:26:44,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash -75534627, now seen corresponding path program 1 times [2023-09-08 14:26:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:44,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606335828] [2023-09-08 14:26:44,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:45,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 12100, now seen corresponding path program 2 times [2023-09-08 14:26:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247804119] [2023-09-08 14:26:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:45,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 425678624, now seen corresponding path program 1 times [2023-09-08 14:26:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:45,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890049545] [2023-09-08 14:26:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-08 14:26:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-08 14:26:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-08 14:26:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890049545] [2023-09-08 14:26:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890049545] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-08 14:26:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-08 14:26:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-08 14:26:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944868906] [2023-09-08 14:26:45,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-08 14:26:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-08 14:26:45,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-08 14:26:45,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-08 14:26:45,109 INFO L87 Difference]: Start difference. First operand 2885 states and 8509 transitions. cyclomatic complexity: 6235 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-09-08 14:26:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-08 14:26:45,211 INFO L93 Difference]: Finished difference Result 3808 states and 11012 transitions. [2023-09-08 14:26:45,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3808 states and 11012 transitions. [2023-09-08 14:26:45,290 INFO L131 ngComponentsAnalysis]: Automaton has 754 accepting balls. 1596 [2023-09-08 14:26:45,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3808 states to 3800 states and 10998 transitions. [2023-09-08 14:26:45,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3800 [2023-09-08 14:26:45,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3800 [2023-09-08 14:26:45,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3800 states and 10998 transitions. [2023-09-08 14:26:45,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-08 14:26:45,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3800 states and 10998 transitions. [2023-09-08 14:26:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states and 10998 transitions. [2023-09-08 14:26:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 2889. [2023-09-08 14:26:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2889 states have (on average 2.924195223260644) internal successors, (8448), 2888 states have internal predecessors, (8448), 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-09-08 14:26:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 8448 transitions. [2023-09-08 14:26:45,427 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2889 states and 8448 transitions. [2023-09-08 14:26:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-08 14:26:45,429 INFO L428 stractBuchiCegarLoop]: Abstraction has 2889 states and 8448 transitions. [2023-09-08 14:26:45,429 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-09-08 14:26:45,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2889 states and 8448 transitions. [2023-09-08 14:26:45,448 INFO L131 ngComponentsAnalysis]: Automaton has 591 accepting balls. 1270 [2023-09-08 14:26:45,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-08 14:26:45,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-08 14:26:45,449 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-09-08 14:26:45,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-09-08 14:26:45,451 INFO L748 eck$LassoCheckResult]: Stem: 40882#[$Ultimate##0]don't care [239] $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] 40884#[L-1]don't care [254] L-1-->L-1-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 42596#[L-1-1]don't care [292] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 42598#[L12]don't care [220] L12-->L12-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 44742#[L12-1]don't care [247] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 43030#[L12-2]don't care [245] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 43032#[L12-3]don't care [279] L12-3-->L12-4: Formula: (and (= 12 (select |v_#length_2| 2)) (= (select |v_#valid_7| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 41978#[L12-4]don't care [269] L12-4-->L700: Formula: (= v_~flag1~0_15 0) InVars {} OutVars{~flag1~0=v_~flag1~0_15} AuxVars[] AssignedVars[~flag1~0] 41980#[L700]don't care [295] L700-->L701: Formula: (= v_~flag2~0_15 0) InVars {} OutVars{~flag2~0=v_~flag2~0_15} AuxVars[] AssignedVars[~flag2~0] 43650#[L701]don't care [283] L701-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 44116#[L-1-2]don't care [296] 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] 43448#[L-1-3]don't care [298] L-1-3-->L817: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} 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] 40152#[L817]don't care [293] L817-->L817-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 40154#[L817-1]don't care [205] L817-1-->L817-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 44872#[L817-2]don't care [207] L817-2-->L818: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 43700#[L818]don't care [221] L818-->L818-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 43702#[L818-1]don't care [226] L818-1-->L818-2: Formula: (and (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_5|)) InVars {#valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] 39936#[L818-2]don't care [382] L818-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_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, 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_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 39938#[$Ultimate##0, L818-3]don't care [273] L818-3-->L818-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 40214#[$Ultimate##0, L818-4]don't care [345] $Ultimate##0-->L703: 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] 40216#[L703, L818-4]don't care [346] L703-->L705: Formula: (= v_~flag1~0_10 1) InVars {} OutVars{~flag1~0=v_~flag1~0_10} AuxVars[] AssignedVars[~flag1~0] 42994#[L705, L818-4]don't care [347] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 44944#[L712, L818-4]don't care [349] L712-->L709-1: Formula: (< v_thr1Thread1of1ForFork0_~f21~0_5 3) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_5} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_5} AuxVars[] AssignedVars[] 41774#[L709-1, L818-4]don't care [352] L709-1-->L716: Formula: (= v_~flag1~0_12 3) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0] 42410#[L716, L818-4]don't care [253] L818-4-->L819: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 42414#[L819, L716]don't care [272] L819-->L819-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 43172#[L716, L819-1]don't care [214] L819-1-->L819-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 39798#[L716, L819-2]don't care [249] L819-2-->L819-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_5|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] 39810#[L819-3, L716]don't care [385] L819-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_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_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 44672#[L819-4, L716, $Ultimate##0]don't care [310] $Ultimate##0-->L760: 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] 43764#[L760, L819-4, L716]don't care [311] L760-->L762: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 41288#[L819-4, L762, L716]don't care [312] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 41292#[L819-4, L716, L769]don't care [2023-09-08 14:26:45,451 INFO L750 eck$LassoCheckResult]: Loop: 41292#[L819-4, L716, L769]don't care [313] L769-->L767: Formula: (<= 3 v_thr2Thread1of1ForFork1_~f12~0_3) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 43802#[L819-4, L716, L767]don't care [316] L767-->L769: Formula: (= v_~flag1~0_3 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 41292#[L819-4, L716, L769]don't care [2023-09-08 14:26:45,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1002807460, now seen corresponding path program 1 times [2023-09-08 14:26:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289315973] [2023-09-08 14:26:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:45,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 10980, now seen corresponding path program 3 times [2023-09-08 14:26:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378532686] [2023-09-08 14:26:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:45,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-08 14:26:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1625284737, now seen corresponding path program 1 times [2023-09-08 14:26:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-08 14:26:45,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671021515] [2023-09-08 14:26:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-08 14:26:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-08 14:26:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:45,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-08 14:26:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:46,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-08 14:26:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-08 14:26:46,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.09 02:26:46 BoogieIcfgContainer [2023-09-08 14:26:46,569 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-08 14:26:46,569 INFO L158 Benchmark]: Toolchain (without parser) took 5386.87ms. Allocated memory was 190.8MB in the beginning and 461.4MB in the end (delta: 270.5MB). Free memory was 142.6MB in the beginning and 246.7MB in the end (delta: -104.1MB). Peak memory consumption was 166.8MB. Max. memory is 8.0GB. [2023-09-08 14:26:46,570 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-08 14:26:46,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.90ms. Allocated memory is still 190.8MB. Free memory was 142.3MB in the beginning and 122.0MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-09-08 14:26:46,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.10ms. Allocated memory is still 190.8MB. Free memory was 122.0MB in the beginning and 119.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:26:46,571 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 190.8MB. Free memory was 119.9MB in the beginning and 118.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-08 14:26:46,571 INFO L158 Benchmark]: RCFGBuilder took 355.65ms. Allocated memory is still 190.8MB. Free memory was 118.5MB in the beginning and 103.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-09-08 14:26:46,572 INFO L158 Benchmark]: BuchiAutomizer took 4463.06ms. Allocated memory was 190.8MB in the beginning and 461.4MB in the end (delta: 270.5MB). Free memory was 103.5MB in the beginning and 246.7MB in the end (delta: -143.3MB). Peak memory consumption was 128.0MB. Max. memory is 8.0GB. [2023-09-08 14:26:46,574 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.12ms. Allocated memory is still 190.8MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.90ms. Allocated memory is still 190.8MB. Free memory was 142.3MB in the beginning and 122.0MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.10ms. Allocated memory is still 190.8MB. Free memory was 122.0MB in the beginning and 119.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 190.8MB. Free memory was 119.9MB in the beginning and 118.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 355.65ms. Allocated memory is still 190.8MB. Free memory was 118.5MB in the beginning and 103.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 4463.06ms. Allocated memory was 190.8MB in the beginning and 461.4MB in the end (delta: 270.5MB). Free memory was 103.5MB in the beginning and 246.7MB in the end (delta: -143.3MB). Peak memory consumption was 128.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 2889 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 4 MinimizatonAttempts, 3779 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.4s 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, 444 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 1211 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 683 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 301 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 528 mSDtfsCounter, 301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 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: 766]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int x; VAL [flag1=0, flag2=0, x=0] [L817] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={9557:0}, t2={9556:0}, x=0] [L818] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=2763, t1={9557:0}, t2={9556:0}, x=0] [L704] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L707] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, x=0] [L709] COND FALSE 1 !(f21 >= 3) VAL [_={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, x=0] [L715] 1 flag1 = 3 VAL [_={0:0}, _={0:0}, f21=0, flag1=3, flag2=0, x=0] [L819] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, f21=0, flag1=3, flag2=0, pthread_create(&t2, 0, thr2, 0)=2764, t1={9557:0}, t2={9556:0}, x=0] [L761] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=3, flag2=1, x=0] [L764] 2 int f12 = flag1; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f12=3, f21=0, flag1=3, flag2=1, x=0] Loop: [L766] COND TRUE f12 >= 3 [L768] f12 = flag1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 766]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int x; VAL [flag1=0, flag2=0, x=0] [L817] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={9557:0}, t2={9556:0}, x=0] [L818] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=2763, t1={9557:0}, t2={9556:0}, x=0] [L704] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L707] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, x=0] [L709] COND FALSE 1 !(f21 >= 3) VAL [_={0:0}, _={0:0}, f21=0, flag1=1, flag2=0, x=0] [L715] 1 flag1 = 3 VAL [_={0:0}, _={0:0}, f21=0, flag1=3, flag2=0, x=0] [L819] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [_={0:0}, _={0:0}, _={0:0}, f21=0, flag1=3, flag2=0, pthread_create(&t2, 0, thr2, 0)=2764, t1={9557:0}, t2={9556:0}, x=0] [L761] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=0, flag1=3, flag2=1, x=0] [L764] 2 int f12 = flag1; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f12=3, f21=0, flag1=3, flag2=1, x=0] Loop: [L766] COND TRUE f12 >= 3 [L768] f12 = flag1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-09-08 14:26:46,661 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...