/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/lamport-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:44:14,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:44:14,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:44:14,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:44:14,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:44:14,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:44:14,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:44:14,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:44:14,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:44:14,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:44:14,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:44:14,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:44:14,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:44:14,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:44:14,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:44:14,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:44:14,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:44:14,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:44:14,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:44:14,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:44:14,388 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:44:14,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:44:14,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:44:14,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:44:14,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:44:14,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:44:14,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:44:14,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:44:14,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:44:14,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:44:14,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:44:14,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:44:14,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:44:14,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:44:14,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:44:14,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:44:14,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:44:14,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:44:14,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:44:14,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:44:14,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:44:14,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:44:14,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:44:14,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:44:14,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:44:14,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:44:14,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:44:14,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:44:14,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:44:14,426 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:44:14,426 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:44:14,426 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:44:14,426 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:44:14,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:44:14,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:44:14,428 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:44:14,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:44:14,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:44:14,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:44:14,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:44:14,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:44:14,430 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:44:14,430 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-26 13:44:14,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:44:14,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:44:14,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:44:14,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:44:14,671 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:44:14,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport-b.i [2022-07-26 13:44:14,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cd9ec69/84f02dba3ee1404fa3e49f876d390d3f/FLAG54b28aab2 [2022-07-26 13:44:15,138 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:44:15,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport-b.i [2022-07-26 13:44:15,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cd9ec69/84f02dba3ee1404fa3e49f876d390d3f/FLAG54b28aab2 [2022-07-26 13:44:15,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cd9ec69/84f02dba3ee1404fa3e49f876d390d3f [2022-07-26 13:44:15,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:44:15,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:44:15,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:44:15,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:44:15,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66fb347d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15, skipping insertion in model container [2022-07-26 13:44:15,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:44:15,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:44:15,890 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/lamport-b.i[30203,30216] [2022-07-26 13:44:15,896 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/lamport-b.i[30581,30594] [2022-07-26 13:44:15,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:15,916 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:44:15,961 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/lamport-b.i[30203,30216] [2022-07-26 13:44:15,970 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/lamport-b.i[30581,30594] [2022-07-26 13:44:15,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:16,011 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:44:16,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16 WrapperNode [2022-07-26 13:44:16,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:16,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:16,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:44:16,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:44:16,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,047 INFO L137 Inliner]: procedures = 167, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-07-26 13:44:16,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:16,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:44:16,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:44:16,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:44:16,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:44:16,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:44:16,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:44:16,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:44:16,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:44:16,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:44:16,129 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-26 13:44:16,153 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-26 13:44:16,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:44:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 13:44:16,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 13:44:16,169 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 13:44:16,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 13:44:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:44:16,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:44:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:44:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:44:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:44:16,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:44:16,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:44:16,173 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:44:16,301 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:44:16,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:44:16,464 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:44:16,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:44:16,471 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-26 13:44:16,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16 BoogieIcfgContainer [2022-07-26 13:44:16,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:44:16,474 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:44:16,474 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:44:16,479 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:44:16,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:44:15" (1/3) ... [2022-07-26 13:44:16,480 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59064d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (2/3) ... [2022-07-26 13:44:16,481 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59064d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16" (3/3) ... [2022-07-26 13:44:16,483 INFO L322 chiAutomizerObserver]: Analyzing ICFG lamport-b.i [2022-07-26 13:44:16,555 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:44:16,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 117 transitions, 250 flow [2022-07-26 13:44:16,621 INFO L129 PetriNetUnfolder]: 24/113 cut-off events. [2022-07-26 13:44:16,621 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 24/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2022-07-26 13:44:16,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 117 transitions, 250 flow [2022-07-26 13:44:16,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 113 transitions, 238 flow [2022-07-26 13:44:16,639 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:44:16,650 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 113 transitions, 238 flow [2022-07-26 13:44:16,652 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 113 transitions, 238 flow [2022-07-26 13:44:16,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 113 transitions, 238 flow [2022-07-26 13:44:16,673 INFO L129 PetriNetUnfolder]: 24/113 cut-off events. [2022-07-26 13:44:16,673 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 24/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 177 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2022-07-26 13:44:16,678 INFO L116 LiptonReduction]: Number of co-enabled transitions 3332 [2022-07-26 13:44:18,749 INFO L131 LiptonReduction]: Checked pairs total: 11591 [2022-07-26 13:44:18,749 INFO L133 LiptonReduction]: Total number of compositions: 72 [2022-07-26 13:44:18,766 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:44:18,766 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:44:18,767 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:44:18,767 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:44:18,767 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:44:18,767 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:44:18,767 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:44:18,767 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:44:18,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:44:18,908 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 480 [2022-07-26 13:44:18,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,914 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:44:18,914 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:44:18,914 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:44:18,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 579 states, but on-demand construction may add more states [2022-07-26 13:44:18,928 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 480 [2022-07-26 13:44:18,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:18,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:18,928 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:44:18,929 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:44:18,933 INFO L733 eck$LassoCheckResult]: Stem: 101#[ULTIMATE.startENTRY]don't care [475] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (select |v_#memory_int_38| 1)) (.cse1 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 1))) (and (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) (= (select |v_#valid_83| 1) 1) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= (select |v_#valid_83| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= 2 (select |v_#length_52| 1)) (= v_~X~0_80 0) (= |v_#pthreadsForks_40| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= (select .cse0 1) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_82|) (= 10 (select |v_#length_52| 2)) (= (select |v_#valid_83| 2) 1) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_8| 0) (= v_~b1~0_114 0) (= v_~y~0_413 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_51|) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_141 0) (= v_~b2~0_113 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_38|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_113, 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~X~0=v_~X~0_80, 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_27|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ~y~0=v_~y~0_413, ~b1~0=v_~b1~0_114, ~x~0=v_~x~0_141, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ~b2~0, 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, ~X~0, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, #valid, #memory_int, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 104#[L741-2]don't care [401] L741-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 106#[L741-3, thr1ENTRY]don't care [435] thr1ENTRY-->L701-3: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 108#[L701-3, L741-3]don't care [2022-07-26 13:44:18,933 INFO L735 eck$LassoCheckResult]: Loop: 108#[L701-3, L741-3]don't care [427] L701-3-->L690: Formula: (= v_~b1~0_22 1) InVars {} OutVars{~b1~0=v_~b1~0_22} AuxVars[] AssignedVars[~b1~0] 116#[L690, L741-3]don't care [371] L690-->L691: Formula: (= v_~x~0_5 1) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 130#[L691, L741-3]don't care [374] L691-->L692: Formula: (not (= v_~y~0_15 0)) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15} AuxVars[] AssignedVars[] 156#[L692, L741-3]don't care [378] L692-->L693-2: Formula: (= v_~b1~0_4 0) InVars {} OutVars{~b1~0=v_~b1~0_4} AuxVars[] AssignedVars[~b1~0] 204#[L693-2, L741-3]don't care [444] L693-2-->L701-3: Formula: (= v_~y~0_In_5 0) InVars {~y~0=v_~y~0_In_5} OutVars{~y~0=v_~y~0_In_5} AuxVars[] AssignedVars[] 108#[L701-3, L741-3]don't care [2022-07-26 13:44:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash 499132, now seen corresponding path program 1 times [2022-07-26 13:44:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:18,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175131060] [2022-07-26 13:44:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 434396655, now seen corresponding path program 1 times [2022-07-26 13:44:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119086082] [2022-07-26 13:44:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,195 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-26 13:44:19,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119086082] [2022-07-26 13:44:19,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119086082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:44:19,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138051932] [2022-07-26 13:44:19,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,202 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 13:44:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:19,231 INFO L87 Difference]: Start difference. First operand currently 579 states, but on-demand construction may add more states Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-26 13:44:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:19,345 INFO L93 Difference]: Finished difference Result 670 states and 1800 transitions. [2022-07-26 13:44:19,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 1800 transitions. [2022-07-26 13:44:19,353 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 196 [2022-07-26 13:44:19,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 578 states and 1561 transitions. [2022-07-26 13:44:19,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-07-26 13:44:19,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-07-26 13:44:19,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 1561 transitions. [2022-07-26 13:44:19,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:19,372 INFO L220 hiAutomatonCegarLoop]: Abstraction has 578 states and 1561 transitions. [2022-07-26 13:44:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 1561 transitions. [2022-07-26 13:44:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-07-26 13:44:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 2.7006920415224913) internal successors, (1561), 577 states have internal predecessors, (1561), 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-26 13:44:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1561 transitions. [2022-07-26 13:44:19,430 INFO L242 hiAutomatonCegarLoop]: Abstraction has 578 states and 1561 transitions. [2022-07-26 13:44:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:19,434 INFO L426 stractBuchiCegarLoop]: Abstraction has 578 states and 1561 transitions. [2022-07-26 13:44:19,434 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:44:19,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 1561 transitions. [2022-07-26 13:44:19,441 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 196 [2022-07-26 13:44:19,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,442 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,442 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:19,443 INFO L733 eck$LassoCheckResult]: Stem: 3016#[ULTIMATE.startENTRY]don't care [475] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (select |v_#memory_int_38| 1)) (.cse1 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 1))) (and (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) (= (select |v_#valid_83| 1) 1) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= (select |v_#valid_83| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= 2 (select |v_#length_52| 1)) (= v_~X~0_80 0) (= |v_#pthreadsForks_40| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= (select .cse0 1) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_82|) (= 10 (select |v_#length_52| 2)) (= (select |v_#valid_83| 2) 1) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_8| 0) (= v_~b1~0_114 0) (= v_~y~0_413 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_51|) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_141 0) (= v_~b2~0_113 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_38|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_113, 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~X~0=v_~X~0_80, 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_27|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ~y~0=v_~y~0_413, ~b1~0=v_~b1~0_114, ~x~0=v_~x~0_141, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ~b2~0, 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, ~X~0, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, #valid, #memory_int, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 3002#[L741-2]don't care [401] L741-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 2058#[L741-3, thr1ENTRY]don't care [435] thr1ENTRY-->L701-3: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 2060#[L701-3, L741-3]don't care [427] L701-3-->L690: Formula: (= v_~b1~0_22 1) InVars {} OutVars{~b1~0=v_~b1~0_22} AuxVars[] AssignedVars[~b1~0] 2938#[L690, L741-3]don't care [371] L690-->L691: Formula: (= v_~x~0_5 1) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 2964#[L691, L741-3]don't care [374] L691-->L692: Formula: (not (= v_~y~0_15 0)) InVars {~y~0=v_~y~0_15} OutVars{~y~0=v_~y~0_15} AuxVars[] AssignedVars[] 2462#[L692, L741-3]don't care [378] L692-->L693-2: Formula: (= v_~b1~0_4 0) InVars {} OutVars{~b1~0=v_~b1~0_4} AuxVars[] AssignedVars[~b1~0] 2466#[L693-2, L741-3]don't care [2022-07-26 13:44:19,443 INFO L735 eck$LassoCheckResult]: Loop: 2466#[L693-2, L741-3]don't care [383] L693-2-->L693-2: Formula: (not (= v_~y~0_18 0)) InVars {~y~0=v_~y~0_18} OutVars{~y~0=v_~y~0_18} AuxVars[] AssignedVars[] 2466#[L693-2, L741-3]don't care [2022-07-26 13:44:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1410472360, now seen corresponding path program 1 times [2022-07-26 13:44:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871812417] [2022-07-26 13:44:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,506 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-26 13:44:19,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871812417] [2022-07-26 13:44:19,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871812417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:44:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721531908] [2022-07-26 13:44:19,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,508 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 414, now seen corresponding path program 1 times [2022-07-26 13:44:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714612878] [2022-07-26 13:44:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:19,547 INFO L87 Difference]: Start difference. First operand 578 states and 1561 transitions. cyclomatic complexity: 1179 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-26 13:44:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:19,653 INFO L93 Difference]: Finished difference Result 506 states and 1333 transitions. [2022-07-26 13:44:19,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 1333 transitions. [2022-07-26 13:44:19,658 INFO L131 ngComponentsAnalysis]: Automaton has 158 accepting balls. 158 [2022-07-26 13:44:19,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 506 states and 1333 transitions. [2022-07-26 13:44:19,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2022-07-26 13:44:19,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2022-07-26 13:44:19,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 1333 transitions. [2022-07-26 13:44:19,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:19,680 INFO L220 hiAutomatonCegarLoop]: Abstraction has 506 states and 1333 transitions. [2022-07-26 13:44:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 1333 transitions. [2022-07-26 13:44:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2022-07-26 13:44:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 506 states have (on average 2.6343873517786562) internal successors, (1333), 505 states have internal predecessors, (1333), 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-26 13:44:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1333 transitions. [2022-07-26 13:44:19,705 INFO L242 hiAutomatonCegarLoop]: Abstraction has 506 states and 1333 transitions. [2022-07-26 13:44:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:19,712 INFO L426 stractBuchiCegarLoop]: Abstraction has 506 states and 1333 transitions. [2022-07-26 13:44:19,712 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:44:19,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 506 states and 1333 transitions. [2022-07-26 13:44:19,716 INFO L131 ngComponentsAnalysis]: Automaton has 158 accepting balls. 158 [2022-07-26 13:44:19,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,716 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,717 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:19,717 INFO L733 eck$LassoCheckResult]: Stem: 4580#[ULTIMATE.startENTRY]don't care [475] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (select |v_#memory_int_38| 1)) (.cse1 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 1))) (and (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) (= (select |v_#valid_83| 1) 1) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= (select |v_#valid_83| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= 2 (select |v_#length_52| 1)) (= v_~X~0_80 0) (= |v_#pthreadsForks_40| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= (select .cse0 1) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_82|) (= 10 (select |v_#length_52| 2)) (= (select |v_#valid_83| 2) 1) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_8| 0) (= v_~b1~0_114 0) (= v_~y~0_413 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_51|) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_141 0) (= v_~b2~0_113 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_38|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_113, 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~X~0=v_~X~0_80, 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_27|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ~y~0=v_~y~0_413, ~b1~0=v_~b1~0_114, ~x~0=v_~x~0_141, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ~b2~0, 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, ~X~0, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, #valid, #memory_int, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 4568#[L741-2]don't care [401] L741-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 3728#[L741-3, thr1ENTRY]don't care [435] thr1ENTRY-->L701-3: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 3730#[L701-3, L741-3]don't care [427] L701-3-->L690: Formula: (= v_~b1~0_22 1) InVars {} OutVars{~b1~0=v_~b1~0_22} AuxVars[] AssignedVars[~b1~0] 4504#[L690, L741-3]don't care [371] L690-->L691: Formula: (= v_~x~0_5 1) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 4532#[L691, L741-3]don't care [375] L691-->L696: Formula: (= v_~y~0_19 0) InVars {~y~0=v_~y~0_19} OutVars{~y~0=v_~y~0_19} AuxVars[] AssignedVars[] 4536#[L741-3, L696]don't care [379] L696-->L697: Formula: (= v_~y~0_20 1) InVars {} OutVars{~y~0=v_~y~0_20} AuxVars[] AssignedVars[~y~0] 4480#[L741-3, L697]don't care [407] L697-->L699-2: Formula: (and (= v_~b1~0_8 0) (not (= v_~x~0_14 1))) InVars {~x~0=v_~x~0_14} OutVars{~b1~0=v_~b1~0_8, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~b1~0] 4484#[L699-2, L741-3]don't care [2022-07-26 13:44:19,718 INFO L735 eck$LassoCheckResult]: Loop: 4484#[L699-2, L741-3]don't care [390] L699-2-->L699-2: Formula: (<= 1 v_~b2~0_6) InVars {~b2~0=v_~b2~0_6} OutVars{~b2~0=v_~b2~0_6} AuxVars[] AssignedVars[] 4484#[L699-2, L741-3]don't care [2022-07-26 13:44:19,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash 774971599, now seen corresponding path program 1 times [2022-07-26 13:44:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939778735] [2022-07-26 13:44:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,754 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-26 13:44:19,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939778735] [2022-07-26 13:44:19,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939778735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:44:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542874774] [2022-07-26 13:44:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,755 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 421, now seen corresponding path program 1 times [2022-07-26 13:44:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061756882] [2022-07-26 13:44:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:19,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:19,769 INFO L87 Difference]: Start difference. First operand 506 states and 1333 transitions. cyclomatic complexity: 985 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-26 13:44:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:19,838 INFO L93 Difference]: Finished difference Result 732 states and 1839 transitions. [2022-07-26 13:44:19,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 732 states and 1839 transitions. [2022-07-26 13:44:19,845 INFO L131 ngComponentsAnalysis]: Automaton has 210 accepting balls. 210 [2022-07-26 13:44:19,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 732 states to 660 states and 1675 transitions. [2022-07-26 13:44:19,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2022-07-26 13:44:19,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2022-07-26 13:44:19,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 1675 transitions. [2022-07-26 13:44:19,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:19,858 INFO L220 hiAutomatonCegarLoop]: Abstraction has 660 states and 1675 transitions. [2022-07-26 13:44:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 1675 transitions. [2022-07-26 13:44:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 496. [2022-07-26 13:44:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 496 states have (on average 2.590725806451613) internal successors, (1285), 495 states have internal predecessors, (1285), 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-26 13:44:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1285 transitions. [2022-07-26 13:44:19,887 INFO L242 hiAutomatonCegarLoop]: Abstraction has 496 states and 1285 transitions. [2022-07-26 13:44:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:19,888 INFO L426 stractBuchiCegarLoop]: Abstraction has 496 states and 1285 transitions. [2022-07-26 13:44:19,888 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:44:19,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 496 states and 1285 transitions. [2022-07-26 13:44:19,891 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 154 [2022-07-26 13:44:19,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,911 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:19,911 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:19,911 INFO L733 eck$LassoCheckResult]: Stem: 6244#[ULTIMATE.startENTRY]don't care [475] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (select |v_#memory_int_38| 1)) (.cse1 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 1))) (and (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) (= (select |v_#valid_83| 1) 1) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= (select |v_#valid_83| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= 2 (select |v_#length_52| 1)) (= v_~X~0_80 0) (= |v_#pthreadsForks_40| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= (select .cse0 1) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_82|) (= 10 (select |v_#length_52| 2)) (= (select |v_#valid_83| 2) 1) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_8| 0) (= v_~b1~0_114 0) (= v_~y~0_413 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_51|) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_141 0) (= v_~b2~0_113 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_38|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_113, 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~X~0=v_~X~0_80, 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_27|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ~y~0=v_~y~0_413, ~b1~0=v_~b1~0_114, ~x~0=v_~x~0_141, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ~b2~0, 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, ~X~0, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, #valid, #memory_int, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 6236#[L741-2]don't care [401] L741-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 5466#[L741-3, thr1ENTRY]don't care [468] L741-3-->L742-3: Formula: (and (= (select |v_#valid_68| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre5#1_21|))) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |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_29|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} 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_11|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, 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] 5470#[thr1ENTRY, L742-3]don't care [398] L742-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork0_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|, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 6126#[thr1ENTRY, L742-4, thr2ENTRY]don't care [422] thr2ENTRY-->L727-3: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_7| v_thr2Thread1of1ForFork0_~_.base_7) (= v_thr2Thread1of1ForFork0_~_.offset_7 |v_thr2Thread1of1ForFork0_#in~_.offset_7|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_7|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_7, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_7|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_7|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 6130#[L727-3, thr1ENTRY, L742-4]don't care [436] L727-3-->L716: Formula: (= v_~b2~0_29 1) InVars {} OutVars{~b2~0=v_~b2~0_29} AuxVars[] AssignedVars[~b2~0] 6176#[thr1ENTRY, L716, L742-4]don't care [337] L716-->L717: Formula: (= 2 v_~x~0_2) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 6122#[thr1ENTRY, L742-4, L717]don't care [341] L717-->L722: Formula: (= v_~y~0_5 0) InVars {~y~0=v_~y~0_5} OutVars{~y~0=v_~y~0_5} AuxVars[] AssignedVars[] 6124#[L722, thr1ENTRY, L742-4]don't care [345] L722-->L723: Formula: (= 2 v_~y~0_6) InVars {} OutVars{~y~0=v_~y~0_6} AuxVars[] AssignedVars[~y~0] 6238#[thr1ENTRY, L742-4, L723]don't care [426] L723-->L725-2: Formula: (and (= v_~b2~0_27 0) (not (= v_~x~0_42 2))) InVars {~x~0=v_~x~0_42} OutVars{~b2~0=v_~b2~0_27, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[~b2~0] 6228#[L725-2, thr1ENTRY, L742-4]don't care [2022-07-26 13:44:19,912 INFO L735 eck$LassoCheckResult]: Loop: 6228#[L725-2, thr1ENTRY, L742-4]don't care [356] L725-2-->L725-2: Formula: (<= 1 v_~b1~0_2) InVars {~b1~0=v_~b1~0_2} OutVars{~b1~0=v_~b1~0_2} AuxVars[] AssignedVars[] 6228#[L725-2, thr1ENTRY, L742-4]don't care [2022-07-26 13:44:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 648878324, now seen corresponding path program 1 times [2022-07-26 13:44:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819217283] [2022-07-26 13:44:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,942 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-26 13:44:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819217283] [2022-07-26 13:44:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819217283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:44:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630024501] [2022-07-26 13:44:19,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,944 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:44:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 387, now seen corresponding path program 1 times [2022-07-26 13:44:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221768154] [2022-07-26 13:44:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,949 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:44:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:44:19,968 INFO L87 Difference]: Start difference. First operand 496 states and 1285 transitions. cyclomatic complexity: 943 Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-26 13:44:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,027 INFO L93 Difference]: Finished difference Result 540 states and 1267 transitions. [2022-07-26 13:44:20,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 540 states and 1267 transitions. [2022-07-26 13:44:20,032 INFO L131 ngComponentsAnalysis]: Automaton has 130 accepting balls. 130 [2022-07-26 13:44:20,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 540 states to 434 states and 1037 transitions. [2022-07-26 13:44:20,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2022-07-26 13:44:20,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2022-07-26 13:44:20,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 1037 transitions. [2022-07-26 13:44:20,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,038 INFO L220 hiAutomatonCegarLoop]: Abstraction has 434 states and 1037 transitions. [2022-07-26 13:44:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 1037 transitions. [2022-07-26 13:44:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 410. [2022-07-26 13:44:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 410 states have (on average 2.402439024390244) internal successors, (985), 409 states have internal predecessors, (985), 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-26 13:44:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 985 transitions. [2022-07-26 13:44:20,047 INFO L242 hiAutomatonCegarLoop]: Abstraction has 410 states and 985 transitions. [2022-07-26 13:44:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:44:20,048 INFO L426 stractBuchiCegarLoop]: Abstraction has 410 states and 985 transitions. [2022-07-26 13:44:20,049 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:44:20,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 410 states and 985 transitions. [2022-07-26 13:44:20,052 INFO L131 ngComponentsAnalysis]: Automaton has 118 accepting balls. 118 [2022-07-26 13:44:20,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,052 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,052 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:44:20,053 INFO L733 eck$LassoCheckResult]: Stem: 7648#[ULTIMATE.startENTRY]don't care [475] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (select |v_#memory_int_38| 1)) (.cse1 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 1))) (and (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= 48 (select .cse0 0)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) (= (select |v_#valid_83| 1) 1) (= |v_#pthreadsForks_39| (+ |v_#pthreadsForks_40| 1)) (= (select |v_#valid_83| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_27|))) (= 2 (select |v_#length_52| 1)) (= v_~X~0_80 0) (= |v_#pthreadsForks_40| |v_ULTIMATE.start_main_#t~pre3#1_27|) (= (select .cse0 1) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1) |v_#valid_82|) (= 10 (select |v_#length_52| 2)) (= (select |v_#valid_83| 2) 1) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (= |v_#NULL.offset_8| 0) (= v_~b1~0_114 0) (= v_~y~0_413 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~0#1.base_41| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_#length_51|) (= |v_#NULL.base_8| 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_141 0) (= v_~b2~0_113 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_40|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_38|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_113, 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_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~X~0=v_~X~0_80, 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_27|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_37|, #length=|v_#length_51|, ~y~0=v_~y~0_413, ~b1~0=v_~b1~0_114, ~x~0=v_~x~0_141, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ~b2~0, 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, ~X~0, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~mem7#1, #pthreadsForks, #valid, #memory_int, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] 7620#[L741-2]don't care [401] L741-2-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 7070#[L741-3, thr1ENTRY]don't care [435] thr1ENTRY-->L701-3: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 7072#[L701-3, L741-3]don't care [468] L741-3-->L742-3: Formula: (and (= (select |v_#valid_68| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre5#1_21|))) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|) (= |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_29|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} 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_11|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|, 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] 6936#[L701-3, L742-3]don't care [427] L701-3-->L690: Formula: (= v_~b1~0_22 1) InVars {} OutVars{~b1~0=v_~b1~0_22} AuxVars[] AssignedVars[~b1~0] 6938#[L690, L742-3]don't care [371] L690-->L691: Formula: (= v_~x~0_5 1) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 7436#[L691, L742-3]don't care [375] L691-->L696: Formula: (= v_~y~0_19 0) InVars {~y~0=v_~y~0_19} OutVars{~y~0=v_~y~0_19} AuxVars[] AssignedVars[] 7572#[L696, L742-3]don't care [379] L696-->L697: Formula: (= v_~y~0_20 1) InVars {} OutVars{~y~0=v_~y~0_20} AuxVars[] AssignedVars[~y~0] 7046#[L697, L742-3]don't care [398] L742-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_thr2Thread1of1ForFork0_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|, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 6916#[L697, L742-4, thr2ENTRY]don't care [422] thr2ENTRY-->L727-3: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_7| v_thr2Thread1of1ForFork0_~_.base_7) (= v_thr2Thread1of1ForFork0_~_.offset_7 |v_thr2Thread1of1ForFork0_#in~_.offset_7|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_7|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_7, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_7|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_7|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 6920#[L727-3, L697, L742-4]don't care [436] L727-3-->L716: Formula: (= v_~b2~0_29 1) InVars {} OutVars{~b2~0=v_~b2~0_29} AuxVars[] AssignedVars[~b2~0] 7140#[L716, L697, L742-4]don't care [337] L716-->L717: Formula: (= 2 v_~x~0_2) InVars {} OutVars{~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] 7614#[L697, L742-4, L717]don't care [407] L697-->L699-2: Formula: (and (= v_~b1~0_8 0) (not (= v_~x~0_14 1))) InVars {~x~0=v_~x~0_14} OutVars{~b1~0=v_~b1~0_8, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~b1~0] 7308#[L699-2, L742-4, L717]don't care [2022-07-26 13:44:20,053 INFO L735 eck$LassoCheckResult]: Loop: 7308#[L699-2, L742-4, L717]don't care [390] L699-2-->L699-2: Formula: (<= 1 v_~b2~0_6) InVars {~b2~0=v_~b2~0_6} OutVars{~b2~0=v_~b2~0_6} AuxVars[] AssignedVars[] 7308#[L699-2, L742-4, L717]don't care [2022-07-26 13:44:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash 121834270, now seen corresponding path program 1 times [2022-07-26 13:44:20,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213551805] [2022-07-26 13:44:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash 421, now seen corresponding path program 2 times [2022-07-26 13:44:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284931369] [2022-07-26 13:44:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -518104536, now seen corresponding path program 1 times [2022-07-26 13:44:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81650068] [2022-07-26 13:44:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,150 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:44:20 BoogieIcfgContainer [2022-07-26 13:44:20,951 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:44:20,951 INFO L158 Benchmark]: Toolchain (without parser) took 5437.03ms. Allocated memory was 190.8MB in the beginning and 244.3MB in the end (delta: 53.5MB). Free memory was 131.8MB in the beginning and 127.8MB in the end (delta: 4.0MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,952 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 190.8MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:44:20,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.88ms. Allocated memory was 190.8MB in the beginning and 244.3MB in the end (delta: 53.5MB). Free memory was 131.6MB in the beginning and 205.1MB in the end (delta: -73.5MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 244.3MB. Free memory was 205.1MB in the beginning and 203.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,953 INFO L158 Benchmark]: Boogie Preprocessor took 41.11ms. Allocated memory is still 244.3MB. Free memory was 203.5MB in the beginning and 202.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,954 INFO L158 Benchmark]: RCFGBuilder took 382.75ms. Allocated memory is still 244.3MB. Free memory was 202.0MB in the beginning and 188.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,954 INFO L158 Benchmark]: BuchiAutomizer took 4477.07ms. Allocated memory is still 244.3MB. Free memory was 187.8MB in the beginning and 127.8MB in the end (delta: 60.0MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2022-07-26 13:44:20,957 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.20ms. Allocated memory is still 190.8MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 491.88ms. Allocated memory was 190.8MB in the beginning and 244.3MB in the end (delta: 53.5MB). Free memory was 131.6MB in the beginning and 205.1MB in the end (delta: -73.5MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 244.3MB. Free memory was 205.1MB in the beginning and 203.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.11ms. Allocated memory is still 244.3MB. Free memory was 203.5MB in the beginning and 202.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 382.75ms. Allocated memory is still 244.3MB. Free memory was 202.0MB in the beginning and 188.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4477.07ms. Allocated memory is still 244.3MB. Free memory was 187.8MB in the beginning and 127.8MB in the end (delta: 60.0MB). Peak memory consumption was 61.6MB. 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 410 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 188 StatesRemovedByMinimization, 2 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, 122 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 119 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN3 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 699]: 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}, b1=0, b2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a7d52ae in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c1336dd in0,-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@221083f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@518bfacb=0, t1={10337:0}, t2={10338:0}, X=0, x=2, y=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 699]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L684] 0 int x, y; [L685] 0 int b1, b2; [L686] 0 int X; [L740] 0 pthread_t t1, t2; [L741] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L688] COND TRUE 1 1 [L689] 1 b1 = 1 [L690] 1 x = 1 [L691] COND FALSE 1 !(y != 0) [L696] 1 y = 1 [L742] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L714] COND TRUE 2 1 [L715] 2 b2 = 1 [L716] 2 x = 2 [L697] COND TRUE 1 x != 1 [L698] 1 b1 = 0 Loop: [L699] COND TRUE b2 >= 1 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 96 PlacesBefore, 46 PlacesAfterwards, 113 TransitionsBefore, 57 TransitionsAfterwards, 3332 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 6 ChoiceCompositions, 72 TotalNumberOfCompositions, 11591 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5559, positive: 5242, positive conditional: 0, positive unconditional: 5242, negative: 317, negative conditional: 0, negative unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2052, positive: 1994, positive conditional: 0, positive unconditional: 1994, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2052, positive: 1887, positive conditional: 0, positive unconditional: 1887, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 165, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 223, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5559, positive: 3248, positive conditional: 0, positive unconditional: 3248, negative: 259, negative conditional: 0, negative unconditional: 259, unknown: 2052, unknown conditional: 0, unknown unconditional: 2052] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 558, Positive conditional cache size: 0, Positive unconditional cache size: 558, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 13:44:21,006 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...