/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/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:10:23,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:10:23,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:10:23,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:10:23,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:10:23,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:10:23,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:10:23,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:10:23,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:10:23,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:10:23,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:10:23,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:10:23,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:10:23,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:10:23,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:10:23,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:10:23,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:10:23,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:10:23,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:10:23,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:10:23,330 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:10:23,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:10:23,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:10:23,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:10:23,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:10:23,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:10:23,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:10:23,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:10:23,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:10:23,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:10:23,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:10:23,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:10:23,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:10:23,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:10:23,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:10:23,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:10:23,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:10:23,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:10:23,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:10:23,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:10:23,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:10:23,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:10:23,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:10:23,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:10:23,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:10:23,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:10:23,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:10:23,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:10:23,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:10:23,430 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:10:23,430 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:10:23,431 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:10:23,432 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:10:23,432 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:10:23,432 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:10:23,432 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:10:23,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:10:23,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:10:23,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:10:23,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:10:23,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:10:23,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:10:23,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:10:23,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:10:23,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:10:23,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:10:23,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:10:23,435 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:10:23,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:10:23,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:10:23,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:10:23,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:10:23,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:10:23,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:10:23,439 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:10:23,439 INFO L138 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 [2022-07-22 12:10:23,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:10:23,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:10:23,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:10:23,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:10:23,836 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:10:23,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski-b.i [2022-07-22 12:10:23,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1dcad271/31a05441efcb496fbfbd168f4de0fb37/FLAGeac2ff130 [2022-07-22 12:10:24,514 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:10:24,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski-b.i [2022-07-22 12:10:24,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1dcad271/31a05441efcb496fbfbd168f4de0fb37/FLAGeac2ff130 [2022-07-22 12:10:24,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1dcad271/31a05441efcb496fbfbd168f4de0fb37 [2022-07-22 12:10:24,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:10:24,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:10:24,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:10:24,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:10:24,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:10:24,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:10:24" (1/1) ... [2022-07-22 12:10:24,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d22e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:24, skipping insertion in model container [2022-07-22 12:10:24,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:10:24" (1/1) ... [2022-07-22 12:10:24,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:10:24,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:10:25,202 WARN L230 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-b.i[30088,30101] [2022-07-22 12:10:25,206 WARN L230 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-b.i[30375,30388] [2022-07-22 12:10:25,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:10:25,223 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:10:25,267 WARN L230 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-b.i[30088,30101] [2022-07-22 12:10:25,269 WARN L230 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-b.i[30375,30388] [2022-07-22 12:10:25,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:10:25,329 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:10:25,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25 WrapperNode [2022-07-22 12:10:25,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:10:25,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:10:25,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:10:25,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:10:25,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,417 INFO L137 Inliner]: procedures = 167, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-07-22 12:10:25,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:10:25,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:10:25,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:10:25,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:10:25,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:10:25,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:10:25,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:10:25,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:10:25,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:10:25,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:10:25,530 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) [2022-07-22 12:10:25,537 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 [2022-07-22 12:10:25,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:10:25,596 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:10:25,596 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:10:25,596 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:10:25,596 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:10:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:10:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:10:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:10:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:10:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:10:25,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:10:25,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:10:25,601 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:10:25,748 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:10:25,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:10:25,958 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:10:25,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:10:25,970 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 12:10:25,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:10:25 BoogieIcfgContainer [2022-07-22 12:10:25,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:10:25,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:10:25,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:10:25,980 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:10:25,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:10:25,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:10:24" (1/3) ... [2022-07-22 12:10:25,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea88f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:10:25, skipping insertion in model container [2022-07-22 12:10:25,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:10:25,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (2/3) ... [2022-07-22 12:10:25,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ea88f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:10:25, skipping insertion in model container [2022-07-22 12:10:25,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:10:25,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:10:25" (3/3) ... [2022-07-22 12:10:25,986 INFO L322 chiAutomizerObserver]: Analyzing ICFG szymanski-b.i [2022-07-22 12:10:26,130 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:10:26,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 101 transitions, 218 flow [2022-07-22 12:10:26,226 INFO L129 PetriNetUnfolder]: 20/97 cut-off events. [2022-07-22 12:10:26,226 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:10:26,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 97 events. 20/97 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2022-07-22 12:10:26,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 101 transitions, 218 flow [2022-07-22 12:10:26,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 97 transitions, 206 flow [2022-07-22 12:10:26,250 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:10:26,269 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 97 transitions, 206 flow [2022-07-22 12:10:26,277 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 97 transitions, 206 flow [2022-07-22 12:10:26,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 97 transitions, 206 flow [2022-07-22 12:10:26,331 INFO L129 PetriNetUnfolder]: 20/97 cut-off events. [2022-07-22 12:10:26,331 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:10:26,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 97 events. 20/97 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 65. Up to 3 conditions per place. [2022-07-22 12:10:26,341 INFO L116 LiptonReduction]: Number of co-enabled transitions 2268 [2022-07-22 12:10:28,467 INFO L131 LiptonReduction]: Checked pairs total: 5186 [2022-07-22 12:10:28,467 INFO L133 LiptonReduction]: Total number of compositions: 60 [2022-07-22 12:10:28,492 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:10:28,492 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:10:28,492 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:10:28,493 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:10:28,493 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:10:28,493 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:10:28,493 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:10:28,493 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:10:28,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:10:28,643 INFO L131 ngComponentsAnalysis]: Automaton has 176 accepting balls. 176 [2022-07-22 12:10:28,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:28,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:28,652 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:10:28,652 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:28,653 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:10:28,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 339 states, but on-demand construction may add more states [2022-07-22 12:10:28,680 INFO L131 ngComponentsAnalysis]: Automaton has 176 accepting balls. 176 [2022-07-22 12:10:28,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:28,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:28,681 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:10:28,683 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:28,689 INFO L748 eck$LassoCheckResult]: Stem: 89#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= v_~flag1~0_136 0) (= 48 (select .cse0 0)) (= v_~flag2~0_142 0) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= v_~x~0_89 0) (= 2 (select |v_#length_56| 1)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_142, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_136, #length=|v_#length_55|, ~x~0=v_~x~0_89, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 92#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 94#[thr1ENTRY, L720-3]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_38 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_38, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 98#[L688-2, L720-3]don't care [2022-07-22 12:10:28,689 INFO L750 eck$LassoCheckResult]: Loop: 98#[L688-2, L720-3]don't care [315] L688-2-->L688-2: Formula: (<= 3 v_~flag2~0_9) InVars {~flag2~0=v_~flag2~0_9} OutVars{~flag2~0=v_~flag2~0_9} AuxVars[] AssignedVars[] 98#[L688-2, L720-3]don't care [2022-07-22 12:10:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 429898, now seen corresponding path program 1 times [2022-07-22 12:10:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734836483] [2022-07-22 12:10:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:28,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:28,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:28,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash 346, now seen corresponding path program 1 times [2022-07-22 12:10:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:28,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262995143] [2022-07-22 12:10:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:28,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:28,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:28,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 13327153, now seen corresponding path program 1 times [2022-07-22 12:10:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:28,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439314399] [2022-07-22 12:10:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:10:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:29,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439314399] [2022-07-22 12:10:29,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439314399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:29,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:10:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29021168] [2022-07-22 12:10:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:10:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:10:29,099 INFO L87 Difference]: Start difference. First operand currently 339 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-07-22 12:10:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:29,240 INFO L93 Difference]: Finished difference Result 332 states and 980 transitions. [2022-07-22 12:10:29,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 980 transitions. [2022-07-22 12:10:29,251 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 154 [2022-07-22 12:10:29,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 302 states and 912 transitions. [2022-07-22 12:10:29,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2022-07-22 12:10:29,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2022-07-22 12:10:29,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 912 transitions. [2022-07-22 12:10:29,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:29,291 INFO L220 hiAutomatonCegarLoop]: Abstraction has 302 states and 912 transitions. [2022-07-22 12:10:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 912 transitions. [2022-07-22 12:10:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-07-22 12:10:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 302 states have (on average 3.019867549668874) internal successors, (912), 301 states have internal predecessors, (912), 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) [2022-07-22 12:10:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 912 transitions. [2022-07-22 12:10:29,423 INFO L242 hiAutomatonCegarLoop]: Abstraction has 302 states and 912 transitions. [2022-07-22 12:10:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:10:29,432 INFO L425 stractBuchiCegarLoop]: Abstraction has 302 states and 912 transitions. [2022-07-22 12:10:29,433 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:10:29,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 912 transitions. [2022-07-22 12:10:29,442 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 154 [2022-07-22 12:10:29,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:29,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:29,443 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:10:29,443 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:29,444 INFO L748 eck$LassoCheckResult]: Stem: 1712#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= v_~flag1~0_136 0) (= 48 (select .cse0 0)) (= v_~flag2~0_142 0) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= v_~x~0_89 0) (= 2 (select |v_#length_56| 1)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_142, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_136, #length=|v_#length_55|, ~x~0=v_~x~0_89, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 1710#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 1592#[thr1ENTRY, L720-3]don't care [401] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 1172#[L721-3, thr1ENTRY]don't care [343] L721-3-->thr2ENTRY: 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~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, 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_~_.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_~_.base] 1174#[thr1ENTRY, thr2ENTRY, L721-4]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1362#[thr1ENTRY, L704-2, L721-4]don't care [2022-07-22 12:10:29,444 INFO L750 eck$LassoCheckResult]: Loop: 1362#[thr1ENTRY, L704-2, L721-4]don't care [288] L704-2-->L704-2: Formula: (<= 3 v_~flag1~0_3) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[] 1362#[thr1ENTRY, L704-2, L721-4]don't care [2022-07-22 12:10:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 413180436, now seen corresponding path program 1 times [2022-07-22 12:10:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213742214] [2022-07-22 12:10:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 1 times [2022-07-22 12:10:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762459369] [2022-07-22 12:10:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash -76308084, now seen corresponding path program 1 times [2022-07-22 12:10:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993561052] [2022-07-22 12:10:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:10:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:29,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993561052] [2022-07-22 12:10:29,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993561052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:29,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:29,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:10:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002121717] [2022-07-22 12:10:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:29,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:10:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:10:29,637 INFO L87 Difference]: Start difference. First operand 302 states and 912 transitions. cyclomatic complexity: 764 Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2022-07-22 12:10:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:29,721 INFO L93 Difference]: Finished difference Result 298 states and 872 transitions. [2022-07-22 12:10:29,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 872 transitions. [2022-07-22 12:10:29,727 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 134 [2022-07-22 12:10:29,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 264 states and 800 transitions. [2022-07-22 12:10:29,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2022-07-22 12:10:29,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2022-07-22 12:10:29,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 800 transitions. [2022-07-22 12:10:29,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:29,740 INFO L220 hiAutomatonCegarLoop]: Abstraction has 264 states and 800 transitions. [2022-07-22 12:10:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 800 transitions. [2022-07-22 12:10:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-07-22 12:10:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 264 states have (on average 3.0303030303030303) internal successors, (800), 263 states have internal predecessors, (800), 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) [2022-07-22 12:10:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 800 transitions. [2022-07-22 12:10:29,760 INFO L242 hiAutomatonCegarLoop]: Abstraction has 264 states and 800 transitions. [2022-07-22 12:10:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:10:29,762 INFO L425 stractBuchiCegarLoop]: Abstraction has 264 states and 800 transitions. [2022-07-22 12:10:29,762 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:10:29,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 800 transitions. [2022-07-22 12:10:29,766 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 134 [2022-07-22 12:10:29,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:29,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:29,767 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:10:29,767 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:29,767 INFO L748 eck$LassoCheckResult]: Stem: 2546#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= v_~flag1~0_136 0) (= 48 (select .cse0 0)) (= v_~flag2~0_142 0) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= v_~x~0_89 0) (= 2 (select |v_#length_56| 1)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_142, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_136, #length=|v_#length_55|, ~x~0=v_~x~0_89, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 2544#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 2438#[thr1ENTRY, L720-3]don't care [401] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 2078#[L721-3, thr1ENTRY]don't care [343] L721-3-->thr2ENTRY: 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~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, 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_~_.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_~_.base] 2080#[thr1ENTRY, thr2ENTRY, L721-4]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_38 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_38, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 2228#[thr2ENTRY, L688-2, L721-4]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 2498#[L721-4, L688-2, L704-2]don't care [2022-07-22 12:10:29,768 INFO L750 eck$LassoCheckResult]: Loop: 2498#[L721-4, L688-2, L704-2]don't care [288] L704-2-->L704-2: Formula: (<= 3 v_~flag1~0_3) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[] 2498#[L721-4, L688-2, L704-2]don't care [2022-07-22 12:10:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash -76307530, now seen corresponding path program 1 times [2022-07-22 12:10:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133230324] [2022-07-22 12:10:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,807 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 2 times [2022-07-22 12:10:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601740489] [2022-07-22 12:10:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1929434154, now seen corresponding path program 1 times [2022-07-22 12:10:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93825668] [2022-07-22 12:10:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:10:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93825668] [2022-07-22 12:10:29,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93825668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:29,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:29,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:10:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504864784] [2022-07-22 12:10:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:29,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:10:29,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:10:29,903 INFO L87 Difference]: Start difference. First operand 264 states and 800 transitions. cyclomatic complexity: 670 Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-22 12:10:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:29,975 INFO L93 Difference]: Finished difference Result 296 states and 876 transitions. [2022-07-22 12:10:29,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 876 transitions. [2022-07-22 12:10:29,980 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 150 [2022-07-22 12:10:29,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 296 states and 876 transitions. [2022-07-22 12:10:29,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 296 [2022-07-22 12:10:29,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2022-07-22 12:10:29,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 296 states and 876 transitions. [2022-07-22 12:10:30,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:30,004 INFO L220 hiAutomatonCegarLoop]: Abstraction has 296 states and 876 transitions. [2022-07-22 12:10:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states and 876 transitions. [2022-07-22 12:10:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-07-22 12:10:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 296 states have (on average 2.9594594594594597) internal successors, (876), 295 states have internal predecessors, (876), 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) [2022-07-22 12:10:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 876 transitions. [2022-07-22 12:10:30,040 INFO L242 hiAutomatonCegarLoop]: Abstraction has 296 states and 876 transitions. [2022-07-22 12:10:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:10:30,042 INFO L425 stractBuchiCegarLoop]: Abstraction has 296 states and 876 transitions. [2022-07-22 12:10:30,042 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:10:30,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 876 transitions. [2022-07-22 12:10:30,046 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 150 [2022-07-22 12:10:30,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:30,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:30,048 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:10:30,048 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:30,052 INFO L748 eck$LassoCheckResult]: Stem: 3400#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= v_~flag1~0_136 0) (= 48 (select .cse0 0)) (= v_~flag2~0_142 0) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= v_~x~0_89 0) (= 2 (select |v_#length_56| 1)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_142, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_136, #length=|v_#length_55|, ~x~0=v_~x~0_89, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 3398#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 3268#[thr1ENTRY, L720-3]don't care [401] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 2910#[L721-3, thr1ENTRY]don't care [343] L721-3-->thr2ENTRY: 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~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, 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_~_.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_~_.base] 2912#[thr1ENTRY, thr2ENTRY, L721-4]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_38 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_38, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 3056#[thr2ENTRY, L688-2, L721-4]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 3338#[L721-4, L688-2, L704-2]don't care [2022-07-22 12:10:30,053 INFO L750 eck$LassoCheckResult]: Loop: 3338#[L721-4, L688-2, L704-2]don't care [315] L688-2-->L688-2: Formula: (<= 3 v_~flag2~0_9) InVars {~flag2~0=v_~flag2~0_9} OutVars{~flag2~0=v_~flag2~0_9} AuxVars[] AssignedVars[] 3338#[L721-4, L688-2, L704-2]don't care [2022-07-22 12:10:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash -76307530, now seen corresponding path program 2 times [2022-07-22 12:10:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747416996] [2022-07-22 12:10:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 346, now seen corresponding path program 2 times [2022-07-22 12:10:30,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417457169] [2022-07-22 12:10:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1929434181, now seen corresponding path program 1 times [2022-07-22 12:10:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536946695] [2022-07-22 12:10:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:10:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:30,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536946695] [2022-07-22 12:10:30,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536946695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:30,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:30,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:10:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287462781] [2022-07-22 12:10:30,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:10:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:10:30,134 INFO L87 Difference]: Start difference. First operand 296 states and 876 transitions. cyclomatic complexity: 730 Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2022-07-22 12:10:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:30,194 INFO L93 Difference]: Finished difference Result 332 states and 962 transitions. [2022-07-22 12:10:30,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 962 transitions. [2022-07-22 12:10:30,199 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 168 [2022-07-22 12:10:30,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 332 states and 962 transitions. [2022-07-22 12:10:30,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2022-07-22 12:10:30,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2022-07-22 12:10:30,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 332 states and 962 transitions. [2022-07-22 12:10:30,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:30,206 INFO L220 hiAutomatonCegarLoop]: Abstraction has 332 states and 962 transitions. [2022-07-22 12:10:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 962 transitions. [2022-07-22 12:10:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-07-22 12:10:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.897590361445783) internal successors, (962), 331 states have internal predecessors, (962), 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) [2022-07-22 12:10:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 962 transitions. [2022-07-22 12:10:30,222 INFO L242 hiAutomatonCegarLoop]: Abstraction has 332 states and 962 transitions. [2022-07-22 12:10:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:10:30,223 INFO L425 stractBuchiCegarLoop]: Abstraction has 332 states and 962 transitions. [2022-07-22 12:10:30,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:10:30,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 962 transitions. [2022-07-22 12:10:30,227 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 168 [2022-07-22 12:10:30,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:30,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:30,228 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:10:30,228 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:30,228 INFO L748 eck$LassoCheckResult]: Stem: 4356#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L720-2: Formula: (let ((.cse1 (store |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_91| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (= v_~flag1~0_136 0) (= 48 (select .cse0 0)) (= v_~flag2~0_142 0) (= (select |v_#valid_91| 0) 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4)) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_25|))) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select |v_#valid_91| 1) 1) (= v_~x~0_89 0) (= 2 (select |v_#length_56| 1)) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_25|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_55| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1) |v_#valid_90|) (= |v_#NULL.offset_8| 0) (= (select |v_#length_56| 2) 12) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#NULL.base_8| 0) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select |v_#valid_91| 2) 1) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_15|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_25|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, ~flag2~0=v_~flag2~0_142, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_45|, ~flag1~0=v_~flag1~0_136, #length=|v_#length_55|, ~x~0=v_~x~0_89, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, ~flag2~0, #valid, #memory_int, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 4354#[L720-2]don't care [340] L720-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 4210#[thr1ENTRY, L720-3]don't care [401] L720-3-->L721-3: Formula: (and (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_25| 4) (select |v_#length_49| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre5#1_21|)) |v_#memory_int_37|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_25|) (= |v_#pthreadsForks_28| |v_ULTIMATE.start_main_#t~pre5#1_21|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_21|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_13|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet4#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre3#1] 3842#[L721-3, thr1ENTRY]don't care [343] L721-3-->thr2ENTRY: 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~pre5#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, 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_~_.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_~_.base] 3844#[thr1ENTRY, thr2ENTRY, L721-4]don't care [362] thr1ENTRY-->L688-2: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_38 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_38, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 3990#[thr2ENTRY, L688-2, L721-4]don't care [346] thr2ENTRY-->L704-2: Formula: (and (= v_~flag2~0_17 1) (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_17, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 4282#[L721-4, L688-2, L704-2]don't care [314] L688-2-->L688-3: Formula: (not (<= 3 v_~flag2~0_8)) InVars {~flag2~0=v_~flag2~0_8} OutVars{~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[] 3994#[L688-3, L721-4, L704-2]don't care [316] L688-3-->L690: Formula: (= v_~flag1~0_13 3) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0] 3998#[L690, L721-4, L704-2]don't care [2022-07-22 12:10:30,229 INFO L750 eck$LassoCheckResult]: Loop: 3998#[L690, L721-4, L704-2]don't care [288] L704-2-->L704-2: Formula: (<= 3 v_~flag1~0_3) InVars {~flag1~0=v_~flag1~0_3} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[] 3998#[L690, L721-4, L704-2]don't care [2022-07-22 12:10:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -317082248, now seen corresponding path program 1 times [2022-07-22 12:10:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906579519] [2022-07-22 12:10:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 3 times [2022-07-22 12:10:30,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82318044] [2022-07-22 12:10:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1239614808, now seen corresponding path program 1 times [2022-07-22 12:10:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196436710] [2022-07-22 12:10:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:31,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:10:31 BoogieIcfgContainer [2022-07-22 12:10:31,382 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:10:31,383 INFO L158 Benchmark]: Toolchain (without parser) took 6581.44ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 125.3MB in the beginning and 68.6MB in the end (delta: 56.6MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. [2022-07-22 12:10:31,383 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:10:31,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.57ms. Allocated memory is still 151.0MB. Free memory was 125.0MB in the beginning and 106.3MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-07-22 12:10:31,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.10ms. Allocated memory is still 151.0MB. Free memory was 106.2MB in the beginning and 104.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:10:31,386 INFO L158 Benchmark]: Boogie Preprocessor took 68.74ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 102.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:10:31,386 INFO L158 Benchmark]: RCFGBuilder took 485.40ms. Allocated memory is still 151.0MB. Free memory was 102.9MB in the beginning and 129.6MB in the end (delta: -26.7MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-07-22 12:10:31,387 INFO L158 Benchmark]: BuchiAutomizer took 5406.87ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 129.6MB in the beginning and 68.6MB in the end (delta: 61.0MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-07-22 12:10:31,392 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 521.57ms. Allocated memory is still 151.0MB. Free memory was 125.0MB in the beginning and 106.3MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.10ms. Allocated memory is still 151.0MB. Free memory was 106.2MB in the beginning and 104.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.74ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 102.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 485.40ms. Allocated memory is still 151.0MB. Free memory was 102.9MB in the beginning and 129.6MB in the end (delta: -26.7MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5406.87ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 129.6MB in the beginning and 68.6MB in the end (delta: 61.0MB). Peak memory consumption was 100.3MB. 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 3 locations. The remainder module has 332 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 118 mSDtfsCounter, 180 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: 2.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 704]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result={0:0}, \result={0:0}, \result=0, _={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=3, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d4d6777 in-1,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@266b062b in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5e59058c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@87a7734=0, t1={3:0}, t2={1305:0}, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 704]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L684] 0 int flag1 = 0, flag2 = 0; [L685] 0 int x; [L719] 0 pthread_t t1, t2; [L720] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L721] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L687] 1 flag1 = 1 [L703] 2 flag2 = 1 [L688] COND FALSE 1 !(flag2 >= 3) [L689] 1 flag1 = 3 Loop: [L704] COND TRUE flag1 >= 3 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 84 PlacesBefore, 38 PlacesAfterwards, 97 TransitionsBefore, 49 TransitionsAfterwards, 2268 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 60 TotalNumberOfCompositions, 5186 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2476, positive: 2332, positive conditional: 0, positive unconditional: 2332, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1339, positive: 1307, positive conditional: 0, positive unconditional: 1307, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1339, positive: 1255, positive conditional: 0, positive unconditional: 1255, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2476, positive: 1025, positive conditional: 0, positive unconditional: 1025, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 1339, unknown conditional: 0, unknown unconditional: 1339] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 222, Positive conditional cache size: 0, Positive unconditional cache size: 222, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:10:31,472 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...