/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:44:14,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:44:14,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:44:14,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:44:14,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:44:14,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:44:14,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:44:14,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:44:14,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:44:14,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:44:14,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:44:14,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:44:14,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:44:14,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:44:14,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:44:14,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:44:14,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:44:14,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:44:14,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:44:14,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:44:14,352 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:44:14,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:44:14,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:44:14,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:44:14,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:44:14,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:44:14,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:44:14,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:44:14,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:44:14,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:44:14,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:44:14,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:44:14,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:44:14,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:44:14,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:44:14,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:44:14,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:44:14,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:44:14,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:44:14,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:44:14,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:44:14,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:44:14,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:44:14,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:44:14,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:44:14,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:44:14,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:44:14,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:44:14,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:44:14,388 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:44:14,388 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:44:14,388 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:44:14,388 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:44:14,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:44:14,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:44:14,390 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:44:14,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:44:14,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:44:14,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:44:14,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:44:14,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:44:14,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:44:14,392 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:44:14,392 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 13:44:14,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:44:14,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:44:14,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:44:14,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:44:14,651 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:44:14,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2022-07-26 13:44:14,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce41360ee/1556b83edb7c41768bd6d0f1f8d2bdfe/FLAGed72c1ed9 [2022-07-26 13:44:15,224 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:44:15,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2022-07-26 13:44:15,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce41360ee/1556b83edb7c41768bd6d0f1f8d2bdfe/FLAGed72c1ed9 [2022-07-26 13:44:15,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce41360ee/1556b83edb7c41768bd6d0f1f8d2bdfe [2022-07-26 13:44:15,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:44:15,709 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:44:15,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:15,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:44:15,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:44:15,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15532584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:15, skipping insertion in model container [2022-07-26 13:44:15,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:44:15" (1/1) ... [2022-07-26 13:44:15,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:44:15,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:44:15,932 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-26 13:44:16,065 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/dekker.i[31403,31416] [2022-07-26 13:44:16,076 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/dekker.i[32483,32496] [2022-07-26 13:44:16,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:16,090 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:44:16,100 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-26 13:44:16,116 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/dekker.i[31403,31416] [2022-07-26 13:44:16,118 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/dekker.i[32483,32496] [2022-07-26 13:44:16,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:44:16,153 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:44:16,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16 WrapperNode [2022-07-26 13:44:16,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:44:16,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:16,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:44:16,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:44:16,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,222 INFO L137 Inliner]: procedures = 172, calls = 60, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-26 13:44:16,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:44:16,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:44:16,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:44:16,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:44:16,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:44:16,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:44:16,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:44:16,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:44:16,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (1/1) ... [2022-07-26 13:44:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:44:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:44:16,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:44:16,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 13:44:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:44:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-26 13:44:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-26 13:44:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-26 13:44:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-26 13:44:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:44:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:44:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:44:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:44:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:44:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:44:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:44:16,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:44:16,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:44:16,340 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:44:16,459 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:44:16,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:44:16,727 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:44:16,734 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:44:16,734 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 13:44:16,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16 BoogieIcfgContainer [2022-07-26 13:44:16,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:44:16,738 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:44:16,738 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:44:16,747 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:44:16,747 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:44:15" (1/3) ... [2022-07-26 13:44:16,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c19089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:44:16" (2/3) ... [2022-07-26 13:44:16,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c19089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:44:16, skipping insertion in model container [2022-07-26 13:44:16,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:44:16,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:44:16" (3/3) ... [2022-07-26 13:44:16,750 INFO L322 chiAutomizerObserver]: Analyzing ICFG dekker.i [2022-07-26 13:44:16,867 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:44:16,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 106 transitions, 228 flow [2022-07-26 13:44:16,958 INFO L129 PetriNetUnfolder]: 13/102 cut-off events. [2022-07-26 13:44:16,958 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:16,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 102 events. 13/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-07-26 13:44:16,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 106 transitions, 228 flow [2022-07-26 13:44:16,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 102 transitions, 216 flow [2022-07-26 13:44:16,977 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:44:16,993 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 102 transitions, 216 flow [2022-07-26 13:44:16,995 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 102 transitions, 216 flow [2022-07-26 13:44:16,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 102 transitions, 216 flow [2022-07-26 13:44:17,022 INFO L129 PetriNetUnfolder]: 13/102 cut-off events. [2022-07-26 13:44:17,022 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:44:17,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 102 events. 13/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-07-26 13:44:17,027 INFO L116 LiptonReduction]: Number of co-enabled transitions 2000 [2022-07-26 13:44:19,511 INFO L131 LiptonReduction]: Checked pairs total: 4834 [2022-07-26 13:44:19,512 INFO L133 LiptonReduction]: Total number of compositions: 84 [2022-07-26 13:44:19,527 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:44:19,527 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:44:19,527 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:44:19,528 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:44:19,528 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:44:19,528 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:44:19,528 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:44:19,528 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:44:19,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:44:19,597 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 170 [2022-07-26 13:44:19,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,602 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 13:44:19,602 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:19,602 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:44:19,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 243 states, but on-demand construction may add more states [2022-07-26 13:44:19,612 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 170 [2022-07-26 13:44:19,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:19,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:19,612 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 13:44:19,612 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:19,617 INFO L733 eck$LassoCheckResult]: Stem: 101#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L792-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse0 (store |v_#valid_87| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= v_~turn~0_166 0) (= (select |v_#valid_87| 2) 1) (= v_~flag1~0_71 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_39|) 0) (= (select .cse1 0) 48) (= |v_#NULL.base_12| 0) (= (ite (and (<= v_~turn~0_166 1) (<= 0 v_~turn~0_166)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_39| 4) |v_#length_55|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_39|) (= (select |v_#valid_87| 1) 1) (= 2 (select |v_#length_56| 1)) (= (select .cse1 1) 0) (= v_~flag2~0_100 0) (= (select |v_#valid_87| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_39| 1) |v_#valid_86|) (= v_~x~0_83 0) (= (select |v_#valid_87| 0) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_56| 2) 9) (= |v_#pthreadsForks_42| |v_ULTIMATE.start_main_#t~pre4#1_35|) (= (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre4#1_35|)) |v_#memory_int_47|) (< 0 |v_#StackHeapBarrier_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_42|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_48|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_23|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_100, #valid=|v_#valid_86|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_47|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_18|, ~flag1~0=v_~flag1~0_71, #length=|v_#length_55|, ~turn~0=v_~turn~0_166, ~x~0=v_~x~0_83, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 104#[L792-3]don't care [319] L792-3-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_16, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_10, 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|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~t~0, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~f2~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 106#[thr1ENTRY, L792-4]don't care [329] thr1ENTRY-->L710: Formula: (and (= v_~flag1~0_18 1) (= |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, ~flag1~0=v_~flag1~0_18, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, ~flag1~0, thr1Thread1of1ForFork1_~_.offset] 110#[L792-4, L710]don't care [291] L710-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_1, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 116#[L792-4, L736]don't care [2022-07-26 13:44:19,617 INFO L735 eck$LassoCheckResult]: Loop: 116#[L792-4, L736]don't care [378] L736-->L718: Formula: (and (= v_thr1Thread1of1ForFork1_~t~0_43 0) (<= 1 v_thr1Thread1of1ForFork1_~f2~0_27) (= v_thr1Thread1of1ForFork1_~t~0_43 v_~turn~0_65)) InVars {thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_27, ~turn~0=v_~turn~0_65} OutVars{thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_43, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_27, ~turn~0=v_~turn~0_65} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0] 128#[L792-4, L718]don't care [304] L718-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_7 v_~flag2~0_5) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_7, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 116#[L792-4, L736]don't care [2022-07-26 13:44:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash 13305925, now seen corresponding path program 1 times [2022-07-26 13:44:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545407352] [2022-07-26 13:44:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 12983, now seen corresponding path program 1 times [2022-07-26 13:44:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826227260] [2022-07-26 13:44:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:19,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash -97895941, now seen corresponding path program 1 times [2022-07-26 13:44:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:19,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088578750] [2022-07-26 13:44:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:19,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:19,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088578750] [2022-07-26 13:44:19,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088578750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:19,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:19,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983763650] [2022-07-26 13:44:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:19,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:19,923 INFO L87 Difference]: Start difference. First operand currently 243 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,088 INFO L93 Difference]: Finished difference Result 320 states and 844 transitions. [2022-07-26 13:44:20,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 844 transitions. [2022-07-26 13:44:20,095 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 192 [2022-07-26 13:44:20,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 256 states and 698 transitions. [2022-07-26 13:44:20,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2022-07-26 13:44:20,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2022-07-26 13:44:20,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 698 transitions. [2022-07-26 13:44:20,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,116 INFO L220 hiAutomatonCegarLoop]: Abstraction has 256 states and 698 transitions. [2022-07-26 13:44:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 698 transitions. [2022-07-26 13:44:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 208. [2022-07-26 13:44:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 208 states have (on average 2.7884615384615383) internal successors, (580), 207 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 580 transitions. [2022-07-26 13:44:20,161 INFO L242 hiAutomatonCegarLoop]: Abstraction has 208 states and 580 transitions. [2022-07-26 13:44:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:20,170 INFO L426 stractBuchiCegarLoop]: Abstraction has 208 states and 580 transitions. [2022-07-26 13:44:20,170 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:44:20,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 580 transitions. [2022-07-26 13:44:20,172 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 152 [2022-07-26 13:44:20,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,173 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,173 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:20,173 INFO L733 eck$LassoCheckResult]: Stem: 1327#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L792-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse0 (store |v_#valid_87| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= v_~turn~0_166 0) (= (select |v_#valid_87| 2) 1) (= v_~flag1~0_71 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_39|) 0) (= (select .cse1 0) 48) (= |v_#NULL.base_12| 0) (= (ite (and (<= v_~turn~0_166 1) (<= 0 v_~turn~0_166)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_39| 4) |v_#length_55|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_39|) (= (select |v_#valid_87| 1) 1) (= 2 (select |v_#length_56| 1)) (= (select .cse1 1) 0) (= v_~flag2~0_100 0) (= (select |v_#valid_87| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_39| 1) |v_#valid_86|) (= v_~x~0_83 0) (= (select |v_#valid_87| 0) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_56| 2) 9) (= |v_#pthreadsForks_42| |v_ULTIMATE.start_main_#t~pre4#1_35|) (= (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre4#1_35|)) |v_#memory_int_47|) (< 0 |v_#StackHeapBarrier_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_42|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_48|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_23|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_100, #valid=|v_#valid_86|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_47|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_18|, ~flag1~0=v_~flag1~0_71, #length=|v_#length_55|, ~turn~0=v_~turn~0_166, ~x~0=v_~x~0_83, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1085#[L792-3]don't care [319] L792-3-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_16, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_10, 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|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~t~0, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~f2~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 957#[thr1ENTRY, L792-4]don't care [389] L792-4-->L793-3: Formula: (and (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_17|)) |v_#memory_int_31|) (= (select |v_#valid_64| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_37| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_ULTIMATE.start_main_#t~pre6#1_17| |v_#pthreadsForks_32|)) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, #length=|v_#length_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 959#[thr1ENTRY, L793-3]don't care [316] L793-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_10, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, 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_~t~1=v_thr2Thread1of1ForFork0_~t~1_16, 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_~f1~0, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~t~1, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 965#[thr1ENTRY, L793-4, thr2ENTRY]don't care [331] thr2ENTRY-->L751: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= v_~flag2~0_14 1) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, ~flag2~0=v_~flag2~0_14, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, ~flag2~0, thr2Thread1of1ForFork0_~_.base] 1239#[L751, thr1ENTRY, L793-4]don't care [266] L751-->L777: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork0_~f1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0] 1109#[L777, thr1ENTRY, L793-4]don't care [2022-07-26 13:44:20,174 INFO L735 eck$LassoCheckResult]: Loop: 1109#[L777, thr1ENTRY, L793-4]don't care [356] L777-->L758: Formula: (and (= v_~turn~0_29 v_thr2Thread1of1ForFork0_~t~1_27) (<= 1 v_thr2Thread1of1ForFork0_~f1~0_21)) InVars {thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_21, ~turn~0=v_~turn~0_29} OutVars{thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_21, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_27, ~turn~0=v_~turn~0_29} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~t~1] 1107#[L758, thr1ENTRY, L793-4]don't care [325] L758-->L777: Formula: (and (= v_thr2Thread1of1ForFork0_~f1~0_13 v_~flag1~0_13) (= v_thr2Thread1of1ForFork0_~t~1_17 1)) InVars {~flag1~0=v_~flag1~0_13, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_17} OutVars{thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_13, ~flag1~0=v_~flag1~0_13, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_17} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0] 1109#[L777, thr1ENTRY, L793-4]don't care [2022-07-26 13:44:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash -96085951, now seen corresponding path program 1 times [2022-07-26 13:44:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469533750] [2022-07-26 13:44:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,194 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 12322, now seen corresponding path program 1 times [2022-07-26 13:44:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389745410] [2022-07-26 13:44:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2144274334, now seen corresponding path program 1 times [2022-07-26 13:44:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650172740] [2022-07-26 13:44:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:44:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:44:20,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:44:20,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650172740] [2022-07-26 13:44:20,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650172740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:44:20,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:44:20,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:44:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032733600] [2022-07-26 13:44:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:44:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:44:20,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:44:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:44:20,355 INFO L87 Difference]: Start difference. First operand 208 states and 580 transitions. cyclomatic complexity: 396 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:44:20,486 INFO L93 Difference]: Finished difference Result 252 states and 675 transitions. [2022-07-26 13:44:20,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 675 transitions. [2022-07-26 13:44:20,489 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 158 [2022-07-26 13:44:20,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 230 states and 625 transitions. [2022-07-26 13:44:20,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2022-07-26 13:44:20,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2022-07-26 13:44:20,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 625 transitions. [2022-07-26 13:44:20,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:44:20,495 INFO L220 hiAutomatonCegarLoop]: Abstraction has 230 states and 625 transitions. [2022-07-26 13:44:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 625 transitions. [2022-07-26 13:44:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 198. [2022-07-26 13:44:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 2.772727272727273) internal successors, (549), 197 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:44:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 549 transitions. [2022-07-26 13:44:20,522 INFO L242 hiAutomatonCegarLoop]: Abstraction has 198 states and 549 transitions. [2022-07-26 13:44:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:44:20,523 INFO L426 stractBuchiCegarLoop]: Abstraction has 198 states and 549 transitions. [2022-07-26 13:44:20,523 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:44:20,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 549 transitions. [2022-07-26 13:44:20,525 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 136 [2022-07-26 13:44:20,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:44:20,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:44:20,526 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:44:20,526 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:44:20,526 INFO L733 eck$LassoCheckResult]: Stem: 1974#[ULTIMATE.startENTRY]don't care [405] ULTIMATE.startENTRY-->L792-3: Formula: (let ((.cse1 (select |v_#memory_int_48| 1)) (.cse0 (store |v_#valid_87| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (and (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= v_~turn~0_166 0) (= (select |v_#valid_87| 2) 1) (= v_~flag1~0_71 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_39|) 0) (= (select .cse1 0) 48) (= |v_#NULL.base_12| 0) (= (ite (and (<= v_~turn~0_166 1) (<= 0 v_~turn~0_166)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_39| 4) |v_#length_55|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_39|) (= (select |v_#valid_87| 1) 1) (= 2 (select |v_#length_56| 1)) (= (select .cse1 1) 0) (= v_~flag2~0_100 0) (= (select |v_#valid_87| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_39| 1) |v_#valid_86|) (= v_~x~0_83 0) (= (select |v_#valid_87| 0) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_56| 2) 9) (= |v_#pthreadsForks_42| |v_ULTIMATE.start_main_#t~pre4#1_35|) (= (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre4#1_35|)) |v_#memory_int_47|) (< 0 |v_#StackHeapBarrier_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_42|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_48|, #length=|v_#length_56|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_23|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, #NULL.base=|v_#NULL.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_100, #valid=|v_#valid_86|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_47|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_18|, ~flag1~0=v_~flag1~0_71, #length=|v_#length_55|, ~turn~0=v_~turn~0_166, ~x~0=v_~x~0_83, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_39|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1844#[L792-3]don't care [319] L792-3-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_16, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_10, 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|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~t~0, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~f2~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 1652#[thr1ENTRY, L792-4]don't care [389] L792-4-->L793-3: Formula: (and (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_17|)) |v_#memory_int_31|) (= (select |v_#valid_64| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_37| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_ULTIMATE.start_main_#t~pre6#1_17| |v_#pthreadsForks_32|)) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, #length=|v_#length_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1654#[thr1ENTRY, L793-3]don't care [329] thr1ENTRY-->L710: Formula: (and (= v_~flag1~0_18 1) (= |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, ~flag1~0=v_~flag1~0_18, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, ~flag1~0, thr1Thread1of1ForFork1_~_.offset] 1658#[L710, L793-3]don't care [316] L793-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_10, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, 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_~t~1=v_thr2Thread1of1ForFork0_~t~1_16, 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_~f1~0, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~t~1, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 1880#[L710, L793-4, thr2ENTRY]don't care [331] thr2ENTRY-->L751: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= v_~flag2~0_14 1) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, ~flag2~0=v_~flag2~0_14, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, ~flag2~0, thr2Thread1of1ForFork0_~_.base] 1928#[L751, L710, L793-4]don't care [291] L710-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_1, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 1970#[L751, L736, L793-4]don't care [2022-07-26 13:44:20,527 INFO L735 eck$LassoCheckResult]: Loop: 1970#[L751, L736, L793-4]don't care [378] L736-->L718: Formula: (and (= v_thr1Thread1of1ForFork1_~t~0_43 0) (<= 1 v_thr1Thread1of1ForFork1_~f2~0_27) (= v_thr1Thread1of1ForFork1_~t~0_43 v_~turn~0_65)) InVars {thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_27, ~turn~0=v_~turn~0_65} OutVars{thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_43, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_27, ~turn~0=v_~turn~0_65} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0] 1852#[L718, L751, L793-4]don't care [304] L718-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_7 v_~flag2~0_5) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_7, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 1970#[L751, L736, L793-4]don't care [2022-07-26 13:44:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1316677989, now seen corresponding path program 1 times [2022-07-26 13:44:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579916676] [2022-07-26 13:44:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash 12983, now seen corresponding path program 2 times [2022-07-26 13:44:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822140310] [2022-07-26 13:44:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:20,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:44:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1687792869, now seen corresponding path program 1 times [2022-07-26 13:44:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:44:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918213235] [2022-07-26 13:44:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:44:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:44:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:44:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:44:20,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:44:21,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:44:21 BoogieIcfgContainer [2022-07-26 13:44:21,448 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:44:21,449 INFO L158 Benchmark]: Toolchain (without parser) took 5739.74ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 128.1MB in the beginning and 109.2MB in the end (delta: 18.9MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-07-26 13:44:21,449 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 180.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:44:21,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.25ms. Allocated memory is still 180.4MB. Free memory was 127.9MB in the beginning and 145.4MB in the end (delta: -17.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-07-26 13:44:21,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.09ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 143.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:44:21,452 INFO L158 Benchmark]: Boogie Preprocessor took 31.83ms. Allocated memory is still 180.4MB. Free memory was 143.9MB in the beginning and 142.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:44:21,453 INFO L158 Benchmark]: RCFGBuilder took 478.79ms. Allocated memory is still 180.4MB. Free memory was 142.1MB in the beginning and 128.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-07-26 13:44:21,453 INFO L158 Benchmark]: BuchiAutomizer took 4710.19ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 128.7MB in the beginning and 109.2MB in the end (delta: 19.4MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-07-26 13:44:21,456 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.21ms. Allocated memory is still 180.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 442.25ms. Allocated memory is still 180.4MB. Free memory was 127.9MB in the beginning and 145.4MB in the end (delta: -17.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.09ms. Allocated memory is still 180.4MB. Free memory was 145.4MB in the beginning and 143.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.83ms. Allocated memory is still 180.4MB. Free memory was 143.9MB in the beginning and 142.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 478.79ms. Allocated memory is still 180.4MB. Free memory was 142.1MB in the beginning and 128.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4710.19ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 128.7MB in the beginning and 109.2MB in the end (delta: 19.4MB). Peak memory consumption was 60.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 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 198 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 80 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, 95 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203 IncrementalHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 24 mSDtfsCounter, 203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 714]: 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 {\old(cond)=1, \result=0, \result={0:0}, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, cond=1, f1=0, f2=1, flag1=1, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@517feb41 in10335,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5de9128a in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@15c59600=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3d2bda32=0, t=0, t=0, t1={22810:0}, t2={22811:0}, turn=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 714]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L704] 0 int flag1 = 0, flag2 = 0; [L705] 0 int turn; [L706] 0 int x; [L790] 0 pthread_t t1, t2; [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND TRUE 0 !cond [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L709] 1 flag1 = 1 [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L750] 2 flag2 = 1 [L712] 1 int f2 = flag2; Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE !(t != 0) [L735] f2 = flag2 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 96 PlacesBefore, 34 PlacesAfterwards, 102 TransitionsBefore, 34 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 13 ConcurrentYvCompositions, 6 ChoiceCompositions, 84 TotalNumberOfCompositions, 4834 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2584, positive: 2400, positive conditional: 0, positive unconditional: 2400, negative: 184, negative conditional: 0, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1384, positive: 1341, positive conditional: 0, positive unconditional: 1341, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1384, positive: 1312, positive conditional: 0, positive unconditional: 1312, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2584, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 1384, unknown conditional: 0, unknown unconditional: 1384] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 13:44:21,513 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...