/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:40:26,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:40:26,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:40:26,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:40:26,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:40:26,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:40:26,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:40:26,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:40:26,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:40:26,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:40:26,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:40:26,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:40:26,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:40:26,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:40:26,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:40:26,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:40:26,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:40:26,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:40:26,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:40:26,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:40:26,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:40:26,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:40:26,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:40:26,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:40:26,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:40:26,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:40:26,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:40:26,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:40:26,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:40:26,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:40:26,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:40:26,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:40:26,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:40:26,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:40:26,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:40:26,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:40:26,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:40:26,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:40:26,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:40:26,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:40:26,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:40:26,405 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-NoLbe.epf [2022-12-06 16:40:26,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:40:26,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:40:26,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:40:26,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:40:26,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:40:26,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:40:26,433 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:40:26,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:40:26,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:40:26,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:40:26,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:40:26,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:40:26,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:40:26,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:40:26,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:40:26,436 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:40:26,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:40:26,436 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:40:26,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:40:26,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:40:26,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:40:26,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:40:26,735 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:40:26,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 16:40:27,815 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:40:28,088 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:40:28,089 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 16:40:28,102 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc9a5926/4dbc13129782498f95dc91ec868b19f4/FLAGc35a3178a [2022-12-06 16:40:28,117 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc9a5926/4dbc13129782498f95dc91ec868b19f4 [2022-12-06 16:40:28,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:40:28,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:40:28,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:40:28,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:40:28,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:40:28,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3702d76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28, skipping insertion in model container [2022-12-06 16:40:28,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:40:28,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:40:28,310 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-06 16:40:28,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:40:28,459 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:40:28,467 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-06 16:40:28,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:40:28,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:40:28,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:40:28,527 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:40:28,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28 WrapperNode [2022-12-06 16:40:28,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:40:28,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:40:28,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:40:28,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:40:28,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,600 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-06 16:40:28,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:40:28,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:40:28,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:40:28,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:40:28,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:40:28,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:40:28,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:40:28,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:40:28,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (1/1) ... [2022-12-06 16:40:28,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:40:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:40:28,717 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-06 16:40:28,742 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-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:40:28,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:40:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:40:28,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:40:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:40:28,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:40:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:40:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:40:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:40:28,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:40:28,770 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:40:28,856 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:40:28,858 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:40:29,053 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:40:29,162 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:40:29,163 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:40:29,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:29 BoogieIcfgContainer [2022-12-06 16:40:29,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:40:29,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:40:29,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:40:29,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:40:29,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:40:28" (1/3) ... [2022-12-06 16:40:29,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f3554c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:40:29, skipping insertion in model container [2022-12-06 16:40:29,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:40:28" (2/3) ... [2022-12-06 16:40:29,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f3554c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:40:29, skipping insertion in model container [2022-12-06 16:40:29,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:40:29" (3/3) ... [2022-12-06 16:40:29,170 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 16:40:29,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:40:29,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:40:29,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:40:29,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:40:29,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 16:40:29,420 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 16:40:29,420 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:40:29,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 16:40:29,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 16:40:29,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-06 16:40:29,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:40:29,468 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;@7e70202e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:40:29,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:40:29,491 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-06 16:40:29,503 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:40:29,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:29,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:40:29,505 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-06 16:40:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2060284455, now seen corresponding path program 1 times [2022-12-06 16:40:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036699180] [2022-12-06 16:40:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:29,914 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-06 16:40:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:29,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036699180] [2022-12-06 16:40:29,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036699180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:29,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:29,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:40:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956201349] [2022-12-06 16:40:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:29,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:40:29,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:29,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:40:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:40:29,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2022-12-06 16:40:29,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-06 16:40:29,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:29,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2022-12-06 16:40:29,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:30,158 INFO L130 PetriNetUnfolder]: 58/445 cut-off events. [2022-12-06 16:40:30,158 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 16:40:30,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 445 events. 58/445 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2286 event pairs, 44 based on Foata normal form. 17/432 useless extension candidates. Maximal degree in co-relation 527. Up to 79 conditions per place. [2022-12-06 16:40:30,165 INFO L137 encePairwiseOnDemand]: 101/106 looper letters, 14 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2022-12-06 16:40:30,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 257 flow [2022-12-06 16:40:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:40:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:40:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-12-06 16:40:30,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9339622641509434 [2022-12-06 16:40:30,184 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-06 16:40:30,185 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 257 flow [2022-12-06 16:40:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-06 16:40:30,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:30,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:30,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:40:30,186 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-06 16:40:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1106117656, now seen corresponding path program 1 times [2022-12-06 16:40:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:30,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006594571] [2022-12-06 16:40:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:31,010 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-06 16:40:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006594571] [2022-12-06 16:40:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006594571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:31,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:40:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866173729] [2022-12-06 16:40:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:31,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:40:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:31,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:40:31,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:40:31,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-06 16:40:31,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 257 flow. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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-06 16:40:31,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:31,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-06 16:40:31,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:31,923 INFO L130 PetriNetUnfolder]: 2340/5145 cut-off events. [2022-12-06 16:40:31,923 INFO L131 PetriNetUnfolder]: For 1059/1967 co-relation queries the response was YES. [2022-12-06 16:40:31,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10177 conditions, 5145 events. 2340/5145 cut-off events. For 1059/1967 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 40497 event pairs, 273 based on Foata normal form. 0/5000 useless extension candidates. Maximal degree in co-relation 10118. Up to 1563 conditions per place. [2022-12-06 16:40:31,948 INFO L137 encePairwiseOnDemand]: 91/106 looper letters, 47 selfloop transitions, 16 changer transitions 111/235 dead transitions. [2022-12-06 16:40:31,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 235 transitions, 983 flow [2022-12-06 16:40:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:40:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:40:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1091 transitions. [2022-12-06 16:40:31,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7917271407837445 [2022-12-06 16:40:31,952 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-06 16:40:31,952 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 235 transitions, 983 flow [2022-12-06 16:40:31,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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-06 16:40:31,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:31,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:31,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:40:31,953 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-06 16:40:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:31,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1871307783, now seen corresponding path program 1 times [2022-12-06 16:40:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:31,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116222561] [2022-12-06 16:40:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:32,829 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-06 16:40:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:32,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116222561] [2022-12-06 16:40:32,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116222561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:32,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:32,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:40:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644516143] [2022-12-06 16:40:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:32,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:40:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:40:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:40:32,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-06 16:40:32,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 235 transitions, 983 flow. Second operand has 10 states, 10 states have (on average 75.0) internal successors, (750), 10 states have internal predecessors, (750), 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-06 16:40:32,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:32,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-06 16:40:32,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:34,376 INFO L130 PetriNetUnfolder]: 4142/9709 cut-off events. [2022-12-06 16:40:34,377 INFO L131 PetriNetUnfolder]: For 1915/3881 co-relation queries the response was YES. [2022-12-06 16:40:34,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24544 conditions, 9709 events. 4142/9709 cut-off events. For 1915/3881 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 90659 event pairs, 194 based on Foata normal form. 56/9617 useless extension candidates. Maximal degree in co-relation 24473. Up to 2448 conditions per place. [2022-12-06 16:40:34,410 INFO L137 encePairwiseOnDemand]: 86/106 looper letters, 68 selfloop transitions, 54 changer transitions 555/738 dead transitions. [2022-12-06 16:40:34,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 738 transitions, 4689 flow [2022-12-06 16:40:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 16:40:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 16:40:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1896 transitions. [2022-12-06 16:40:34,414 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7776866283839212 [2022-12-06 16:40:34,414 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 34 predicate places. [2022-12-06 16:40:34,414 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 738 transitions, 4689 flow [2022-12-06 16:40:34,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 10 states have internal predecessors, (750), 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-06 16:40:34,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:34,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:34,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:40:34,415 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-06 16:40:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash 900081473, now seen corresponding path program 1 times [2022-12-06 16:40:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625766017] [2022-12-06 16:40:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:34,864 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-06 16:40:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:34,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625766017] [2022-12-06 16:40:34,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625766017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:34,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:34,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 16:40:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803477664] [2022-12-06 16:40:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:34,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 16:40:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:34,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 16:40:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 16:40:34,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:40:34,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 738 transitions, 4689 flow. Second operand has 10 states, 10 states have (on average 83.5) internal successors, (835), 10 states have internal predecessors, (835), 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-06 16:40:34,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:34,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:40:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:36,145 INFO L130 PetriNetUnfolder]: 4994/11891 cut-off events. [2022-12-06 16:40:36,146 INFO L131 PetriNetUnfolder]: For 5079/10677 co-relation queries the response was YES. [2022-12-06 16:40:36,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35594 conditions, 11891 events. 4994/11891 cut-off events. For 5079/10677 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 117438 event pairs, 210 based on Foata normal form. 64/11820 useless extension candidates. Maximal degree in co-relation 35516. Up to 3859 conditions per place. [2022-12-06 16:40:36,192 INFO L137 encePairwiseOnDemand]: 97/106 looper letters, 66 selfloop transitions, 11 changer transitions 741/923 dead transitions. [2022-12-06 16:40:36,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 923 transitions, 7207 flow [2022-12-06 16:40:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 16:40:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 16:40:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1051 transitions. [2022-12-06 16:40:36,195 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8262578616352201 [2022-12-06 16:40:36,195 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2022-12-06 16:40:36,196 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 923 transitions, 7207 flow [2022-12-06 16:40:36,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.5) internal successors, (835), 10 states have internal predecessors, (835), 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-06 16:40:36,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:36,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:36,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:40:36,196 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-06 16:40:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash 605905867, now seen corresponding path program 1 times [2022-12-06 16:40:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:36,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797173897] [2022-12-06 16:40:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:36,710 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-06 16:40:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797173897] [2022-12-06 16:40:36,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797173897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:36,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:36,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:40:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143672812] [2022-12-06 16:40:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:36,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:40:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:36,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:40:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:40:36,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-06 16:40:36,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 923 transitions, 7207 flow. Second operand has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-06 16:40:36,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:36,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-06 16:40:36,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:39,381 INFO L130 PetriNetUnfolder]: 7719/19237 cut-off events. [2022-12-06 16:40:39,382 INFO L131 PetriNetUnfolder]: For 7841/22272 co-relation queries the response was YES. [2022-12-06 16:40:39,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67978 conditions, 19237 events. 7719/19237 cut-off events. For 7841/22272 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 213629 event pairs, 180 based on Foata normal form. 78/19184 useless extension candidates. Maximal degree in co-relation 67888. Up to 6154 conditions per place. [2022-12-06 16:40:39,458 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 101 selfloop transitions, 49 changer transitions 1564/1775 dead transitions. [2022-12-06 16:40:39,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1775 transitions, 17665 flow [2022-12-06 16:40:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:40:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:40:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1093 transitions. [2022-12-06 16:40:39,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.793178519593614 [2022-12-06 16:40:39,462 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 57 predicate places. [2022-12-06 16:40:39,462 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 1775 transitions, 17665 flow [2022-12-06 16:40:39,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 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-06 16:40:39,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:39,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:40:39,463 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-06 16:40:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1359611177, now seen corresponding path program 1 times [2022-12-06 16:40:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841670130] [2022-12-06 16:40:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:39,844 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-06 16:40:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841670130] [2022-12-06 16:40:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841670130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:39,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:40:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643756780] [2022-12-06 16:40:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:39,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:40:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:40:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:40:39,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2022-12-06 16:40:39,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 1775 transitions, 17665 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-06 16:40:39,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:39,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2022-12-06 16:40:39,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:43,714 INFO L130 PetriNetUnfolder]: 11010/29381 cut-off events. [2022-12-06 16:40:43,715 INFO L131 PetriNetUnfolder]: For 18941/33312 co-relation queries the response was YES. [2022-12-06 16:40:43,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114198 conditions, 29381 events. 11010/29381 cut-off events. For 18941/33312 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 365075 event pairs, 290 based on Foata normal form. 62/29271 useless extension candidates. Maximal degree in co-relation 114104. Up to 10336 conditions per place. [2022-12-06 16:40:43,908 INFO L137 encePairwiseOnDemand]: 100/106 looper letters, 114 selfloop transitions, 13 changer transitions 2115/2342 dead transitions. [2022-12-06 16:40:43,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 2342 transitions, 27785 flow [2022-12-06 16:40:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:40:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:40:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2022-12-06 16:40:43,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8574423480083857 [2022-12-06 16:40:43,911 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 65 predicate places. [2022-12-06 16:40:43,911 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 2342 transitions, 27785 flow [2022-12-06 16:40:43,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-06 16:40:43,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:43,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:43,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:40:43,912 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-06 16:40:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash 339160238, now seen corresponding path program 1 times [2022-12-06 16:40:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:43,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432960428] [2022-12-06 16:40:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:44,285 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-06 16:40:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:44,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432960428] [2022-12-06 16:40:44,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432960428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:44,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:40:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983099188] [2022-12-06 16:40:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:40:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:44,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:40:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:40:44,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2022-12-06 16:40:44,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 2342 transitions, 27785 flow. Second operand has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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-06 16:40:44,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:44,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2022-12-06 16:40:44,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:40:52,075 INFO L130 PetriNetUnfolder]: 15669/44548 cut-off events. [2022-12-06 16:40:52,075 INFO L131 PetriNetUnfolder]: For 26037/94774 co-relation queries the response was YES. [2022-12-06 16:40:52,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194750 conditions, 44548 events. 15669/44548 cut-off events. For 26037/94774 co-relation queries the response was YES. Maximal size of possible extension queue 2948. Compared 611810 event pairs, 220 based on Foata normal form. 138/44501 useless extension candidates. Maximal degree in co-relation 194644. Up to 16161 conditions per place. [2022-12-06 16:40:52,233 INFO L137 encePairwiseOnDemand]: 92/106 looper letters, 155 selfloop transitions, 33 changer transitions 3714/3963 dead transitions. [2022-12-06 16:40:52,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 3963 transitions, 56191 flow [2022-12-06 16:40:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:40:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:40:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1093 transitions. [2022-12-06 16:40:52,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.793178519593614 [2022-12-06 16:40:52,237 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 77 predicate places. [2022-12-06 16:40:52,238 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 3963 transitions, 56191 flow [2022-12-06 16:40:52,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.14285714285714) internal successors, (533), 7 states have internal predecessors, (533), 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-06 16:40:52,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:40:52,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:40:52,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:40:52,238 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-06 16:40:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:40:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1184223660, now seen corresponding path program 1 times [2022-12-06 16:40:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:40:52,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054455811] [2022-12-06 16:40:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:40:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:40:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:40:52,676 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-06 16:40:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:40:52,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054455811] [2022-12-06 16:40:52,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054455811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:40:52,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:40:52,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:40:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253204696] [2022-12-06 16:40:52,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:40:52,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:40:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:40:52,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:40:52,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:40:52,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 106 [2022-12-06 16:40:52,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 3963 transitions, 56191 flow. Second operand has 11 states, 11 states have (on average 82.45454545454545) internal successors, (907), 11 states have internal predecessors, (907), 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-06 16:40:52,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:40:52,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 106 [2022-12-06 16:40:52,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:06,786 INFO L130 PetriNetUnfolder]: 18534/54159 cut-off events. [2022-12-06 16:41:06,786 INFO L131 PetriNetUnfolder]: For 46712/118405 co-relation queries the response was YES. [2022-12-06 16:41:06,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259181 conditions, 54159 events. 18534/54159 cut-off events. For 46712/118405 co-relation queries the response was YES. Maximal size of possible extension queue 3686. Compared 775717 event pairs, 301 based on Foata normal form. 255/54231 useless extension candidates. Maximal degree in co-relation 259067. Up to 20382 conditions per place. [2022-12-06 16:41:06,997 INFO L137 encePairwiseOnDemand]: 93/106 looper letters, 114 selfloop transitions, 39 changer transitions 4886/5144 dead transitions. [2022-12-06 16:41:06,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 5144 transitions, 82791 flow [2022-12-06 16:41:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:41:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:41:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1459 transitions. [2022-12-06 16:41:07,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8096559378468369 [2022-12-06 16:41:07,000 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 93 predicate places. [2022-12-06 16:41:07,001 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 5144 transitions, 82791 flow [2022-12-06 16:41:07,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 82.45454545454545) internal successors, (907), 11 states have internal predecessors, (907), 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-06 16:41:07,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:07,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:41:07,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:41:07,001 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-06 16:41:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1748792596, now seen corresponding path program 1 times [2022-12-06 16:41:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:07,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052871441] [2022-12-06 16:41:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:07,635 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-06 16:41:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:07,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052871441] [2022-12-06 16:41:07,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052871441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:07,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:07,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:41:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484543706] [2022-12-06 16:41:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:41:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:41:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:41:07,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:41:07,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 5144 transitions, 82791 flow. Second operand has 9 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 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-06 16:41:07,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:07,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:41:07,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:30,645 INFO L130 PetriNetUnfolder]: 22191/65603 cut-off events. [2022-12-06 16:41:30,645 INFO L131 PetriNetUnfolder]: For 81421/192498 co-relation queries the response was YES. [2022-12-06 16:41:30,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347141 conditions, 65603 events. 22191/65603 cut-off events. For 81421/192498 co-relation queries the response was YES. Maximal size of possible extension queue 4574. Compared 969808 event pairs, 72 based on Foata normal form. 62/65495 useless extension candidates. Maximal degree in co-relation 347020. Up to 25261 conditions per place. [2022-12-06 16:41:30,877 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 158 selfloop transitions, 31 changer transitions 7743/8038 dead transitions. [2022-12-06 16:41:30,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 8038 transitions, 147495 flow [2022-12-06 16:41:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 16:41:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 16:41:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 967 transitions. [2022-12-06 16:41:30,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8293310463121784 [2022-12-06 16:41:30,880 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 103 predicate places. [2022-12-06 16:41:30,880 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 8038 transitions, 147495 flow [2022-12-06 16:41:30,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 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-06 16:41:30,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:41:30,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:41:30,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:41:30,881 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-06 16:41:30,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:41:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2030953907, now seen corresponding path program 1 times [2022-12-06 16:41:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:41:30,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398121389] [2022-12-06 16:41:30,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:41:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:41:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:41:30,994 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-06 16:41:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:41:30,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398121389] [2022-12-06 16:41:30,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398121389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:41:30,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:41:30,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:41:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454695990] [2022-12-06 16:41:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:41:30,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:41:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:41:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:41:30,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:41:30,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:41:30,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 8038 transitions, 147495 flow. Second operand has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 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-06 16:41:30,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:41:30,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:41:30,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:41:35,560 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][359], [120#true, 205#true, 59#L2true, 56#L799true, 117#true, 108#L772true, 246#(= ~y~0 1), 95#L752true, 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 335#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:35,561 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][362], [120#true, 205#true, 59#L2true, 66#L792true, 117#true, 108#L772true, 246#(= ~y~0 1), 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 17#L759true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 335#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:35,561 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,561 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L772-->L779: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_101 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_55 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_36 v_~z~0_56))) (= v_~z$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_97)) (= v_~z$w_buff0_used~0_101 (ite .cse0 0 v_~z$w_buff0_used~0_102)) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_20))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_102, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][365], [120#true, 205#true, 59#L2true, 66#L792true, 117#true, 246#(= ~y~0 1), 95#L752true, 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 39#L779true, 335#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:35,562 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,562 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,562 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:35,562 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:41:37,362 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][358], [120#true, 205#true, 56#L799true, 108#L772true, 117#true, 246#(= ~y~0 1), 95#L752true, 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 337#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 46#L3true, 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:37,363 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,363 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,363 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,363 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,367 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][361], [120#true, 205#true, 66#L792true, 108#L772true, 117#true, 246#(= ~y~0 1), 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 17#L759true, 337#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 46#L3true, 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:37,367 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,367 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,367 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,367 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,371 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L772-->L779: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_101 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_55 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_36 v_~z~0_56))) (= v_~z$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_97)) (= v_~z$w_buff0_used~0_101 (ite .cse0 0 v_~z$w_buff0_used~0_102)) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_20))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_102, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][364], [120#true, 205#true, 66#L792true, 117#true, 246#(= ~y~0 1), 95#L752true, 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 337#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 39#L779true, 46#L3true, 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:37,371 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,371 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,371 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:37,371 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 16:41:38,261 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][358], [120#true, 205#true, 56#L799true, 108#L772true, 117#true, 105#L3-1true, 246#(= ~y~0 1), 95#L752true, 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 337#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:38,261 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,261 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,261 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,261 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,264 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][361], [120#true, 205#true, 66#L792true, 108#L772true, 117#true, 105#L3-1true, 246#(= ~y~0 1), 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 17#L759true, 337#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:38,264 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,264 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,264 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,264 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,267 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([330] L772-->L779: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_101 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_55 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_36 v_~z~0_56))) (= v_~z$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_97)) (= v_~z$w_buff0_used~0_101 (ite .cse0 0 v_~z$w_buff0_used~0_102)) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_20))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_102, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0][364], [120#true, 205#true, 66#L792true, 117#true, 105#L3-1true, 246#(= ~y~0 1), 95#L752true, 306#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), P1Thread1of1ForFork0InUse, 337#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P2Thread1of1ForFork1InUse, 185#(= ~z$r_buff0_thd0~0 0), 143#true, 39#L779true, 230#(= ~x~0 1), 272#true]) [2022-12-06 16:41:38,267 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,267 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,267 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:41:38,267 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:42:00,564 INFO L130 PetriNetUnfolder]: 12529/31293 cut-off events. [2022-12-06 16:42:00,565 INFO L131 PetriNetUnfolder]: For 334937/398381 co-relation queries the response was YES. [2022-12-06 16:42:00,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177419 conditions, 31293 events. 12529/31293 cut-off events. For 334937/398381 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 369201 event pairs, 527 based on Foata normal form. 3687/33854 useless extension candidates. Maximal degree in co-relation 177294. Up to 12726 conditions per place. [2022-12-06 16:42:00,704 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 219 selfloop transitions, 15 changer transitions 2871/3274 dead transitions. [2022-12-06 16:42:00,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 3274 transitions, 63469 flow [2022-12-06 16:42:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:42:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:42:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 902 transitions. [2022-12-06 16:42:00,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8509433962264151 [2022-12-06 16:42:00,708 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 112 predicate places. [2022-12-06 16:42:00,708 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 3274 transitions, 63469 flow [2022-12-06 16:42:00,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 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-06 16:42:00,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:00,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:42:00,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:42:00,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:42:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1751735941, now seen corresponding path program 1 times [2022-12-06 16:42:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:00,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274877574] [2022-12-06 16:42:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:00,831 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-06 16:42:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:00,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274877574] [2022-12-06 16:42:00,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274877574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:00,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:00,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:42:00,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177317701] [2022-12-06 16:42:00,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:00,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:42:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:42:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:42:00,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:42:00,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 3274 transitions, 63469 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 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-06 16:42:00,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:00,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:42:00,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:06,014 INFO L130 PetriNetUnfolder]: 6110/11831 cut-off events. [2022-12-06 16:42:06,014 INFO L131 PetriNetUnfolder]: For 270597/328994 co-relation queries the response was YES. [2022-12-06 16:42:06,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77506 conditions, 11831 events. 6110/11831 cut-off events. For 270597/328994 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 100224 event pairs, 89 based on Foata normal form. 4150/15610 useless extension candidates. Maximal degree in co-relation 77377. Up to 5176 conditions per place. [2022-12-06 16:42:06,052 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 212 selfloop transitions, 38 changer transitions 1034/1419 dead transitions. [2022-12-06 16:42:06,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1419 transitions, 29235 flow [2022-12-06 16:42:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1175 transitions. [2022-12-06 16:42:06,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8526850507982583 [2022-12-06 16:42:06,055 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 100 predicate places. [2022-12-06 16:42:06,055 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 1419 transitions, 29235 flow [2022-12-06 16:42:06,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 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-06 16:42:06,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:06,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:42:06,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:42:06,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:42:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1629693237, now seen corresponding path program 1 times [2022-12-06 16:42:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:06,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122158240] [2022-12-06 16:42:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:06,234 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-06 16:42:06,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:06,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122158240] [2022-12-06 16:42:06,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122158240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:06,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:06,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:42:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971770694] [2022-12-06 16:42:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:06,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:42:06,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:42:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:42:06,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2022-12-06 16:42:06,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 1419 transitions, 29235 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 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-06 16:42:06,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:06,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2022-12-06 16:42:06,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:09,073 INFO L130 PetriNetUnfolder]: 5584/10201 cut-off events. [2022-12-06 16:42:09,073 INFO L131 PetriNetUnfolder]: For 238778/277393 co-relation queries the response was YES. [2022-12-06 16:42:09,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75112 conditions, 10201 events. 5584/10201 cut-off events. For 238778/277393 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 85159 event pairs, 98 based on Foata normal form. 3936/13874 useless extension candidates. Maximal degree in co-relation 74979. Up to 4406 conditions per place. [2022-12-06 16:42:09,102 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 66 selfloop transitions, 16 changer transitions 1030/1197 dead transitions. [2022-12-06 16:42:09,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1197 transitions, 26777 flow [2022-12-06 16:42:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:42:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:42:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1412 transitions. [2022-12-06 16:42:09,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8325471698113207 [2022-12-06 16:42:09,106 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 76 predicate places. [2022-12-06 16:42:09,106 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1197 transitions, 26777 flow [2022-12-06 16:42:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 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-06 16:42:09,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:09,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:42:09,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:42:09,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:42:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1420513824, now seen corresponding path program 1 times [2022-12-06 16:42:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:09,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784564153] [2022-12-06 16:42:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:09,795 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-06 16:42:09,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:09,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784564153] [2022-12-06 16:42:09,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784564153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:09,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:09,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:42:09,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523682380] [2022-12-06 16:42:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:09,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:42:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:42:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:42:09,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2022-12-06 16:42:09,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1197 transitions, 26777 flow. Second operand has 11 states, 11 states have (on average 81.9090909090909) internal successors, (901), 11 states have internal predecessors, (901), 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-06 16:42:09,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:09,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2022-12-06 16:42:09,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:11,754 INFO L130 PetriNetUnfolder]: 7572/14491 cut-off events. [2022-12-06 16:42:11,754 INFO L131 PetriNetUnfolder]: For 396460/446920 co-relation queries the response was YES. [2022-12-06 16:42:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105234 conditions, 14491 events. 7572/14491 cut-off events. For 396460/446920 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 132668 event pairs, 118 based on Foata normal form. 7644/21862 useless extension candidates. Maximal degree in co-relation 105092. Up to 5567 conditions per place. [2022-12-06 16:42:11,806 INFO L137 encePairwiseOnDemand]: 96/106 looper letters, 53 selfloop transitions, 18 changer transitions 1410/1580 dead transitions. [2022-12-06 16:42:11,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 1580 transitions, 39335 flow [2022-12-06 16:42:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:42:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:42:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 757 transitions. [2022-12-06 16:42:11,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7935010482180294 [2022-12-06 16:42:11,809 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 84 predicate places. [2022-12-06 16:42:11,809 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 1580 transitions, 39335 flow [2022-12-06 16:42:11,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.9090909090909) internal successors, (901), 11 states have internal predecessors, (901), 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-06 16:42:11,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:11,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:42:11,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 16:42:11,810 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:42:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 151744416, now seen corresponding path program 2 times [2022-12-06 16:42:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:11,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768272684] [2022-12-06 16:42:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:13,130 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-06 16:42:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:13,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768272684] [2022-12-06 16:42:13,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768272684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:13,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:13,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-06 16:42:13,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429616125] [2022-12-06 16:42:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 16:42:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 16:42:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-06 16:42:13,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 106 [2022-12-06 16:42:13,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1580 transitions, 39335 flow. Second operand has 16 states, 16 states have (on average 70.0625) internal successors, (1121), 16 states have internal predecessors, (1121), 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-06 16:42:13,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:13,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 106 [2022-12-06 16:42:13,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:16,413 INFO L130 PetriNetUnfolder]: 9319/18801 cut-off events. [2022-12-06 16:42:16,413 INFO L131 PetriNetUnfolder]: For 542210/681292 co-relation queries the response was YES. [2022-12-06 16:42:16,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132773 conditions, 18801 events. 9319/18801 cut-off events. For 542210/681292 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 188607 event pairs, 157 based on Foata normal form. 11259/29725 useless extension candidates. Maximal degree in co-relation 132614. Up to 6282 conditions per place. [2022-12-06 16:42:16,470 INFO L137 encePairwiseOnDemand]: 87/106 looper letters, 41 selfloop transitions, 24 changer transitions 2005/2136 dead transitions. [2022-12-06 16:42:16,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 2136 transitions, 58362 flow [2022-12-06 16:42:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 16:42:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 16:42:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1450 transitions. [2022-12-06 16:42:16,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6839622641509434 [2022-12-06 16:42:16,473 INFO L294 CegarLoopForPetriNet]: 111 programPoint places, 103 predicate places. [2022-12-06 16:42:16,473 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 2136 transitions, 58362 flow [2022-12-06 16:42:16,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 70.0625) internal successors, (1121), 16 states have internal predecessors, (1121), 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-06 16:42:16,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:16,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 16:42:16,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 16:42:16,474 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:42:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1565738576, now seen corresponding path program 3 times [2022-12-06 16:42:16,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:16,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190648977] [2022-12-06 16:42:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:42:16,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:42:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:42:16,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:42:16,542 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:42:16,542 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:42:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:42:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:42:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:42:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:42:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:42:16,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 16:42:16,545 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:16,549 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:42:16,549 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:42:16,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:42:16 BasicIcfg [2022-12-06 16:42:16,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:42:16,610 INFO L158 Benchmark]: Toolchain (without parser) took 108487.54ms. Allocated memory was 249.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 224.3MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 16:42:16,610 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 249.6MB. Free memory was 226.0MB in the beginning and 225.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:42:16,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.43ms. Allocated memory is still 249.6MB. Free memory was 224.3MB in the beginning and 198.1MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:42:16,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.37ms. Allocated memory is still 249.6MB. Free memory was 198.1MB in the beginning and 195.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:42:16,611 INFO L158 Benchmark]: Boogie Preprocessor took 39.10ms. Allocated memory is still 249.6MB. Free memory was 195.5MB in the beginning and 193.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:42:16,611 INFO L158 Benchmark]: RCFGBuilder took 523.98ms. Allocated memory is still 249.6MB. Free memory was 193.4MB in the beginning and 158.5MB in the end (delta: 34.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 16:42:16,611 INFO L158 Benchmark]: TraceAbstraction took 107443.11ms. Allocated memory was 249.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 157.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-06 16:42:16,612 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 249.6MB. Free memory was 226.0MB in the beginning and 225.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.43ms. Allocated memory is still 249.6MB. Free memory was 224.3MB in the beginning and 198.1MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.37ms. Allocated memory is still 249.6MB. Free memory was 198.1MB in the beginning and 195.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.10ms. Allocated memory is still 249.6MB. Free memory was 195.5MB in the beginning and 193.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.98ms. Allocated memory is still 249.6MB. Free memory was 193.4MB in the beginning and 158.5MB in the end (delta: 34.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 107443.11ms. Allocated memory was 249.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 157.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 819]: 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: 817]: 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: 821]: 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, 133 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: 107.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 99.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1272 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1272 mSDsluCounter, 1391 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1104 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2168 IncrementalHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 287 mSDtfsCounter, 2168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147495occurred in iteration=9, InterpolantAutomatonStates: 182, 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.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1084 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 6081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-06 16:42:16,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...