/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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:00:27,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:00:27,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:00:27,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:00:27,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:00:27,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:00:27,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:00:27,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:00:27,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:00:27,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:00:27,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:00:27,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:00:27,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:00:27,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:00:27,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:00:27,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:00:27,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:00:27,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:00:27,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:00:27,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:00:27,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:00:27,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:00:27,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:00:27,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:00:27,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:00:27,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:00:27,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:00:27,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:00:27,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:00:27,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:00:27,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:00:27,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:00:27,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:00:27,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:00:27,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:00:27,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:00:27,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:00:27,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:00:27,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:00:27,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:00:27,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:00:27,753 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-11 21:00:27,774 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:00:27,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:00:27,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:00:27,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:00:27,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:00:27,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:00:27,777 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:00:27,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:00:27,778 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:00:27,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:00:27,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:00:27,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:00:27,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:00:27,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:00:27,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:00:27,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:00:27,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:00:27,780 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-11 21:00:28,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:00:28,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:00:28,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:00:28,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:00:28,063 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:00:28,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 21:00:28,992 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:00:29,235 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:00:29,235 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 21:00:29,246 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d8e020e/e09250cbf68544599f3fd1e7c1ad62c9/FLAGd0ef5c29e [2022-12-11 21:00:29,258 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d8e020e/e09250cbf68544599f3fd1e7c1ad62c9 [2022-12-11 21:00:29,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:00:29,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:00:29,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:00:29,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:00:29,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:00:29,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f81f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29, skipping insertion in model container [2022-12-11 21:00:29,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:00:29,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:00:29,418 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-11 21:00:29,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:00:29,566 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:00:29,574 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-11 21:00:29,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 21:00:29,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 21:00:29,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:00:29,643 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:00:29,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29 WrapperNode [2022-12-11 21:00:29,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:00:29,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:00:29,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:00:29,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:00:29,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,704 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-11 21:00:29,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:00:29,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:00:29,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:00:29,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:00:29,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,740 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:00:29,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:00:29,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:00:29,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:00:29,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (1/1) ... [2022-12-11 21:00:29,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:00:29,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:00:29,777 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-11 21:00:29,796 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-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 21:00:29,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 21:00:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 21:00:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 21:00:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 21:00:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 21:00:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 21:00:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 21:00:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:00:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 21:00:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:00:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:00:29,810 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 21:00:29,957 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:00:29,959 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:00:30,233 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:00:30,388 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:00:30,388 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 21:00:30,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:00:30 BoogieIcfgContainer [2022-12-11 21:00:30,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:00:30,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:00:30,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:00:30,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:00:30,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:00:29" (1/3) ... [2022-12-11 21:00:30,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46900ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:00:30, skipping insertion in model container [2022-12-11 21:00:30,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:00:29" (2/3) ... [2022-12-11 21:00:30,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46900ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:00:30, skipping insertion in model container [2022-12-11 21:00:30,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:00:30" (3/3) ... [2022-12-11 21:00:30,397 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-11 21:00:30,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:00:30,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 21:00:30,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:00:30,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 21:00:30,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-11 21:00:30,576 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-11 21:00:30,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:00:30,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-11 21:00:30,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-11 21:00:30,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-11 21:00:30,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:00:30,611 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;@6926766e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:00:30,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 21:00:30,665 INFO L130 PetriNetUnfolder]: 0/87 cut-off events. [2022-12-11 21:00:30,665 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 21:00:30,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:30,666 INFO L214 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-11 21:00:30,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash -25426150, now seen corresponding path program 1 times [2022-12-11 21:00:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:30,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131582979] [2022-12-11 21:00:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:31,165 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-11 21:00:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:31,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131582979] [2022-12-11 21:00:31,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131582979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:31,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:31,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 21:00:31,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820879186] [2022-12-11 21:00:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:31,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 21:00:31,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 21:00:31,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 21:00:31,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 129 [2022-12-11 21:00:31,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-11 21:00:31,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:31,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 129 [2022-12-11 21:00:31,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:31,311 INFO L130 PetriNetUnfolder]: 17/254 cut-off events. [2022-12-11 21:00:31,311 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 21:00:31,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 254 events. 17/254 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 748 event pairs, 7 based on Foata normal form. 9/252 useless extension candidates. Maximal degree in co-relation 256. Up to 27 conditions per place. [2022-12-11 21:00:31,315 INFO L137 encePairwiseOnDemand]: 124/129 looper letters, 11 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2022-12-11 21:00:31,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 124 transitions, 286 flow [2022-12-11 21:00:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 21:00:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 21:00:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-12-11 21:00:31,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2022-12-11 21:00:31,335 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2022-12-11 21:00:31,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 124 transitions, 286 flow [2022-12-11 21:00:31,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 286 flow [2022-12-11 21:00:31,340 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 286 flow [2022-12-11 21:00:31,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-11 21:00:31,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:31,340 INFO L214 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] [2022-12-11 21:00:31,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:00:31,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 748764093, now seen corresponding path program 1 times [2022-12-11 21:00:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:31,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629607864] [2022-12-11 21:00:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:31,945 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-11 21:00:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629607864] [2022-12-11 21:00:31,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629607864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:31,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:31,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346938126] [2022-12-11 21:00:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:31,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-11 21:00:31,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-11 21:00:31,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:31,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-11 21:00:31,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:33,782 INFO L130 PetriNetUnfolder]: 5568/13330 cut-off events. [2022-12-11 21:00:33,782 INFO L131 PetriNetUnfolder]: For 1713/2893 co-relation queries the response was YES. [2022-12-11 21:00:33,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23370 conditions, 13330 events. 5568/13330 cut-off events. For 1713/2893 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 133552 event pairs, 711 based on Foata normal form. 1/13018 useless extension candidates. Maximal degree in co-relation 23302. Up to 2981 conditions per place. [2022-12-11 21:00:33,844 INFO L137 encePairwiseOnDemand]: 112/129 looper letters, 52 selfloop transitions, 17 changer transitions 125/271 dead transitions. [2022-12-11 21:00:33,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 271 transitions, 1075 flow [2022-12-11 21:00:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1364 transitions. [2022-12-11 21:00:33,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8133571854502087 [2022-12-11 21:00:33,849 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 12 predicate places. [2022-12-11 21:00:33,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 271 transitions, 1075 flow [2022-12-11 21:00:33,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 146 transitions, 517 flow [2022-12-11 21:00:33,880 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 146 transitions, 517 flow [2022-12-11 21:00:33,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-11 21:00:33,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:33,880 INFO L214 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-11 21:00:33,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:00:33,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash -211917924, now seen corresponding path program 1 times [2022-12-11 21:00:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:33,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861493524] [2022-12-11 21:00:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:33,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:34,268 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-11 21:00:34,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:34,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861493524] [2022-12-11 21:00:34,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861493524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:34,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:34,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:34,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398500499] [2022-12-11 21:00:34,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:34,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:34,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-11 21:00:34,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 146 transitions, 517 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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-11 21:00:34,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:34,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-11 21:00:34,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:35,341 INFO L130 PetriNetUnfolder]: 3383/7350 cut-off events. [2022-12-11 21:00:35,342 INFO L131 PetriNetUnfolder]: For 1746/11165 co-relation queries the response was YES. [2022-12-11 21:00:35,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18676 conditions, 7350 events. 3383/7350 cut-off events. For 1746/11165 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 63275 event pairs, 238 based on Foata normal form. 201/7395 useless extension candidates. Maximal degree in co-relation 18594. Up to 3210 conditions per place. [2022-12-11 21:00:35,376 INFO L137 encePairwiseOnDemand]: 115/129 looper letters, 75 selfloop transitions, 13 changer transitions 110/275 dead transitions. [2022-12-11 21:00:35,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 275 transitions, 1503 flow [2022-12-11 21:00:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:00:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:00:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1330 transitions. [2022-12-11 21:00:35,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.793082886106142 [2022-12-11 21:00:35,380 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 3 predicate places. [2022-12-11 21:00:35,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 275 transitions, 1503 flow [2022-12-11 21:00:35,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 165 transitions, 779 flow [2022-12-11 21:00:35,402 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 165 transitions, 779 flow [2022-12-11 21:00:35,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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-11 21:00:35,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:35,402 INFO L214 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, 1, 1, 1, 1] [2022-12-11 21:00:35,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:00:35,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash 793106977, now seen corresponding path program 1 times [2022-12-11 21:00:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:35,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196751761] [2022-12-11 21:00:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:35,570 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-11 21:00:35,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:35,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196751761] [2022-12-11 21:00:35,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196751761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:35,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:35,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:00:35,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221809774] [2022-12-11 21:00:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:35,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:00:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:00:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:00:35,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2022-12-11 21:00:35,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 165 transitions, 779 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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-11 21:00:35,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:35,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2022-12-11 21:00:35,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:36,191 INFO L130 PetriNetUnfolder]: 2517/5728 cut-off events. [2022-12-11 21:00:36,192 INFO L131 PetriNetUnfolder]: For 3854/12658 co-relation queries the response was YES. [2022-12-11 21:00:36,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16697 conditions, 5728 events. 2517/5728 cut-off events. For 3854/12658 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 48320 event pairs, 267 based on Foata normal form. 114/5711 useless extension candidates. Maximal degree in co-relation 16611. Up to 2396 conditions per place. [2022-12-11 21:00:36,223 INFO L137 encePairwiseOnDemand]: 122/129 looper letters, 70 selfloop transitions, 11 changer transitions 55/247 dead transitions. [2022-12-11 21:00:36,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 247 transitions, 1631 flow [2022-12-11 21:00:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:00:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:00:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1017 transitions. [2022-12-11 21:00:36,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2022-12-11 21:00:36,227 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2022-12-11 21:00:36,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 247 transitions, 1631 flow [2022-12-11 21:00:36,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 192 transitions, 1153 flow [2022-12-11 21:00:36,248 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 192 transitions, 1153 flow [2022-12-11 21:00:36,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 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-11 21:00:36,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:36,249 INFO L214 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, 1, 1, 1, 1, 1] [2022-12-11 21:00:36,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:00:36,249 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:36,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1353974491, now seen corresponding path program 1 times [2022-12-11 21:00:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923645369] [2022-12-11 21:00:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:36,448 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-11 21:00:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:36,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923645369] [2022-12-11 21:00:36,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923645369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:36,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:36,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:00:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171114007] [2022-12-11 21:00:36,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:36,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:00:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:00:36,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:00:36,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2022-12-11 21:00:36,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 192 transitions, 1153 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 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-11 21:00:36,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:36,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2022-12-11 21:00:36,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:37,168 INFO L130 PetriNetUnfolder]: 2310/5755 cut-off events. [2022-12-11 21:00:37,169 INFO L131 PetriNetUnfolder]: For 8983/23970 co-relation queries the response was YES. [2022-12-11 21:00:37,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18487 conditions, 5755 events. 2310/5755 cut-off events. For 8983/23970 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 51039 event pairs, 266 based on Foata normal form. 131/5732 useless extension candidates. Maximal degree in co-relation 18397. Up to 2381 conditions per place. [2022-12-11 21:00:37,217 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 89 selfloop transitions, 10 changer transitions 51/261 dead transitions. [2022-12-11 21:00:37,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 261 transitions, 2097 flow [2022-12-11 21:00:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:00:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:00:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1015 transitions. [2022-12-11 21:00:37,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8742463393626184 [2022-12-11 21:00:37,221 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 4 predicate places. [2022-12-11 21:00:37,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 261 transitions, 2097 flow [2022-12-11 21:00:37,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 210 transitions, 1522 flow [2022-12-11 21:00:37,244 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 210 transitions, 1522 flow [2022-12-11 21:00:37,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 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-11 21:00:37,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:37,244 INFO L214 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, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:37,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:00:37,245 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 712786936, now seen corresponding path program 1 times [2022-12-11 21:00:37,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:37,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822484184] [2022-12-11 21:00:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:37,997 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-11 21:00:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:37,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822484184] [2022-12-11 21:00:37,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822484184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:37,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:37,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:00:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420258297] [2022-12-11 21:00:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:37,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:00:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:00:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:00:38,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 129 [2022-12-11 21:00:38,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 210 transitions, 1522 flow. Second operand has 10 states, 10 states have (on average 106.6) internal successors, (1066), 10 states have internal predecessors, (1066), 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-11 21:00:38,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:38,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 129 [2022-12-11 21:00:38,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:38,840 INFO L130 PetriNetUnfolder]: 2363/6010 cut-off events. [2022-12-11 21:00:38,840 INFO L131 PetriNetUnfolder]: For 15823/30119 co-relation queries the response was YES. [2022-12-11 21:00:38,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21314 conditions, 6010 events. 2363/6010 cut-off events. For 15823/30119 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 54945 event pairs, 182 based on Foata normal form. 447/6358 useless extension candidates. Maximal degree in co-relation 21217. Up to 2414 conditions per place. [2022-12-11 21:00:38,871 INFO L137 encePairwiseOnDemand]: 117/129 looper letters, 103 selfloop transitions, 44 changer transitions 116/381 dead transitions. [2022-12-11 21:00:38,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 381 transitions, 3938 flow [2022-12-11 21:00:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 21:00:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 21:00:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1958 transitions. [2022-12-11 21:00:38,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.843238587424634 [2022-12-11 21:00:38,875 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 15 predicate places. [2022-12-11 21:00:38,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 381 transitions, 3938 flow [2022-12-11 21:00:38,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 265 transitions, 2458 flow [2022-12-11 21:00:38,893 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 265 transitions, 2458 flow [2022-12-11 21:00:38,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.6) internal successors, (1066), 10 states have internal predecessors, (1066), 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-11 21:00:38,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:38,894 INFO L214 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:38,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:00:38,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 313438878, now seen corresponding path program 1 times [2022-12-11 21:00:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:38,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184056849] [2022-12-11 21:00:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:39,291 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-11 21:00:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184056849] [2022-12-11 21:00:39,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184056849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:39,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:39,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 21:00:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888181857] [2022-12-11 21:00:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:00:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:39,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:00:39,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-11 21:00:39,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 21:00:39,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 265 transitions, 2458 flow. Second operand has 10 states, 10 states have (on average 105.8) internal successors, (1058), 10 states have internal predecessors, (1058), 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-11 21:00:39,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:39,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 21:00:39,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:40,020 INFO L130 PetriNetUnfolder]: 2135/5494 cut-off events. [2022-12-11 21:00:40,020 INFO L131 PetriNetUnfolder]: For 21602/35042 co-relation queries the response was YES. [2022-12-11 21:00:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21533 conditions, 5494 events. 2135/5494 cut-off events. For 21602/35042 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 49696 event pairs, 145 based on Foata normal form. 494/5904 useless extension candidates. Maximal degree in co-relation 21428. Up to 2239 conditions per place. [2022-12-11 21:00:40,062 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 132 selfloop transitions, 37 changer transitions 79/365 dead transitions. [2022-12-11 21:00:40,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 365 transitions, 4306 flow [2022-12-11 21:00:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 21:00:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 21:00:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1299 transitions. [2022-12-11 21:00:40,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8391472868217055 [2022-12-11 21:00:40,065 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 17 predicate places. [2022-12-11 21:00:40,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 365 transitions, 4306 flow [2022-12-11 21:00:40,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 286 transitions, 3090 flow [2022-12-11 21:00:40,092 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 286 transitions, 3090 flow [2022-12-11 21:00:40,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.8) internal successors, (1058), 10 states have internal predecessors, (1058), 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-11 21:00:40,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:40,093 INFO L214 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:40,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 21:00:40,093 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1257730912, now seen corresponding path program 2 times [2022-12-11 21:00:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:40,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156149108] [2022-12-11 21:00:40,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:40,703 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-11 21:00:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:40,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156149108] [2022-12-11 21:00:40,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156149108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:40,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:40,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:00:40,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025570853] [2022-12-11 21:00:40,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:40,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:00:40,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:40,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:00:40,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:00:40,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2022-12-11 21:00:40,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 286 transitions, 3090 flow. Second operand has 12 states, 12 states have (on average 104.58333333333333) internal successors, (1255), 12 states have internal predecessors, (1255), 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-11 21:00:40,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:40,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2022-12-11 21:00:40,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:41,459 INFO L130 PetriNetUnfolder]: 1812/4940 cut-off events. [2022-12-11 21:00:41,460 INFO L131 PetriNetUnfolder]: For 26533/45232 co-relation queries the response was YES. [2022-12-11 21:00:41,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20206 conditions, 4940 events. 1812/4940 cut-off events. For 26533/45232 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 45144 event pairs, 107 based on Foata normal form. 618/5480 useless extension candidates. Maximal degree in co-relation 20092. Up to 1901 conditions per place. [2022-12-11 21:00:41,532 INFO L137 encePairwiseOnDemand]: 117/129 looper letters, 127 selfloop transitions, 48 changer transitions 78/369 dead transitions. [2022-12-11 21:00:41,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 369 transitions, 4876 flow [2022-12-11 21:00:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 21:00:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 21:00:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1493 transitions. [2022-12-11 21:00:41,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8266888150609081 [2022-12-11 21:00:41,536 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 24 predicate places. [2022-12-11 21:00:41,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 369 transitions, 4876 flow [2022-12-11 21:00:41,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 291 transitions, 3520 flow [2022-12-11 21:00:41,553 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 291 transitions, 3520 flow [2022-12-11 21:00:41,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 104.58333333333333) internal successors, (1255), 12 states have internal predecessors, (1255), 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-11 21:00:41,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:41,554 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:41,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 21:00:41,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash -223281749, now seen corresponding path program 1 times [2022-12-11 21:00:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:41,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642131645] [2022-12-11 21:00:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:42,487 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-11 21:00:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:42,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642131645] [2022-12-11 21:00:42,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642131645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:42,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:42,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 21:00:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139503617] [2022-12-11 21:00:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:42,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 21:00:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:42,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 21:00:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-11 21:00:42,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-11 21:00:42,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 291 transitions, 3520 flow. Second operand has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-11 21:00:42,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:42,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-11 21:00:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:43,828 INFO L130 PetriNetUnfolder]: 1974/5064 cut-off events. [2022-12-11 21:00:43,828 INFO L131 PetriNetUnfolder]: For 34886/93826 co-relation queries the response was YES. [2022-12-11 21:00:43,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25339 conditions, 5064 events. 1974/5064 cut-off events. For 34886/93826 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 44989 event pairs, 37 based on Foata normal form. 923/5909 useless extension candidates. Maximal degree in co-relation 25211. Up to 2166 conditions per place. [2022-12-11 21:00:43,858 INFO L137 encePairwiseOnDemand]: 108/129 looper letters, 203 selfloop transitions, 120 changer transitions 167/567 dead transitions. [2022-12-11 21:00:43,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 567 transitions, 7798 flow [2022-12-11 21:00:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-11 21:00:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-11 21:00:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2384 transitions. [2022-12-11 21:00:43,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7700258397932817 [2022-12-11 21:00:43,863 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 41 predicate places. [2022-12-11 21:00:43,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 567 transitions, 7798 flow [2022-12-11 21:00:43,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 400 transitions, 5328 flow [2022-12-11 21:00:43,884 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 400 transitions, 5328 flow [2022-12-11 21:00:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 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-11 21:00:43,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:43,885 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:43,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 21:00:43,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1643485885, now seen corresponding path program 2 times [2022-12-11 21:00:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:43,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724744613] [2022-12-11 21:00:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:44,723 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-11 21:00:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:44,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724744613] [2022-12-11 21:00:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724744613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:44,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:00:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734455683] [2022-12-11 21:00:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:00:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:44,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:00:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:00:44,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 129 [2022-12-11 21:00:44,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 400 transitions, 5328 flow. Second operand has 12 states, 12 states have (on average 92.5) internal successors, (1110), 12 states have internal predecessors, (1110), 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-11 21:00:44,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:44,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 129 [2022-12-11 21:00:44,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:46,194 INFO L130 PetriNetUnfolder]: 1901/4956 cut-off events. [2022-12-11 21:00:46,195 INFO L131 PetriNetUnfolder]: For 41659/125634 co-relation queries the response was YES. [2022-12-11 21:00:46,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27388 conditions, 4956 events. 1901/4956 cut-off events. For 41659/125634 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 44721 event pairs, 31 based on Foata normal form. 1524/6382 useless extension candidates. Maximal degree in co-relation 27244. Up to 2126 conditions per place. [2022-12-11 21:00:46,236 INFO L137 encePairwiseOnDemand]: 108/129 looper letters, 240 selfloop transitions, 179 changer transitions 85/579 dead transitions. [2022-12-11 21:00:46,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 579 transitions, 8618 flow [2022-12-11 21:00:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-11 21:00:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-11 21:00:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2037 transitions. [2022-12-11 21:00:46,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2022-12-11 21:00:46,243 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 49 predicate places. [2022-12-11 21:00:46,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 579 transitions, 8618 flow [2022-12-11 21:00:46,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 494 transitions, 7248 flow [2022-12-11 21:00:46,271 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 494 transitions, 7248 flow [2022-12-11 21:00:46,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 92.5) internal successors, (1110), 12 states have internal predecessors, (1110), 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-11 21:00:46,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:46,272 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:46,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 21:00:46,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 585647771, now seen corresponding path program 3 times [2022-12-11 21:00:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:46,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738547012] [2022-12-11 21:00:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:47,218 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-11 21:00:47,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:47,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738547012] [2022-12-11 21:00:47,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738547012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:47,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:47,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 21:00:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433044621] [2022-12-11 21:00:47,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:47,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 21:00:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 21:00:47,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-11 21:00:47,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 129 [2022-12-11 21:00:47,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 494 transitions, 7248 flow. Second operand has 14 states, 14 states have (on average 92.14285714285714) internal successors, (1290), 14 states have internal predecessors, (1290), 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-11 21:00:47,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:47,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 129 [2022-12-11 21:00:47,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:48,533 INFO L130 PetriNetUnfolder]: 2012/5082 cut-off events. [2022-12-11 21:00:48,533 INFO L131 PetriNetUnfolder]: For 41731/203311 co-relation queries the response was YES. [2022-12-11 21:00:48,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32198 conditions, 5082 events. 2012/5082 cut-off events. For 41731/203311 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 45812 event pairs, 27 based on Foata normal form. 906/5924 useless extension candidates. Maximal degree in co-relation 32038. Up to 2270 conditions per place. [2022-12-11 21:00:48,577 INFO L137 encePairwiseOnDemand]: 108/129 looper letters, 322 selfloop transitions, 183 changer transitions 78/658 dead transitions. [2022-12-11 21:00:48,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 658 transitions, 10826 flow [2022-12-11 21:00:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 21:00:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 21:00:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1921 transitions. [2022-12-11 21:00:48,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7445736434108527 [2022-12-11 21:00:48,580 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 59 predicate places. [2022-12-11 21:00:48,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 658 transitions, 10826 flow [2022-12-11 21:00:48,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 580 transitions, 9414 flow [2022-12-11 21:00:48,610 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 580 transitions, 9414 flow [2022-12-11 21:00:48,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 92.14285714285714) internal successors, (1290), 14 states have internal predecessors, (1290), 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-11 21:00:48,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:48,611 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:48,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 21:00:48,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:48,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2030031073, now seen corresponding path program 4 times [2022-12-11 21:00:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:48,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382078514] [2022-12-11 21:00:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:49,333 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-11 21:00:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:49,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382078514] [2022-12-11 21:00:49,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382078514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:49,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 21:00:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218797840] [2022-12-11 21:00:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 21:00:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 21:00:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-11 21:00:49,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 129 [2022-12-11 21:00:49,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 580 transitions, 9414 flow. Second operand has 12 states, 12 states have (on average 93.41666666666667) internal successors, (1121), 12 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-11 21:00:49,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:49,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 129 [2022-12-11 21:00:49,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:50,893 INFO L130 PetriNetUnfolder]: 1965/5526 cut-off events. [2022-12-11 21:00:50,893 INFO L131 PetriNetUnfolder]: For 61789/267341 co-relation queries the response was YES. [2022-12-11 21:00:50,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36414 conditions, 5526 events. 1965/5526 cut-off events. For 61789/267341 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 53619 event pairs, 2 based on Foata normal form. 1259/6696 useless extension candidates. Maximal degree in co-relation 36239. Up to 2301 conditions per place. [2022-12-11 21:00:50,951 INFO L137 encePairwiseOnDemand]: 108/129 looper letters, 378 selfloop transitions, 197 changer transitions 100/751 dead transitions. [2022-12-11 21:00:50,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 751 transitions, 13775 flow [2022-12-11 21:00:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:00:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:00:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1853 transitions. [2022-12-11 21:00:50,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7560179518563851 [2022-12-11 21:00:50,955 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 68 predicate places. [2022-12-11 21:00:50,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 751 transitions, 13775 flow [2022-12-11 21:00:50,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 651 transitions, 11697 flow [2022-12-11 21:00:50,996 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 651 transitions, 11697 flow [2022-12-11 21:00:50,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.41666666666667) internal successors, (1121), 12 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-11 21:00:50,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:50,997 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:50,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 21:00:50,997 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1840188501, now seen corresponding path program 1 times [2022-12-11 21:00:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092310779] [2022-12-11 21:00:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:51,155 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-11 21:00:51,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:51,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092310779] [2022-12-11 21:00:51,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092310779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:51,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:51,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 21:00:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922939184] [2022-12-11 21:00:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:51,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 21:00:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:51,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 21:00:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 21:00:51,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 21:00:51,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 651 transitions, 11697 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-11 21:00:51,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:51,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 21:00:51,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:00:56,800 INFO L130 PetriNetUnfolder]: 21210/38944 cut-off events. [2022-12-11 21:00:56,800 INFO L131 PetriNetUnfolder]: For 678495/790177 co-relation queries the response was YES. [2022-12-11 21:00:57,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200976 conditions, 38944 events. 21210/38944 cut-off events. For 678495/790177 co-relation queries the response was YES. Maximal size of possible extension queue 2688. Compared 386271 event pairs, 802 based on Foata normal form. 3613/40539 useless extension candidates. Maximal degree in co-relation 200797. Up to 13501 conditions per place. [2022-12-11 21:00:57,277 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 534 selfloop transitions, 20 changer transitions 117/1059 dead transitions. [2022-12-11 21:00:57,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1059 transitions, 23212 flow [2022-12-11 21:00:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:00:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:00:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1124 transitions. [2022-12-11 21:00:57,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8713178294573644 [2022-12-11 21:00:57,288 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 68 predicate places. [2022-12-11 21:00:57,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 1059 transitions, 23212 flow [2022-12-11 21:00:57,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 942 transitions, 19936 flow [2022-12-11 21:00:57,449 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 942 transitions, 19936 flow [2022-12-11 21:00:57,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-11 21:00:57,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:00:57,450 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:00:57,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 21:00:57,450 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:00:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:00:57,451 INFO L85 PathProgramCache]: Analyzing trace with hash -161730887, now seen corresponding path program 1 times [2022-12-11 21:00:57,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:00:57,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841138819] [2022-12-11 21:00:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:00:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:00:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:00:57,634 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-11 21:00:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:00:57,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841138819] [2022-12-11 21:00:57,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841138819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:00:57,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:00:57,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:00:57,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676670722] [2022-12-11 21:00:57,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:00:57,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:00:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:00:57,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:00:57,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:00:57,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 21:00:57,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 942 transitions, 19936 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 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-11 21:00:57,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:00:57,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 21:00:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:03,952 INFO L130 PetriNetUnfolder]: 16001/34674 cut-off events. [2022-12-11 21:01:03,952 INFO L131 PetriNetUnfolder]: For 503080/588546 co-relation queries the response was YES. [2022-12-11 21:01:04,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171017 conditions, 34674 events. 16001/34674 cut-off events. For 503080/588546 co-relation queries the response was YES. Maximal size of possible extension queue 2530. Compared 397593 event pairs, 338 based on Foata normal form. 5288/38925 useless extension candidates. Maximal degree in co-relation 170834. Up to 11446 conditions per place. [2022-12-11 21:01:04,213 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 849 selfloop transitions, 54 changer transitions 116/1368 dead transitions. [2022-12-11 21:01:04,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1368 transitions, 33080 flow [2022-12-11 21:01:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:01:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:01:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1464 transitions. [2022-12-11 21:01:04,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8729874776386404 [2022-12-11 21:01:04,217 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 80 predicate places. [2022-12-11 21:01:04,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 1368 transitions, 33080 flow [2022-12-11 21:01:04,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 1252 transitions, 29648 flow [2022-12-11 21:01:04,329 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 1252 transitions, 29648 flow [2022-12-11 21:01:04,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 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-11 21:01:04,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:04,330 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 21:01:04,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -808214894, now seen corresponding path program 1 times [2022-12-11 21:01:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:04,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291534056] [2022-12-11 21:01:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:04,583 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-11 21:01:04,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:04,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291534056] [2022-12-11 21:01:04,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291534056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:04,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:04,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:01:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422080078] [2022-12-11 21:01:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:04,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:01:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:01:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:01:04,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-11 21:01:04,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1252 transitions, 29648 flow. Second operand has 7 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 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-11 21:01:04,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:04,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-11 21:01:04,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:11,664 INFO L130 PetriNetUnfolder]: 21174/45749 cut-off events. [2022-12-11 21:01:11,664 INFO L131 PetriNetUnfolder]: For 808089/997523 co-relation queries the response was YES. [2022-12-11 21:01:11,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237992 conditions, 45749 events. 21174/45749 cut-off events. For 808089/997523 co-relation queries the response was YES. Maximal size of possible extension queue 3306. Compared 543644 event pairs, 515 based on Foata normal form. 4185/48282 useless extension candidates. Maximal degree in co-relation 237795. Up to 15444 conditions per place. [2022-12-11 21:01:12,002 INFO L137 encePairwiseOnDemand]: 111/129 looper letters, 957 selfloop transitions, 143 changer transitions 507/1776 dead transitions. [2022-12-11 21:01:12,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1776 transitions, 47083 flow [2022-12-11 21:01:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 21:01:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 21:01:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1300 transitions. [2022-12-11 21:01:12,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7751937984496124 [2022-12-11 21:01:12,005 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 92 predicate places. [2022-12-11 21:01:12,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 1776 transitions, 47083 flow [2022-12-11 21:01:12,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 1269 transitions, 32233 flow [2022-12-11 21:01:12,110 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 1269 transitions, 32233 flow [2022-12-11 21:01:12,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 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-11 21:01:12,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:12,111 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:12,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 21:01:12,111 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1154035598, now seen corresponding path program 1 times [2022-12-11 21:01:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:12,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404713139] [2022-12-11 21:01:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:12,245 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-11 21:01:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:12,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404713139] [2022-12-11 21:01:12,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404713139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:12,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:12,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:01:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557723824] [2022-12-11 21:01:12,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:12,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:01:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:01:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:01:12,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 21:01:12,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 1269 transitions, 32233 flow. Second operand has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 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-11 21:01:12,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:12,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 21:01:12,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:20,456 INFO L130 PetriNetUnfolder]: 15937/37074 cut-off events. [2022-12-11 21:01:20,456 INFO L131 PetriNetUnfolder]: For 504252/606404 co-relation queries the response was YES. [2022-12-11 21:01:20,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192449 conditions, 37074 events. 15937/37074 cut-off events. For 504252/606404 co-relation queries the response was YES. Maximal size of possible extension queue 2890. Compared 458542 event pairs, 143 based on Foata normal form. 5467/41640 useless extension candidates. Maximal degree in co-relation 192248. Up to 11332 conditions per place. [2022-12-11 21:01:20,866 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 691 selfloop transitions, 104 changer transitions 396/1477 dead transitions. [2022-12-11 21:01:20,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1477 transitions, 39850 flow [2022-12-11 21:01:20,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 21:01:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 21:01:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1803 transitions. [2022-12-11 21:01:20,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.873546511627907 [2022-12-11 21:01:20,869 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 98 predicate places. [2022-12-11 21:01:20,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 1477 transitions, 39850 flow [2022-12-11 21:01:20,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 1081 transitions, 27740 flow [2022-12-11 21:01:20,956 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 1081 transitions, 27740 flow [2022-12-11 21:01:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 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-11 21:01:20,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:20,957 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:20,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 21:01:20,957 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash 449886593, now seen corresponding path program 1 times [2022-12-11 21:01:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:20,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997476790] [2022-12-11 21:01:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:21,147 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-11 21:01:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997476790] [2022-12-11 21:01:21,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997476790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:21,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:21,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 21:01:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104861356] [2022-12-11 21:01:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:21,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 21:01:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 21:01:21,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 21:01:21,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 21:01:21,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 1081 transitions, 27740 flow. Second operand has 9 states, 9 states have (on average 106.11111111111111) internal successors, (955), 9 states have internal predecessors, (955), 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-11 21:01:21,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:21,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 21:01:21,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:27,855 INFO L130 PetriNetUnfolder]: 13496/32837 cut-off events. [2022-12-11 21:01:27,855 INFO L131 PetriNetUnfolder]: For 331238/406157 co-relation queries the response was YES. [2022-12-11 21:01:28,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181492 conditions, 32837 events. 13496/32837 cut-off events. For 331238/406157 co-relation queries the response was YES. Maximal size of possible extension queue 2760. Compared 416679 event pairs, 117 based on Foata normal form. 4678/36722 useless extension candidates. Maximal degree in co-relation 181287. Up to 9312 conditions per place. [2022-12-11 21:01:28,103 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 275 selfloop transitions, 93 changer transitions 546/1088 dead transitions. [2022-12-11 21:01:28,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 1088 transitions, 29232 flow [2022-12-11 21:01:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:01:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:01:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2106 transitions. [2022-12-11 21:01:28,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8592411260709915 [2022-12-11 21:01:28,108 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 116 predicate places. [2022-12-11 21:01:28,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 1088 transitions, 29232 flow [2022-12-11 21:01:28,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 542 transitions, 12337 flow [2022-12-11 21:01:28,157 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 542 transitions, 12337 flow [2022-12-11 21:01:28,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.11111111111111) internal successors, (955), 9 states have internal predecessors, (955), 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-11 21:01:28,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:28,157 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:28,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 21:01:28,158 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1249153213, now seen corresponding path program 1 times [2022-12-11 21:01:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:28,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178896876] [2022-12-11 21:01:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:01:28,436 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-11 21:01:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:01:28,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178896876] [2022-12-11 21:01:28,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178896876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:01:28,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:01:28,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 21:01:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042576901] [2022-12-11 21:01:28,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:01:28,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 21:01:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:01:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 21:01:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 21:01:28,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 129 [2022-12-11 21:01:28,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 542 transitions, 12337 flow. Second operand has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 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-11 21:01:28,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:01:28,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 129 [2022-12-11 21:01:28,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:01:29,919 INFO L130 PetriNetUnfolder]: 4203/11096 cut-off events. [2022-12-11 21:01:29,919 INFO L131 PetriNetUnfolder]: For 120155/147316 co-relation queries the response was YES. [2022-12-11 21:01:29,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66094 conditions, 11096 events. 4203/11096 cut-off events. For 120155/147316 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 120370 event pairs, 53 based on Foata normal form. 432/11428 useless extension candidates. Maximal degree in co-relation 65874. Up to 2829 conditions per place. [2022-12-11 21:01:29,970 INFO L137 encePairwiseOnDemand]: 113/129 looper letters, 37 selfloop transitions, 9 changer transitions 574/706 dead transitions. [2022-12-11 21:01:29,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 706 transitions, 18218 flow [2022-12-11 21:01:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 21:01:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 21:01:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions. [2022-12-11 21:01:29,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7596899224806202 [2022-12-11 21:01:29,972 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 121 predicate places. [2022-12-11 21:01:29,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 706 transitions, 18218 flow [2022-12-11 21:01:29,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 132 transitions, 1698 flow [2022-12-11 21:01:29,984 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 132 transitions, 1698 flow [2022-12-11 21:01:29,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 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-11 21:01:29,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:01:29,984 INFO L214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:29,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 21:01:29,984 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 21:01:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:01:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1239810351, now seen corresponding path program 2 times [2022-12-11 21:01:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:01:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015181336] [2022-12-11 21:01:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:01:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:01:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:01:30,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 21:01:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 21:01:30,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 21:01:30,074 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 21:01:30,076 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 21:01:30,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 21:01:30,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 21:01:30,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 21:01:30,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 21:01:30,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 21:01:30,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 21:01:30,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 21:01:30,082 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 21:01:30,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 21:01:30,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 21:01:30,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 09:01:30 BasicIcfg [2022-12-11 21:01:30,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 21:01:30,212 INFO L158 Benchmark]: Toolchain (without parser) took 60950.96ms. Allocated memory was 178.3MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 153.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-11 21:01:30,212 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 76.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 21:01:30,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.41ms. Allocated memory is still 178.3MB. Free memory was 153.1MB in the beginning and 125.3MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 21:01:30,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.78ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:01:30,213 INFO L158 Benchmark]: Boogie Preprocessor took 48.75ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 21:01:30,213 INFO L158 Benchmark]: RCFGBuilder took 636.42ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 87.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-11 21:01:30,213 INFO L158 Benchmark]: TraceAbstraction took 59819.49ms. Allocated memory was 178.3MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 86.0MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-11 21:01:30,214 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 178.3MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 76.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 381.41ms. Allocated memory is still 178.3MB. Free memory was 153.1MB in the beginning and 125.3MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.78ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.75ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 636.42ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 87.6MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 59819.49ms. Allocated memory was 178.3MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 86.0MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-3, t1253={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-2, t1253={5:0}, t1254={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, t1255={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 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) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 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 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 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=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 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) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=53, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 845]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.8s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 59.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 50.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1549 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1549 mSDsluCounter, 2628 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2167 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2908 IncrementalHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 461 mSDtfsCounter, 2908 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32233occurred in iteration=15, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 80800 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1691 NumberOfCodeBlocks, 1691 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1573 ConstructedInterpolants, 0 QuantifiedInterpolants, 9368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-11 21:01:30,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...