/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:22:36,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:22:36,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:22:36,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:22:36,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:22:36,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:22:36,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:22:36,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:22:36,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:22:36,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:22:36,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:22:36,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:22:36,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:22:36,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:22:36,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:22:36,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:22:36,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:22:36,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:22:36,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:22:36,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:22:36,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:22:36,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:22:36,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:22:36,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:22:36,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:22:36,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:22:36,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:22:36,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:22:36,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:22:36,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:22:36,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:22:36,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:22:36,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:22:36,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:22:36,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:22:36,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:22:36,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:22:36,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:22:36,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:22:36,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:22:36,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:22:36,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-05 20:22:36,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:22:36,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:22:36,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:22:36,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:22:36,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:22:36,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:22:36,464 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:22:36,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:22:36,464 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:22:36,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:22:36,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:22:36,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:22:36,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:22:36,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:22:36,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:22:36,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:36,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:22:36,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-05 20:22:36,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:22:36,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:22:36,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:22:36,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:22:36,755 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:22:36,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:22:37,748 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:22:37,926 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:22:37,927 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:22:37,941 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf56dc52/51f1139dbd614998882e095858781bdb/FLAGc33cd2c8b [2022-12-05 20:22:37,951 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf56dc52/51f1139dbd614998882e095858781bdb [2022-12-05 20:22:37,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:22:37,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:22:37,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:37,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:22:37,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:22:37,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:37" (1/1) ... [2022-12-05 20:22:37,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbff4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:37, skipping insertion in model container [2022-12-05 20:22:37,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:37" (1/1) ... [2022-12-05 20:22:37,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:22:37,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:22:38,105 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:22:38,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:38,223 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:22:38,231 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:22:38,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:38,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:38,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:38,286 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:22:38,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38 WrapperNode [2022-12-05 20:22:38,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:38,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:38,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:22:38,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:22:38,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,321 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-05 20:22:38,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:38,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:22:38,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:22:38,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:22:38,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,339 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:22:38,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:22:38,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:22:38,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:22:38,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (1/1) ... [2022-12-05 20:22:38,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:38,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:22:38,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:22:38,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:22:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:22:38,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:22:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:22:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:22:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:22:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:22:38,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:22:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:22:38,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:22:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:22:38,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:22:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:22:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:22:38,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:22:38,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:22:38,431 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:22:38,594 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:22:38,596 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:22:38,855 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:22:39,011 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:22:39,011 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:22:39,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:39 BoogieIcfgContainer [2022-12-05 20:22:39,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:22:39,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:22:39,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:22:39,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:22:39,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:22:37" (1/3) ... [2022-12-05 20:22:39,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e6f1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:39, skipping insertion in model container [2022-12-05 20:22:39,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:38" (2/3) ... [2022-12-05 20:22:39,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e6f1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:39, skipping insertion in model container [2022-12-05 20:22:39,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:39" (3/3) ... [2022-12-05 20:22:39,032 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:22:39,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:22:39,052 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:22:39,052 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:22:39,098 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:22:39,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-12-05 20:22:39,180 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-05 20:22:39,180 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:39,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-05 20:22:39,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2022-12-05 20:22:39,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2022-12-05 20:22:39,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:22:39,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2022-12-05 20:22:39,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2022-12-05 20:22:39,238 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-12-05 20:22:39,239 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:39,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-05 20:22:39,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2022-12-05 20:22:39,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 2308 [2022-12-05 20:22:42,779 INFO L203 LiptonReduction]: Total number of compositions: 88 [2022-12-05 20:22:42,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:22:42,794 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5177546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:22:42,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:22:42,797 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 20:22:42,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:42,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:42,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:22:42,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 494295, now seen corresponding path program 1 times [2022-12-05 20:22:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:42,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049040584] [2022-12-05 20:22:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:43,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049040584] [2022-12-05 20:22:43,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049040584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:43,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:43,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:43,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422199610] [2022-12-05 20:22:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:43,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:43,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 20:22:43,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-05 20:22:43,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:43,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 20:22:43,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:43,445 INFO L130 PetriNetUnfolder]: 1330/2054 cut-off events. [2022-12-05 20:22:43,445 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-05 20:22:43,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 2054 events. 1330/2054 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10308 event pairs, 370 based on Foata normal form. 0/1837 useless extension candidates. Maximal degree in co-relation 4057. Up to 1594 conditions per place. [2022-12-05 20:22:43,456 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 2 changer transitions 8/46 dead transitions. [2022-12-05 20:22:43,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 193 flow [2022-12-05 20:22:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-05 20:22:43,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-05 20:22:43,465 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 57 transitions. [2022-12-05 20:22:43,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 193 flow [2022-12-05 20:22:43,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:22:43,468 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 56 flow [2022-12-05 20:22:43,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-05 20:22:43,472 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-05 20:22:43,472 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 56 flow [2022-12-05 20:22:43,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-05 20:22:43,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:43,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:43,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:22:43,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1068727097, now seen corresponding path program 1 times [2022-12-05 20:22:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:43,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106868800] [2022-12-05 20:22:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:43,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106868800] [2022-12-05 20:22:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106868800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:43,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021428] [2022-12-05 20:22:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:43,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:43,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-05 20:22:43,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-05 20:22:43,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:43,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-05 20:22:43,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:43,816 INFO L130 PetriNetUnfolder]: 1061/1780 cut-off events. [2022-12-05 20:22:43,816 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-05 20:22:43,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3516 conditions, 1780 events. 1061/1780 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9262 event pairs, 287 based on Foata normal form. 12/1762 useless extension candidates. Maximal degree in co-relation 3506. Up to 1495 conditions per place. [2022-12-05 20:22:43,823 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-05 20:22:43,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 160 flow [2022-12-05 20:22:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-05 20:22:43,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-05 20:22:43,825 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 56 flow. Second operand 3 states and 42 transitions. [2022-12-05 20:22:43,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 160 flow [2022-12-05 20:22:43,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:43,826 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 71 flow [2022-12-05 20:22:43,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-05 20:22:43,827 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2022-12-05 20:22:43,827 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 71 flow [2022-12-05 20:22:43,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-05 20:22:43,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:43,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:43,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:22:43,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1229198926, now seen corresponding path program 1 times [2022-12-05 20:22:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:43,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725566466] [2022-12-05 20:22:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:43,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:43,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725566466] [2022-12-05 20:22:43,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725566466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:43,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:43,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759516892] [2022-12-05 20:22:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:43,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:43,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 20:22:43,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-05 20:22:43,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:43,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 20:22:43,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:44,110 INFO L130 PetriNetUnfolder]: 882/1361 cut-off events. [2022-12-05 20:22:44,110 INFO L131 PetriNetUnfolder]: For 179/180 co-relation queries the response was YES. [2022-12-05 20:22:44,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 1361 events. 882/1361 cut-off events. For 179/180 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6240 event pairs, 296 based on Foata normal form. 36/1381 useless extension candidates. Maximal degree in co-relation 2974. Up to 927 conditions per place. [2022-12-05 20:22:44,116 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-05 20:22:44,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 154 flow [2022-12-05 20:22:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 20:22:44,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-05 20:22:44,125 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 71 flow. Second operand 3 states and 38 transitions. [2022-12-05 20:22:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 154 flow [2022-12-05 20:22:44,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:44,127 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 76 flow [2022-12-05 20:22:44,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-05 20:22:44,128 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-05 20:22:44,128 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 76 flow [2022-12-05 20:22:44,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-05 20:22:44,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:44,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:44,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:22:44,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 368160585, now seen corresponding path program 1 times [2022-12-05 20:22:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392443689] [2022-12-05 20:22:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:44,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:44,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392443689] [2022-12-05 20:22:44,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392443689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:44,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:44,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:44,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854014088] [2022-12-05 20:22:44,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:44,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:44,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:44,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:44,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:44,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-05 20:22:44,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-12-05 20:22:44,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:44,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-05 20:22:44,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:44,378 INFO L130 PetriNetUnfolder]: 1058/1709 cut-off events. [2022-12-05 20:22:44,378 INFO L131 PetriNetUnfolder]: For 411/412 co-relation queries the response was YES. [2022-12-05 20:22:44,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 1709 events. 1058/1709 cut-off events. For 411/412 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8236 event pairs, 348 based on Foata normal form. 32/1740 useless extension candidates. Maximal degree in co-relation 3734. Up to 1097 conditions per place. [2022-12-05 20:22:44,386 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 32 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-05 20:22:44,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 173 flow [2022-12-05 20:22:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 20:22:44,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-05 20:22:44,387 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 76 flow. Second operand 3 states and 40 transitions. [2022-12-05 20:22:44,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 173 flow [2022-12-05 20:22:44,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:44,391 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 80 flow [2022-12-05 20:22:44,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-12-05 20:22:44,392 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-05 20:22:44,392 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 80 flow [2022-12-05 20:22:44,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-12-05 20:22:44,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:44,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:44,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:22:44,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1471927063, now seen corresponding path program 1 times [2022-12-05 20:22:44,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:44,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837408374] [2022-12-05 20:22:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:44,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837408374] [2022-12-05 20:22:44,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837408374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:44,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:44,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:22:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2773718] [2022-12-05 20:22:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:44,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:44,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:44,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:44,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 20:22:44,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-12-05 20:22:44,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:44,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 20:22:44,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:44,608 INFO L130 PetriNetUnfolder]: 461/794 cut-off events. [2022-12-05 20:22:44,608 INFO L131 PetriNetUnfolder]: For 195/196 co-relation queries the response was YES. [2022-12-05 20:22:44,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 794 events. 461/794 cut-off events. For 195/196 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3583 event pairs, 132 based on Foata normal form. 55/839 useless extension candidates. Maximal degree in co-relation 1833. Up to 593 conditions per place. [2022-12-05 20:22:44,611 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 33 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-05 20:22:44,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 195 flow [2022-12-05 20:22:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-05 20:22:44,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:22:44,612 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 80 flow. Second operand 3 states and 45 transitions. [2022-12-05 20:22:44,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 195 flow [2022-12-05 20:22:44,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:44,613 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 102 flow [2022-12-05 20:22:44,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-05 20:22:44,614 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-05 20:22:44,614 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 102 flow [2022-12-05 20:22:44,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-12-05 20:22:44,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:44,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:44,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:22:44,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1469146869, now seen corresponding path program 1 times [2022-12-05 20:22:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:44,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958839725] [2022-12-05 20:22:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958839725] [2022-12-05 20:22:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958839725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:44,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:44,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375030213] [2022-12-05 20:22:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:44,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:44,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:44,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 20:22:44,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-12-05 20:22:44,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:44,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 20:22:44,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:44,790 INFO L130 PetriNetUnfolder]: 237/452 cut-off events. [2022-12-05 20:22:44,790 INFO L131 PetriNetUnfolder]: For 119/120 co-relation queries the response was YES. [2022-12-05 20:22:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 452 events. 237/452 cut-off events. For 119/120 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1913 event pairs, 95 based on Foata normal form. 46/488 useless extension candidates. Maximal degree in co-relation 1208. Up to 176 conditions per place. [2022-12-05 20:22:44,792 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2022-12-05 20:22:44,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 274 flow [2022-12-05 20:22:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-05 20:22:44,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-05 20:22:44,793 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 102 flow. Second operand 4 states and 61 transitions. [2022-12-05 20:22:44,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 274 flow [2022-12-05 20:22:44,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:22:44,795 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 138 flow [2022-12-05 20:22:44,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-05 20:22:44,796 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2022-12-05 20:22:44,796 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 138 flow [2022-12-05 20:22:44,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-12-05 20:22:44,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:44,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:44,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:22:44,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -354707030, now seen corresponding path program 1 times [2022-12-05 20:22:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:44,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630238257] [2022-12-05 20:22:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:44,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630238257] [2022-12-05 20:22:44,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630238257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:44,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:44,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099044016] [2022-12-05 20:22:44,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:44,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:44,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-05 20:22:44,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12-05 20:22:44,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:44,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-05 20:22:44,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:45,024 INFO L130 PetriNetUnfolder]: 206/388 cut-off events. [2022-12-05 20:22:45,024 INFO L131 PetriNetUnfolder]: For 349/350 co-relation queries the response was YES. [2022-12-05 20:22:45,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 388 events. 206/388 cut-off events. For 349/350 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1641 event pairs, 92 based on Foata normal form. 12/390 useless extension candidates. Maximal degree in co-relation 1088. Up to 176 conditions per place. [2022-12-05 20:22:45,026 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 40 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-05 20:22:45,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 298 flow [2022-12-05 20:22:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-05 20:22:45,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-05 20:22:45,028 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 138 flow. Second operand 5 states and 64 transitions. [2022-12-05 20:22:45,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 298 flow [2022-12-05 20:22:45,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 272 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:45,031 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 142 flow [2022-12-05 20:22:45,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-05 20:22:45,032 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-05 20:22:45,032 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 142 flow [2022-12-05 20:22:45,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12-05 20:22:45,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:45,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:45,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:22:45,032 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1998699132, now seen corresponding path program 1 times [2022-12-05 20:22:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:45,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173004835] [2022-12-05 20:22:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:45,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:45,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173004835] [2022-12-05 20:22:45,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173004835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:45,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:45,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:22:45,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799141197] [2022-12-05 20:22:45,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:45,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:22:45,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:22:45,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:22:45,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 20:22:45,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 142 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:45,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:45,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 20:22:45,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:46,104 INFO L130 PetriNetUnfolder]: 749/1302 cut-off events. [2022-12-05 20:22:46,104 INFO L131 PetriNetUnfolder]: For 1467/1467 co-relation queries the response was YES. [2022-12-05 20:22:46,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3792 conditions, 1302 events. 749/1302 cut-off events. For 1467/1467 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6338 event pairs, 95 based on Foata normal form. 1/1303 useless extension candidates. Maximal degree in co-relation 3776. Up to 285 conditions per place. [2022-12-05 20:22:46,110 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 103 selfloop transitions, 30 changer transitions 16/149 dead transitions. [2022-12-05 20:22:46,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 149 transitions, 940 flow [2022-12-05 20:22:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:22:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:22:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-12-05 20:22:46,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43703703703703706 [2022-12-05 20:22:46,113 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 142 flow. Second operand 9 states and 118 transitions. [2022-12-05 20:22:46,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 149 transitions, 940 flow [2022-12-05 20:22:46,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 149 transitions, 830 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-05 20:22:46,123 INFO L231 Difference]: Finished difference. Result has 53 places, 62 transitions, 355 flow [2022-12-05 20:22:46,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=355, PETRI_PLACES=53, PETRI_TRANSITIONS=62} [2022-12-05 20:22:46,124 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2022-12-05 20:22:46,124 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 355 flow [2022-12-05 20:22:46,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:46,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:46,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:46,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:22:46,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -506965090, now seen corresponding path program 2 times [2022-12-05 20:22:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:46,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591915828] [2022-12-05 20:22:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:46,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591915828] [2022-12-05 20:22:46,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591915828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:46,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:46,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052842815] [2022-12-05 20:22:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:46,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:46,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:46,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:46,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-05 20:22:46,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:46,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:46,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-05 20:22:46,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:46,459 INFO L130 PetriNetUnfolder]: 792/1466 cut-off events. [2022-12-05 20:22:46,459 INFO L131 PetriNetUnfolder]: For 2515/2723 co-relation queries the response was YES. [2022-12-05 20:22:46,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 1466 events. 792/1466 cut-off events. For 2515/2723 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8330 event pairs, 219 based on Foata normal form. 75/1510 useless extension candidates. Maximal degree in co-relation 5433. Up to 646 conditions per place. [2022-12-05 20:22:46,467 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 51 selfloop transitions, 1 changer transitions 55/112 dead transitions. [2022-12-05 20:22:46,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 847 flow [2022-12-05 20:22:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 20:22:46,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 20:22:46,469 INFO L175 Difference]: Start difference. First operand has 53 places, 62 transitions, 355 flow. Second operand 4 states and 48 transitions. [2022-12-05 20:22:46,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 847 flow [2022-12-05 20:22:46,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 839 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-05 20:22:46,481 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 259 flow [2022-12-05 20:22:46,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-05 20:22:46,482 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-05 20:22:46,482 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 259 flow [2022-12-05 20:22:46,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:46,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:46,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:46,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:22:46,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:46,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:46,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2076723204, now seen corresponding path program 3 times [2022-12-05 20:22:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:46,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209401996] [2022-12-05 20:22:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:46,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:46,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:22:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:46,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:22:46,558 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:22:46,558 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:22:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:22:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:22:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:22:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:22:46,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:22:46,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:22:46,560 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:46,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:22:46,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:22:46,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:22:46 BasicIcfg [2022-12-05 20:22:46,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:22:46,605 INFO L158 Benchmark]: Toolchain (without parser) took 8651.47ms. Allocated memory was 250.6MB in the beginning and 459.3MB in the end (delta: 208.7MB). Free memory was 224.2MB in the beginning and 338.4MB in the end (delta: -114.1MB). Peak memory consumption was 95.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:46,605 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 250.6MB. Free memory is still 226.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:22:46,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.13ms. Allocated memory is still 250.6MB. Free memory was 224.2MB in the beginning and 197.0MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 20:22:46,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.64ms. Allocated memory is still 250.6MB. Free memory was 196.5MB in the beginning and 194.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:46,605 INFO L158 Benchmark]: Boogie Preprocessor took 20.89ms. Allocated memory is still 250.6MB. Free memory was 194.4MB in the beginning and 192.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:46,606 INFO L158 Benchmark]: RCFGBuilder took 670.06ms. Allocated memory is still 250.6MB. Free memory was 192.3MB in the beginning and 207.0MB in the end (delta: -14.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 20:22:46,606 INFO L158 Benchmark]: TraceAbstraction took 7576.73ms. Allocated memory was 250.6MB in the beginning and 459.3MB in the end (delta: 208.7MB). Free memory was 206.5MB in the beginning and 338.4MB in the end (delta: -131.9MB). Peak memory consumption was 77.3MB. Max. memory is 8.0GB. [2022-12-05 20:22:46,607 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.11ms. Allocated memory is still 250.6MB. Free memory is still 226.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.13ms. Allocated memory is still 250.6MB. Free memory was 224.2MB in the beginning and 197.0MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.64ms. Allocated memory is still 250.6MB. Free memory was 196.5MB in the beginning and 194.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.89ms. Allocated memory is still 250.6MB. Free memory was 194.4MB in the beginning and 192.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 670.06ms. Allocated memory is still 250.6MB. Free memory was 192.3MB in the beginning and 207.0MB in the end (delta: -14.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 7576.73ms. Allocated memory was 250.6MB in the beginning and 459.3MB in the end (delta: 208.7MB). Free memory was 206.5MB in the beginning and 338.4MB in the end (delta: -131.9MB). Peak memory consumption was 77.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 121 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 30 TransitionsAfterwards, 2308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 44 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1901, independent: 1839, independent conditional: 1839, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1901, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1901, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1901, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1522, independent: 1480, independent conditional: 0, independent unconditional: 1480, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1522, independent: 1463, independent conditional: 0, independent unconditional: 1463, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1901, independent: 359, independent conditional: 0, independent unconditional: 359, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1522, unknown conditional: 0, unknown unconditional: 1522] , Statistics on independence cache: Total cache size (in pairs): 2384, Positive cache size: 2342, Positive conditional cache size: 0, Positive unconditional cache size: 2342, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=-2, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=-1, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L857] 0 pthread_t t875; [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 628 IncrementalHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 14 mSDtfsCounter, 628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:22:46,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...