/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-syntacticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/lamport-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:03:11,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:03:11,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:03:11,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:03:11,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:03:11,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:03:11,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:03:11,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:03:11,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:03:11,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:03:11,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:03:11,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:03:11,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:03:11,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:03:11,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:03:11,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:03:11,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:03:11,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:03:11,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:03:11,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:03:11,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:03:11,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:03:11,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:03:11,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:03:11,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:03:11,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:03:11,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:03:11,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:03:11,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:03:11,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:03:11,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:03:11,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:03:11,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:03:11,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:03:11,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:03:11,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:03:11,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:03:11,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:03:11,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:03:11,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:03:11,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:03:11,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:03:11,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:03:11,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:03:11,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:03:11,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:03:11,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:03:11,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:03:11,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:03:11,336 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:03:11,336 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:03:11,336 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:03:11,337 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:03:11,337 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:03:11,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:03:11,337 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:03:11,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:03:11,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:03:11,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:03:11,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:03:11,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:03:11,340 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:03:11,340 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:03:11,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:03:11,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:03:11,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:03:11,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:03:11,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:03:11,341 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:03:11,342 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:03:11,342 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 14:03:11,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:03:11,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:03:11,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:03:11,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:03:11,619 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:03:11,620 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 14:03:11,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8c354b3/43434d0dcf1c41ba8dc00ea0883b475c/FLAGe67d5838a [2022-07-26 14:03:12,195 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:03:12,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport-b.i [2022-07-26 14:03:12,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8c354b3/43434d0dcf1c41ba8dc00ea0883b475c/FLAGe67d5838a [2022-07-26 14:03:12,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8c354b3/43434d0dcf1c41ba8dc00ea0883b475c [2022-07-26 14:03:12,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:03:12,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:03:12,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:03:12,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:03:12,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:03:12,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec55596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:12, skipping insertion in model container [2022-07-26 14:03:12,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:03:12" (1/1) ... [2022-07-26 14:03:12,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:03:12,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:03:13,019 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 14:03:13,025 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 14:03:13,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:03:13,041 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:03:13,083 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 14:03:13,085 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 14:03:13,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:03:13,135 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:03:13,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13 WrapperNode [2022-07-26 14:03:13,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:03:13,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:03:13,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:03:13,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:03:13,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,200 INFO L137 Inliner]: procedures = 167, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-07-26 14:03:13,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:03:13,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:03:13,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:03:13,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:03:13,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:03:13,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:03:13,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:03:13,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:03:13,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (1/1) ... [2022-07-26 14:03:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:03:13,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:03:13,282 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 14:03:13,292 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 14:03:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:03:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 14:03:13,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 14:03:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 14:03:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 14:03:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:03:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:03:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:03:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:03:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:03:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:03:13,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:03:13,326 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 14:03:13,463 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:03:13,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:03:13,753 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:03:13,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:03:13,759 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-26 14:03:13,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:03:13 BoogieIcfgContainer [2022-07-26 14:03:13,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:03:13,762 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:03:13,762 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:03:13,771 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:03:13,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:03:12" (1/3) ... [2022-07-26 14:03:13,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d72859c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:03:13, skipping insertion in model container [2022-07-26 14:03:13,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:03:13" (2/3) ... [2022-07-26 14:03:13,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d72859c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:03:13, skipping insertion in model container [2022-07-26 14:03:13,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:03:13,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:03:13" (3/3) ... [2022-07-26 14:03:13,775 INFO L322 chiAutomizerObserver]: Analyzing ICFG lamport-b.i [2022-07-26 14:03:13,891 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:03:13,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 117 transitions, 250 flow [2022-07-26 14:03:13,982 INFO L129 PetriNetUnfolder]: 24/113 cut-off events. [2022-07-26 14:03:13,982 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:03:13,987 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 14:03:13,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 117 transitions, 250 flow [2022-07-26 14:03:14,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 113 transitions, 238 flow [2022-07-26 14:03:14,004 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:03:14,013 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 113 transitions, 238 flow [2022-07-26 14:03:14,015 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 113 transitions, 238 flow [2022-07-26 14:03:14,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 113 transitions, 238 flow [2022-07-26 14:03:14,043 INFO L129 PetriNetUnfolder]: 24/113 cut-off events. [2022-07-26 14:03:14,043 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:03:14,045 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 14:03:14,048 INFO L116 LiptonReduction]: Number of co-enabled transitions 3332 [2022-07-26 14:03:15,719 INFO L131 LiptonReduction]: Checked pairs total: 14736 [2022-07-26 14:03:15,720 INFO L133 LiptonReduction]: Total number of compositions: 60 [2022-07-26 14:03:15,742 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:03:15,742 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:03:15,742 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:03:15,742 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:03:15,743 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:03:15,743 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:03:15,743 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:03:15,744 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:03:15,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:03:15,893 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 594 [2022-07-26 14:03:15,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,899 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:03:15,899 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:03:15,899 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:03:15,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 723 states, but on-demand construction may add more states [2022-07-26 14:03:15,912 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 594 [2022-07-26 14:03:15,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:15,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:15,913 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:03:15,913 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 14:03:15,917 INFO L733 eck$LassoCheckResult]: Stem: 101#[ULTIMATE.startENTRY]don't care [463] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse1 (select |v_#memory_int_42| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_16 0) (= |v_#NULL.offset_6| 0) (= 2 (select |v_#length_50| 1)) (= |v_#NULL.base_6| 0) (= (select |v_#valid_83| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_82|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select |v_#valid_83| 0) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (store (store |v_#length_50| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4) |v_#length_49|) (= (select .cse1 1) 0) (= v_~b1~0_18 0) (= v_~y~0_38 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_29|) (= (select |v_#length_50| 2) 10) (= v_~b2~0_22 0) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (select |v_#valid_83| 2) 1) (= v_~X~0_32 0) (= |v_#memory_int_41| (store |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_29|))) (= (select .cse1 0) 48) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_42|, #length=|v_#length_50|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_22, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ~X~0=v_~X~0_32, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_41|, #length=|v_#length_49|, ~y~0=v_~y~0_38, ~b1~0=v_~b1~0_18, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} 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 [431] 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] 112#[L701-3, L741-3]don't care [2022-07-26 14:03:15,917 INFO L735 eck$LassoCheckResult]: Loop: 112#[L701-3, L741-3]don't care [423] L701-3-->L690: Formula: (= v_~b1~0_8 1) InVars {} OutVars{~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 124#[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] 144#[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[] 180#[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] 242#[L693-2, L741-3]don't care [440] 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[] 112#[L701-3, L741-3]don't care [2022-07-26 14:03:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 487596, now seen corresponding path program 1 times [2022-07-26 14:03:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:15,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779696553] [2022-07-26 14:03:15,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 430702567, now seen corresponding path program 1 times [2022-07-26 14:03:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858333200] [2022-07-26 14:03:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:16,196 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 14:03:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:16,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858333200] [2022-07-26 14:03:16,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858333200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:16,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:16,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:03:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463533007] [2022-07-26 14:03:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:16,204 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 14:03:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:16,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:16,228 INFO L87 Difference]: Start difference. First operand currently 723 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 14:03:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:16,337 INFO L93 Difference]: Finished difference Result 864 states and 2326 transitions. [2022-07-26 14:03:16,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 864 states and 2326 transitions. [2022-07-26 14:03:16,349 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-26 14:03:16,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 864 states to 736 states and 1976 transitions. [2022-07-26 14:03:16,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 736 [2022-07-26 14:03:16,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 736 [2022-07-26 14:03:16,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 1976 transitions. [2022-07-26 14:03:16,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:16,373 INFO L220 hiAutomatonCegarLoop]: Abstraction has 736 states and 1976 transitions. [2022-07-26 14:03:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 1976 transitions. [2022-07-26 14:03:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2022-07-26 14:03:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 736 states have (on average 2.6847826086956523) internal successors, (1976), 735 states have internal predecessors, (1976), 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 14:03:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1976 transitions. [2022-07-26 14:03:16,442 INFO L242 hiAutomatonCegarLoop]: Abstraction has 736 states and 1976 transitions. [2022-07-26 14:03:16,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:16,448 INFO L426 stractBuchiCegarLoop]: Abstraction has 736 states and 1976 transitions. [2022-07-26 14:03:16,449 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:03:16,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 736 states and 1976 transitions. [2022-07-26 14:03:16,455 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-26 14:03:16,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:16,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:16,462 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:03:16,462 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:16,462 INFO L733 eck$LassoCheckResult]: Stem: 3746#[ULTIMATE.startENTRY]don't care [463] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse1 (select |v_#memory_int_42| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_16 0) (= |v_#NULL.offset_6| 0) (= 2 (select |v_#length_50| 1)) (= |v_#NULL.base_6| 0) (= (select |v_#valid_83| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_82|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select |v_#valid_83| 0) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (store (store |v_#length_50| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4) |v_#length_49|) (= (select .cse1 1) 0) (= v_~b1~0_18 0) (= v_~y~0_38 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_29|) (= (select |v_#length_50| 2) 10) (= v_~b2~0_22 0) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (select |v_#valid_83| 2) 1) (= v_~X~0_32 0) (= |v_#memory_int_41| (store |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_29|))) (= (select .cse1 0) 48) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_42|, #length=|v_#length_50|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_22, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ~X~0=v_~X~0_32, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_41|, #length=|v_#length_49|, ~y~0=v_~y~0_38, ~b1~0=v_~b1~0_18, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} 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] 3734#[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] 2584#[L741-3, thr1ENTRY]don't care [431] 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] 2588#[L701-3, L741-3]don't care [423] L701-3-->L690: Formula: (= v_~b1~0_8 1) InVars {} OutVars{~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 3664#[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] 3698#[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[] 3134#[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] 3136#[L693-2, L741-3]don't care [2022-07-26 14:03:16,462 INFO L735 eck$LassoCheckResult]: Loop: 3136#[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[] 3136#[L693-2, L741-3]don't care [2022-07-26 14:03:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash -653450468, now seen corresponding path program 1 times [2022-07-26 14:03:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371657637] [2022-07-26 14:03:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:16,529 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 14:03:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371657637] [2022-07-26 14:03:16,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371657637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:16,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:16,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:03:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623262611] [2022-07-26 14:03:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:16,530 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:03:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 414, now seen corresponding path program 1 times [2022-07-26 14:03:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256454103] [2022-07-26 14:03:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:16,561 INFO L87 Difference]: Start difference. First operand 736 states and 1976 transitions. cyclomatic complexity: 1464 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 14:03:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:16,639 INFO L93 Difference]: Finished difference Result 656 states and 1724 transitions. [2022-07-26 14:03:16,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 1724 transitions. [2022-07-26 14:03:16,645 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 182 [2022-07-26 14:03:16,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 1724 transitions. [2022-07-26 14:03:16,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2022-07-26 14:03:16,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2022-07-26 14:03:16,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 1724 transitions. [2022-07-26 14:03:16,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:16,666 INFO L220 hiAutomatonCegarLoop]: Abstraction has 656 states and 1724 transitions. [2022-07-26 14:03:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 1724 transitions. [2022-07-26 14:03:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2022-07-26 14:03:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 656 states have (on average 2.6280487804878048) internal successors, (1724), 655 states have internal predecessors, (1724), 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 14:03:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1724 transitions. [2022-07-26 14:03:16,710 INFO L242 hiAutomatonCegarLoop]: Abstraction has 656 states and 1724 transitions. [2022-07-26 14:03:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:16,711 INFO L426 stractBuchiCegarLoop]: Abstraction has 656 states and 1724 transitions. [2022-07-26 14:03:16,711 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:03:16,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 1724 transitions. [2022-07-26 14:03:16,715 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 182 [2022-07-26 14:03:16,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:16,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:16,716 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:03:16,716 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:16,717 INFO L733 eck$LassoCheckResult]: Stem: 5762#[ULTIMATE.startENTRY]don't care [463] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse1 (select |v_#memory_int_42| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_16 0) (= |v_#NULL.offset_6| 0) (= 2 (select |v_#length_50| 1)) (= |v_#NULL.base_6| 0) (= (select |v_#valid_83| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_82|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select |v_#valid_83| 0) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (store (store |v_#length_50| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4) |v_#length_49|) (= (select .cse1 1) 0) (= v_~b1~0_18 0) (= v_~y~0_38 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_29|) (= (select |v_#length_50| 2) 10) (= v_~b2~0_22 0) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (select |v_#valid_83| 2) 1) (= v_~X~0_32 0) (= |v_#memory_int_41| (store |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_29|))) (= (select .cse1 0) 48) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_42|, #length=|v_#length_50|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_22, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ~X~0=v_~X~0_32, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_41|, #length=|v_#length_49|, ~y~0=v_~y~0_38, ~b1~0=v_~b1~0_18, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} 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] 5750#[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] 4712#[L741-3, thr1ENTRY]don't care [431] 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] 4716#[L701-3, L741-3]don't care [423] L701-3-->L690: Formula: (= v_~b1~0_8 1) InVars {} OutVars{~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 5686#[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] 5716#[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[] 5718#[L696, L741-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] 5656#[L697, L741-3]don't care [384] L697-->L698: Formula: (not (= v_~x~0_6 1)) InVars {~x~0=v_~x~0_6} OutVars{~x~0=v_~x~0_6} AuxVars[] AssignedVars[] 5658#[L698, L741-3]don't care [387] L698-->L699-2: Formula: (= v_~b1~0_6 0) InVars {} OutVars{~b1~0=v_~b1~0_6} AuxVars[] AssignedVars[~b1~0] 5682#[L699-2, L741-3]don't care [2022-07-26 14:03:16,717 INFO L735 eck$LassoCheckResult]: Loop: 5682#[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[] 5682#[L699-2, L741-3]don't care [2022-07-26 14:03:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash -900631489, now seen corresponding path program 1 times [2022-07-26 14:03:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440656596] [2022-07-26 14:03:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:16,753 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 14:03:16,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:16,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440656596] [2022-07-26 14:03:16,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440656596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:16,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:16,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:03:16,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045045690] [2022-07-26 14:03:16,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:16,754 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:03:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 421, now seen corresponding path program 1 times [2022-07-26 14:03:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465343157] [2022-07-26 14:03:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,760 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:16,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:16,767 INFO L87 Difference]: Start difference. First operand 656 states and 1724 transitions. cyclomatic complexity: 1250 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 14:03:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:16,827 INFO L93 Difference]: Finished difference Result 950 states and 2399 transitions. [2022-07-26 14:03:16,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 950 states and 2399 transitions. [2022-07-26 14:03:16,835 INFO L131 ngComponentsAnalysis]: Automaton has 242 accepting balls. 242 [2022-07-26 14:03:16,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 950 states to 848 states and 2162 transitions. [2022-07-26 14:03:16,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 848 [2022-07-26 14:03:16,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 848 [2022-07-26 14:03:16,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 848 states and 2162 transitions. [2022-07-26 14:03:16,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:16,847 INFO L220 hiAutomatonCegarLoop]: Abstraction has 848 states and 2162 transitions. [2022-07-26 14:03:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states and 2162 transitions. [2022-07-26 14:03:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 636. [2022-07-26 14:03:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 636 states have (on average 2.60062893081761) internal successors, (1654), 635 states have internal predecessors, (1654), 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 14:03:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1654 transitions. [2022-07-26 14:03:16,868 INFO L242 hiAutomatonCegarLoop]: Abstraction has 636 states and 1654 transitions. [2022-07-26 14:03:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:16,870 INFO L426 stractBuchiCegarLoop]: Abstraction has 636 states and 1654 transitions. [2022-07-26 14:03:16,870 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:03:16,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 636 states and 1654 transitions. [2022-07-26 14:03:16,880 INFO L131 ngComponentsAnalysis]: Automaton has 180 accepting balls. 180 [2022-07-26 14:03:16,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:16,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:16,881 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:03:16,881 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:16,882 INFO L733 eck$LassoCheckResult]: Stem: 7924#[ULTIMATE.startENTRY]don't care [463] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse1 (select |v_#memory_int_42| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_16 0) (= |v_#NULL.offset_6| 0) (= 2 (select |v_#length_50| 1)) (= |v_#NULL.base_6| 0) (= (select |v_#valid_83| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_82|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select |v_#valid_83| 0) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (store (store |v_#length_50| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4) |v_#length_49|) (= (select .cse1 1) 0) (= v_~b1~0_18 0) (= v_~y~0_38 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_29|) (= (select |v_#length_50| 2) 10) (= v_~b2~0_22 0) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (select |v_#valid_83| 2) 1) (= v_~X~0_32 0) (= |v_#memory_int_41| (store |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_29|))) (= (select .cse1 0) 48) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_42|, #length=|v_#length_50|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_22, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ~X~0=v_~X~0_32, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_41|, #length=|v_#length_49|, ~y~0=v_~y~0_38, ~b1~0=v_~b1~0_18, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} 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] 7912#[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] 6964#[L741-3, thr1ENTRY]don't care [459] L741-3-->L742-3: Formula: (and (= (select |v_#valid_68| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= (+ |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_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_32| |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| |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_32|, #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_31|, #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] 6966#[L742-3, thr1ENTRY]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] 7784#[thr2ENTRY, thr1ENTRY, L742-4]don't care [420] 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] 7788#[L727-3, thr1ENTRY, L742-4]don't care [432] L727-3-->L716: Formula: (= v_~b2~0_12 1) InVars {} OutVars{~b2~0=v_~b2~0_12} AuxVars[] AssignedVars[~b2~0] 7842#[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] 7776#[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[] 7778#[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] 7914#[L723, thr1ENTRY, L742-4]don't care [350] L723-->L724: Formula: (not (= 2 v_~x~0_3)) InVars {~x~0=v_~x~0_3} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[] 7858#[L724, thr1ENTRY, L742-4]don't care [353] L724-->L725-2: Formula: (= v_~b2~0_4 0) InVars {} OutVars{~b2~0=v_~b2~0_4} AuxVars[] AssignedVars[~b2~0] 7860#[L725-2, thr1ENTRY, L742-4]don't care [2022-07-26 14:03:16,882 INFO L735 eck$LassoCheckResult]: Loop: 7860#[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[] 7860#[L725-2, thr1ENTRY, L742-4]don't care [2022-07-26 14:03:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash 221633702, now seen corresponding path program 1 times [2022-07-26 14:03:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076512322] [2022-07-26 14:03:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:03:16,936 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 14:03:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:03:16,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076512322] [2022-07-26 14:03:16,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076512322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:03:16,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:03:16,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 14:03:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679785937] [2022-07-26 14:03:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:03:16,937 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 14:03:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash 387, now seen corresponding path program 1 times [2022-07-26 14:03:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:16,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365664614] [2022-07-26 14:03:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:16,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:03:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:03:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:03:16,958 INFO L87 Difference]: Start difference. First operand 636 states and 1654 transitions. cyclomatic complexity: 1198 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 14:03:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:03:17,020 INFO L93 Difference]: Finished difference Result 664 states and 1576 transitions. [2022-07-26 14:03:17,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 664 states and 1576 transitions. [2022-07-26 14:03:17,025 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 146 [2022-07-26 14:03:17,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 664 states to 526 states and 1269 transitions. [2022-07-26 14:03:17,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 526 [2022-07-26 14:03:17,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 526 [2022-07-26 14:03:17,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 526 states and 1269 transitions. [2022-07-26 14:03:17,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:03:17,030 INFO L220 hiAutomatonCegarLoop]: Abstraction has 526 states and 1269 transitions. [2022-07-26 14:03:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states and 1269 transitions. [2022-07-26 14:03:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 502. [2022-07-26 14:03:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 502 states have (on average 2.4243027888446216) internal successors, (1217), 501 states have internal predecessors, (1217), 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 14:03:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1217 transitions. [2022-07-26 14:03:17,041 INFO L242 hiAutomatonCegarLoop]: Abstraction has 502 states and 1217 transitions. [2022-07-26 14:03:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:03:17,042 INFO L426 stractBuchiCegarLoop]: Abstraction has 502 states and 1217 transitions. [2022-07-26 14:03:17,045 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:03:17,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 502 states and 1217 transitions. [2022-07-26 14:03:17,048 INFO L131 ngComponentsAnalysis]: Automaton has 134 accepting balls. 134 [2022-07-26 14:03:17,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:03:17,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:03:17,049 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:03:17,049 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:03:17,050 INFO L733 eck$LassoCheckResult]: Stem: 9664#[ULTIMATE.startENTRY]don't care [463] ULTIMATE.startENTRY-->L741-2: Formula: (let ((.cse0 (store |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 1)) (.cse1 (select |v_#memory_int_42| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47|) 0) (= v_~x~0_16 0) (= |v_#NULL.offset_6| 0) (= 2 (select |v_#length_50| 1)) (= |v_#NULL.base_6| 0) (= (select |v_#valid_83| 1) 1) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_47| 1) |v_#valid_82|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select |v_#valid_83| 0) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_33| 0) (= (store (store |v_#length_50| |v_ULTIMATE.start_main_~#t1~0#1.base_39| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_47| 4) |v_#length_49|) (= (select .cse1 1) 0) (= v_~b1~0_18 0) (= v_~y~0_38 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre3#1_29|) (= (select |v_#length_50| 2) 10) (= v_~b2~0_22 0) (= (select |v_#valid_83| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) (= (select |v_#valid_83| 2) 1) (= v_~X~0_32 0) (= |v_#memory_int_41| (store |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_42| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre3#1_29|))) (= (select .cse1 0) 48) (< 0 |v_#StackHeapBarrier_18|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_42|, #length=|v_#length_50|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_17|, ~b2~0=v_~b2~0_22, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ~X~0=v_~X~0_32, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_27|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_20|, #pthreadsForks=|v_#pthreadsForks_35|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_41|, #length=|v_#length_49|, ~y~0=v_~y~0_38, ~b1~0=v_~b1~0_18, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} 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] 9656#[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] 8864#[L741-3, thr1ENTRY]don't care [459] L741-3-->L742-3: Formula: (and (= (select |v_#valid_68| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= (+ |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_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_32| |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| |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_32|, #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_31|, #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] 8866#[L742-3, thr1ENTRY]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] 9526#[thr2ENTRY, thr1ENTRY, L742-4]don't care [420] 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] 9530#[L727-3, thr1ENTRY, L742-4]don't care [432] L727-3-->L716: Formula: (= v_~b2~0_12 1) InVars {} OutVars{~b2~0=v_~b2~0_12} AuxVars[] AssignedVars[~b2~0] 9586#[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] 9516#[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[] 9518#[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] 9658#[L723, thr1ENTRY, L742-4]don't care [431] 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] 8930#[L723, L701-3, L742-4]don't care [423] L701-3-->L690: Formula: (= v_~b1~0_8 1) InVars {} OutVars{~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 8934#[L723, L690, L742-4]don't care [371] L690-->L691: Formula: (= v_~x~0_5 1) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] 9660#[L723, L691, L742-4]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[] 9690#[L723, L742-4, L692]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] 9686#[L723, L693-2, L742-4]don't care [2022-07-26 14:03:17,050 INFO L735 eck$LassoCheckResult]: Loop: 9686#[L723, L693-2, L742-4]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[] 9686#[L723, L693-2, L742-4]don't care [2022-07-26 14:03:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1402141404, now seen corresponding path program 1 times [2022-07-26 14:03:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:17,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029576824] [2022-07-26 14:03:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:17,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:17,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:17,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 414, now seen corresponding path program 2 times [2022-07-26 14:03:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:17,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554485633] [2022-07-26 14:03:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:17,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:17,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:17,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:03:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 516710947, now seen corresponding path program 1 times [2022-07-26 14:03:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:03:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542992339] [2022-07-26 14:03:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:03:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:03:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:17,138 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:03:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:03:17,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:03:18,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:03:18 BoogieIcfgContainer [2022-07-26 14:03:18,109 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:03:18,110 INFO L158 Benchmark]: Toolchain (without parser) took 5450.21ms. Allocated memory was 184.5MB in the beginning and 246.4MB in the end (delta: 61.9MB). Free memory was 123.5MB in the beginning and 208.7MB in the end (delta: -85.2MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2022-07-26 14:03:18,110 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:03:18,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.67ms. Allocated memory was 184.5MB in the beginning and 246.4MB in the end (delta: 61.9MB). Free memory was 123.4MB in the beginning and 207.9MB in the end (delta: -84.5MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-07-26 14:03:18,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.58ms. Allocated memory is still 246.4MB. Free memory was 207.9MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:03:18,112 INFO L158 Benchmark]: Boogie Preprocessor took 48.99ms. Allocated memory is still 246.4MB. Free memory was 205.8MB in the beginning and 204.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 14:03:18,112 INFO L158 Benchmark]: RCFGBuilder took 509.97ms. Allocated memory is still 246.4MB. Free memory was 204.3MB in the beginning and 190.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-07-26 14:03:18,112 INFO L158 Benchmark]: BuchiAutomizer took 4347.84ms. Allocated memory is still 246.4MB. Free memory was 190.6MB in the beginning and 208.7MB in the end (delta: -18.1MB). Peak memory consumption was 114.8MB. Max. memory is 8.0GB. [2022-07-26 14:03:18,115 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.13ms. Allocated memory is still 184.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 474.67ms. Allocated memory was 184.5MB in the beginning and 246.4MB in the end (delta: 61.9MB). Free memory was 123.4MB in the beginning and 207.9MB in the end (delta: -84.5MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.58ms. Allocated memory is still 246.4MB. Free memory was 207.9MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.99ms. Allocated memory is still 246.4MB. Free memory was 205.8MB in the beginning and 204.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 509.97ms. Allocated memory is still 246.4MB. Free memory was 204.3MB in the beginning and 190.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4347.84ms. Allocated memory is still 246.4MB. Free memory was 190.6MB in the beginning and 208.7MB in the end (delta: -18.1MB). Peak memory consumption was 114.8MB. 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 502 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 236 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, 138 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 164 mSDtfsCounter, 218 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: 1.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 693]: 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, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, b1=0, b2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3062fe0 in17553,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cd78be0 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@18f2d507=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2bbf943a=0, t1={5754:0}, t2={5755:0}, X=0, x=1, y=2} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 693]: 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) [L742] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L714] COND TRUE 2 1 [L715] 2 b2 = 1 [L716] 2 x = 2 [L717] COND FALSE 2 !(y != 0) [L722] 2 y = 2 [L688] COND TRUE 1 1 [L689] 1 b1 = 1 [L690] 1 x = 1 [L691] COND TRUE 1 y != 0 [L692] 1 b1 = 0 Loop: [L693] COND TRUE y != 0 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 96 PlacesBefore, 50 PlacesAfterwards, 113 TransitionsBefore, 61 TransitionsAfterwards, 3332 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 6 ChoiceCompositions, 60 TotalNumberOfCompositions, 14736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6436, positive: 6029, positive conditional: 0, positive unconditional: 6029, negative: 407, negative conditional: 0, negative unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1436, positive: 1374, positive conditional: 0, positive unconditional: 1374, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6436, positive: 4655, positive conditional: 0, positive unconditional: 4655, negative: 345, negative conditional: 0, negative unconditional: 345, unknown: 1436, unknown conditional: 0, unknown unconditional: 1436] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 463, Positive conditional cache size: 0, Positive unconditional cache size: 463, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 14:03:18,180 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...