/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 18:37:14,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 18:37:14,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 18:37:14,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 18:37:14,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 18:37:14,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 18:37:14,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 18:37:14,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 18:37:14,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 18:37:14,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 18:37:14,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 18:37:14,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 18:37:14,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 18:37:14,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 18:37:14,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 18:37:14,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 18:37:14,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 18:37:14,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 18:37:14,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 18:37:14,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 18:37:14,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 18:37:14,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 18:37:14,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 18:37:14,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 18:37:14,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 18:37:14,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 18:37:14,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 18:37:14,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 18:37:14,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 18:37:14,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 18:37:14,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 18:37:14,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 18:37:14,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 18:37:14,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 18:37:14,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 18:37:14,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 18:37:14,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 18:37:14,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 18:37:14,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 18:37:14,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 18:37:14,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 18:37:14,141 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-05 18:37:14,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 18:37:14,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 18:37:14,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 18:37:14,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 18:37:14,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 18:37:14,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 18:37:14,180 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 18:37:14,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 18:37:14,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 18:37:14,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 18:37:14,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 18:37:14,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 18:37:14,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 18:37:14,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 18:37:14,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 18:37:14,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 18:37:14,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 18:37:14,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 18:37:14,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 18:37:14,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 18:37:14,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 18:37:14,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 18:37:14,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 18:37:14,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:37:14,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 18:37:14,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 18:37:14,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 18:37:14,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 18:37:14,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 18:37:14,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 18:37:14,548 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 18:37:14,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-05 18:37:15,652 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 18:37:15,952 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 18:37:15,953 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-05 18:37:15,989 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da39f9eab/707e3c5f87cc4130bcfc6fb9f38f9d4a/FLAG1c27f56bd [2022-12-05 18:37:16,004 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da39f9eab/707e3c5f87cc4130bcfc6fb9f38f9d4a [2022-12-05 18:37:16,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 18:37:16,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 18:37:16,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 18:37:16,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 18:37:16,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 18:37:16,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37741c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16, skipping insertion in model container [2022-12-05 18:37:16,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 18:37:16,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 18:37:16,212 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/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-05 18:37:16,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:37:16,413 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 18:37:16,429 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/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-12-05 18:37:16,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 18:37:16,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 18:37:16,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 18:37:16,534 INFO L208 MainTranslator]: Completed translation [2022-12-05 18:37:16,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16 WrapperNode [2022-12-05 18:37:16,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 18:37:16,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 18:37:16,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 18:37:16,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 18:37:16,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,622 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-05 18:37:16,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 18:37:16,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 18:37:16,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 18:37:16,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 18:37:16,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 18:37:16,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 18:37:16,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 18:37:16,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 18:37:16,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (1/1) ... [2022-12-05 18:37:16,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 18:37:16,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 18:37:16,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 18:37:16,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 18:37:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 18:37:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 18:37:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 18:37:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 18:37:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 18:37:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 18:37:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 18:37:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 18:37:16,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 18:37:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 18:37:16,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 18:37:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 18:37:16,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 18:37:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 18:37:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 18:37:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 18:37:16,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 18:37:16,750 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 18:37:16,930 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 18:37:16,932 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 18:37:17,219 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 18:37:17,360 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 18:37:17,361 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 18:37:17,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:37:17 BoogieIcfgContainer [2022-12-05 18:37:17,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 18:37:17,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 18:37:17,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 18:37:17,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 18:37:17,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 06:37:16" (1/3) ... [2022-12-05 18:37:17,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd4fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:37:17, skipping insertion in model container [2022-12-05 18:37:17,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 06:37:16" (2/3) ... [2022-12-05 18:37:17,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd4fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 06:37:17, skipping insertion in model container [2022-12-05 18:37:17,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 06:37:17" (3/3) ... [2022-12-05 18:37:17,404 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-12-05 18:37:17,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 18:37:17,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 18:37:17,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 18:37:17,508 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 18:37:17,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2022-12-05 18:37:17,622 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-05 18:37:17,622 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:37:17,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-05 18:37:17,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2022-12-05 18:37:17,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2022-12-05 18:37:17,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 18:37:17,660 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;@5c2a98d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 18:37:17,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 18:37:17,697 INFO L130 PetriNetUnfolder]: 0/86 cut-off events. [2022-12-05 18:37:17,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 18:37:17,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:17,703 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:17,707 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-05 18:37:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:17,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1474980255, now seen corresponding path program 1 times [2022-12-05 18:37:17,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:17,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022204652] [2022-12-05 18:37:17,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:17,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:18,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022204652] [2022-12-05 18:37:18,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022204652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:18,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:18,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 18:37:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619464440] [2022-12-05 18:37:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:18,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 18:37:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 18:37:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 18:37:18,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 126 [2022-12-05 18:37:18,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:18,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:18,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 126 [2022-12-05 18:37:18,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:18,567 INFO L130 PetriNetUnfolder]: 10/188 cut-off events. [2022-12-05 18:37:18,567 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 18:37:18,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 188 events. 10/188 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 343 event pairs, 4 based on Foata normal form. 5/184 useless extension candidates. Maximal degree in co-relation 177. Up to 17 conditions per place. [2022-12-05 18:37:18,570 INFO L137 encePairwiseOnDemand]: 121/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2022-12-05 18:37:18,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 120 transitions, 274 flow [2022-12-05 18:37:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 18:37:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 18:37:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2022-12-05 18:37:18,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9391534391534392 [2022-12-05 18:37:18,588 INFO L175 Difference]: Start difference. First operand has 133 places, 122 transitions, 256 flow. Second operand 3 states and 355 transitions. [2022-12-05 18:37:18,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 120 transitions, 274 flow [2022-12-05 18:37:18,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 120 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 18:37:18,598 INFO L231 Difference]: Finished difference. Result has 129 places, 118 transitions, 248 flow [2022-12-05 18:37:18,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=129, PETRI_TRANSITIONS=118} [2022-12-05 18:37:18,605 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, -4 predicate places. [2022-12-05 18:37:18,605 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 118 transitions, 248 flow [2022-12-05 18:37:18,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:18,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:18,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:18,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 18:37:18,607 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-05 18:37:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1773641755, now seen corresponding path program 1 times [2022-12-05 18:37:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:18,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11310596] [2022-12-05 18:37:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:19,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:19,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11310596] [2022-12-05 18:37:19,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11310596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:19,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:19,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:37:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041641269] [2022-12-05 18:37:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:19,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:37:19,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:19,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:37:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:37:19,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 126 [2022-12-05 18:37:19,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 118 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:19,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:19,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 126 [2022-12-05 18:37:19,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:19,579 INFO L130 PetriNetUnfolder]: 538/1629 cut-off events. [2022-12-05 18:37:19,579 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-05 18:37:19,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2585 conditions, 1629 events. 538/1629 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11878 event pairs, 216 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 2532. Up to 442 conditions per place. [2022-12-05 18:37:19,597 INFO L137 encePairwiseOnDemand]: 119/126 looper letters, 23 selfloop transitions, 3 changer transitions 51/166 dead transitions. [2022-12-05 18:37:19,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 166 transitions, 496 flow [2022-12-05 18:37:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:37:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:37:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1004 transitions. [2022-12-05 18:37:19,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2022-12-05 18:37:19,603 INFO L175 Difference]: Start difference. First operand has 129 places, 118 transitions, 248 flow. Second operand 9 states and 1004 transitions. [2022-12-05 18:37:19,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 166 transitions, 496 flow [2022-12-05 18:37:19,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 166 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 18:37:19,611 INFO L231 Difference]: Finished difference. Result has 142 places, 108 transitions, 263 flow [2022-12-05 18:37:19,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=263, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2022-12-05 18:37:19,612 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 9 predicate places. [2022-12-05 18:37:19,612 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 108 transitions, 263 flow [2022-12-05 18:37:19,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:19,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:19,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:19,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 18:37:19,613 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-05 18:37:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 880018362, now seen corresponding path program 1 times [2022-12-05 18:37:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:19,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42639549] [2022-12-05 18:37:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:19,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42639549] [2022-12-05 18:37:19,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42639549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:19,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:19,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:37:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617322134] [2022-12-05 18:37:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:19,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:37:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:37:19,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:37:19,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-05 18:37:19,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 108 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:19,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:19,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-05 18:37:19,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:20,618 INFO L130 PetriNetUnfolder]: 1756/3388 cut-off events. [2022-12-05 18:37:20,618 INFO L131 PetriNetUnfolder]: For 1117/1117 co-relation queries the response was YES. [2022-12-05 18:37:20,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6956 conditions, 3388 events. 1756/3388 cut-off events. For 1117/1117 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 26139 event pairs, 139 based on Foata normal form. 0/3184 useless extension candidates. Maximal degree in co-relation 6896. Up to 1033 conditions per place. [2022-12-05 18:37:20,655 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 58 selfloop transitions, 18 changer transitions 5/169 dead transitions. [2022-12-05 18:37:20,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 169 transitions, 553 flow [2022-12-05 18:37:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:37:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:37:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1103 transitions. [2022-12-05 18:37:20,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8753968253968254 [2022-12-05 18:37:20,659 INFO L175 Difference]: Start difference. First operand has 142 places, 108 transitions, 263 flow. Second operand 10 states and 1103 transitions. [2022-12-05 18:37:20,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 169 transitions, 553 flow [2022-12-05 18:37:20,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 169 transitions, 544 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-05 18:37:20,675 INFO L231 Difference]: Finished difference. Result has 135 places, 124 transitions, 386 flow [2022-12-05 18:37:20,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=386, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2022-12-05 18:37:20,677 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2022-12-05 18:37:20,677 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 386 flow [2022-12-05 18:37:20,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:20,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:20,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 18:37:20,679 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-05 18:37:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1103228445, now seen corresponding path program 1 times [2022-12-05 18:37:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:20,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996905383] [2022-12-05 18:37:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:20,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996905383] [2022-12-05 18:37:20,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996905383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:20,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:20,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 18:37:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218377047] [2022-12-05 18:37:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:20,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 18:37:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 18:37:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 18:37:20,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2022-12-05 18:37:20,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:20,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:20,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2022-12-05 18:37:20,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:21,996 INFO L130 PetriNetUnfolder]: 2209/6025 cut-off events. [2022-12-05 18:37:21,996 INFO L131 PetriNetUnfolder]: For 5332/6294 co-relation queries the response was YES. [2022-12-05 18:37:22,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15030 conditions, 6025 events. 2209/6025 cut-off events. For 5332/6294 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 59788 event pairs, 749 based on Foata normal form. 145/5807 useless extension candidates. Maximal degree in co-relation 14962. Up to 1316 conditions per place. [2022-12-05 18:37:22,064 INFO L137 encePairwiseOnDemand]: 116/126 looper letters, 57 selfloop transitions, 25 changer transitions 0/182 dead transitions. [2022-12-05 18:37:22,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 182 transitions, 746 flow [2022-12-05 18:37:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:37:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:37:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 972 transitions. [2022-12-05 18:37:22,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-12-05 18:37:22,067 INFO L175 Difference]: Start difference. First operand has 135 places, 124 transitions, 386 flow. Second operand 9 states and 972 transitions. [2022-12-05 18:37:22,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 182 transitions, 746 flow [2022-12-05 18:37:22,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 182 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 18:37:22,096 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 626 flow [2022-12-05 18:37:22,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=626, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2022-12-05 18:37:22,098 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 17 predicate places. [2022-12-05 18:37:22,098 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 626 flow [2022-12-05 18:37:22,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:22,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:22,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:22,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 18:37:22,100 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-05 18:37:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1804087513, now seen corresponding path program 1 times [2022-12-05 18:37:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:22,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924310873] [2022-12-05 18:37:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924310873] [2022-12-05 18:37:22,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924310873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:22,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:37:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009158230] [2022-12-05 18:37:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:37:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:37:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:37:22,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-05 18:37:22,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 626 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:22,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:22,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-05 18:37:22,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:24,526 INFO L130 PetriNetUnfolder]: 5472/10619 cut-off events. [2022-12-05 18:37:24,527 INFO L131 PetriNetUnfolder]: For 27499/30073 co-relation queries the response was YES. [2022-12-05 18:37:24,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37420 conditions, 10619 events. 5472/10619 cut-off events. For 27499/30073 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 96558 event pairs, 214 based on Foata normal form. 338/10469 useless extension candidates. Maximal degree in co-relation 37346. Up to 3215 conditions per place. [2022-12-05 18:37:24,621 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 86 selfloop transitions, 30 changer transitions 11/234 dead transitions. [2022-12-05 18:37:24,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 234 transitions, 1380 flow [2022-12-05 18:37:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 18:37:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 18:37:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1435 transitions. [2022-12-05 18:37:24,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8760683760683761 [2022-12-05 18:37:24,626 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 626 flow. Second operand 13 states and 1435 transitions. [2022-12-05 18:37:24,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 234 transitions, 1380 flow [2022-12-05 18:37:24,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 234 transitions, 1352 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-05 18:37:24,710 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 835 flow [2022-12-05 18:37:24,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=835, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2022-12-05 18:37:24,711 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 35 predicate places. [2022-12-05 18:37:24,711 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 835 flow [2022-12-05 18:37:24,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:24,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:24,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:24,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 18:37:24,713 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-05 18:37:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1682081595, now seen corresponding path program 1 times [2022-12-05 18:37:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:24,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382905741] [2022-12-05 18:37:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:24,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382905741] [2022-12-05 18:37:24,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382905741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:24,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:24,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:37:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511288527] [2022-12-05 18:37:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:24,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:37:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:37:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:37:24,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-05 18:37:24,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 835 flow. Second operand has 8 states, 8 states have (on average 103.75) internal successors, (830), 8 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:24,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:24,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-05 18:37:24,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:26,921 INFO L130 PetriNetUnfolder]: 4570/9727 cut-off events. [2022-12-05 18:37:26,922 INFO L131 PetriNetUnfolder]: For 42712/46410 co-relation queries the response was YES. [2022-12-05 18:37:26,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41117 conditions, 9727 events. 4570/9727 cut-off events. For 42712/46410 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 95965 event pairs, 132 based on Foata normal form. 421/9696 useless extension candidates. Maximal degree in co-relation 41034. Up to 3023 conditions per place. [2022-12-05 18:37:27,026 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 80 selfloop transitions, 48 changer transitions 41/265 dead transitions. [2022-12-05 18:37:27,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 265 transitions, 1925 flow [2022-12-05 18:37:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 18:37:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 18:37:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1764 transitions. [2022-12-05 18:37:27,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-12-05 18:37:27,031 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 835 flow. Second operand 16 states and 1764 transitions. [2022-12-05 18:37:27,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 265 transitions, 1925 flow [2022-12-05 18:37:27,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 265 transitions, 1824 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-12-05 18:37:27,597 INFO L231 Difference]: Finished difference. Result has 183 places, 171 transitions, 1080 flow [2022-12-05 18:37:27,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1080, PETRI_PLACES=183, PETRI_TRANSITIONS=171} [2022-12-05 18:37:27,598 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 50 predicate places. [2022-12-05 18:37:27,598 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 171 transitions, 1080 flow [2022-12-05 18:37:27,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.75) internal successors, (830), 8 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:27,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:27,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:27,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 18:37:27,599 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-05 18:37:27,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 308029111, now seen corresponding path program 1 times [2022-12-05 18:37:27,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:27,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876858440] [2022-12-05 18:37:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:27,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876858440] [2022-12-05 18:37:27,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876858440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:27,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:27,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:37:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689380117] [2022-12-05 18:37:27,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:27,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:37:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:27,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:37:27,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:37:27,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 126 [2022-12-05 18:37:27,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 171 transitions, 1080 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:27,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:27,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 126 [2022-12-05 18:37:27,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:28,919 INFO L130 PetriNetUnfolder]: 1804/6530 cut-off events. [2022-12-05 18:37:28,920 INFO L131 PetriNetUnfolder]: For 30581/31607 co-relation queries the response was YES. [2022-12-05 18:37:28,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24863 conditions, 6530 events. 1804/6530 cut-off events. For 30581/31607 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 79405 event pairs, 20 based on Foata normal form. 14/6194 useless extension candidates. Maximal degree in co-relation 24771. Up to 1604 conditions per place. [2022-12-05 18:37:29,101 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 51 selfloop transitions, 18 changer transitions 35/240 dead transitions. [2022-12-05 18:37:29,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 240 transitions, 1712 flow [2022-12-05 18:37:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 18:37:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 18:37:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1452 transitions. [2022-12-05 18:37:29,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2022-12-05 18:37:29,105 INFO L175 Difference]: Start difference. First operand has 183 places, 171 transitions, 1080 flow. Second operand 14 states and 1452 transitions. [2022-12-05 18:37:29,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 240 transitions, 1712 flow [2022-12-05 18:37:29,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 240 transitions, 1391 flow, removed 127 selfloop flow, removed 14 redundant places. [2022-12-05 18:37:29,756 INFO L231 Difference]: Finished difference. Result has 188 places, 179 transitions, 961 flow [2022-12-05 18:37:29,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=961, PETRI_PLACES=188, PETRI_TRANSITIONS=179} [2022-12-05 18:37:29,757 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 55 predicate places. [2022-12-05 18:37:29,757 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 179 transitions, 961 flow [2022-12-05 18:37:29,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:29,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:29,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:29,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 18:37:29,758 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-05 18:37:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash -558928487, now seen corresponding path program 2 times [2022-12-05 18:37:29,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:29,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358303331] [2022-12-05 18:37:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:30,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358303331] [2022-12-05 18:37:30,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358303331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:30,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:30,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 18:37:30,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773969926] [2022-12-05 18:37:30,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:30,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 18:37:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:30,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 18:37:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-05 18:37:30,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126 [2022-12-05 18:37:30,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 179 transitions, 961 flow. Second operand has 9 states, 9 states have (on average 103.77777777777777) internal successors, (934), 9 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:30,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:30,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126 [2022-12-05 18:37:30,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:32,047 INFO L130 PetriNetUnfolder]: 5809/12356 cut-off events. [2022-12-05 18:37:32,047 INFO L131 PetriNetUnfolder]: For 49755/59889 co-relation queries the response was YES. [2022-12-05 18:37:32,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44587 conditions, 12356 events. 5809/12356 cut-off events. For 49755/59889 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 126636 event pairs, 71 based on Foata normal form. 377/12089 useless extension candidates. Maximal degree in co-relation 44548. Up to 1576 conditions per place. [2022-12-05 18:37:32,126 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 78 selfloop transitions, 53 changer transitions 38/272 dead transitions. [2022-12-05 18:37:32,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 272 transitions, 2042 flow [2022-12-05 18:37:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 18:37:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 18:37:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2061 transitions. [2022-12-05 18:37:32,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8609022556390977 [2022-12-05 18:37:32,131 INFO L175 Difference]: Start difference. First operand has 188 places, 179 transitions, 961 flow. Second operand 19 states and 2061 transitions. [2022-12-05 18:37:32,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 272 transitions, 2042 flow [2022-12-05 18:37:32,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 272 transitions, 1772 flow, removed 109 selfloop flow, removed 11 redundant places. [2022-12-05 18:37:32,685 INFO L231 Difference]: Finished difference. Result has 190 places, 178 transitions, 992 flow [2022-12-05 18:37:32,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=992, PETRI_PLACES=190, PETRI_TRANSITIONS=178} [2022-12-05 18:37:32,687 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 57 predicate places. [2022-12-05 18:37:32,687 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 178 transitions, 992 flow [2022-12-05 18:37:32,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.77777777777777) internal successors, (934), 9 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:32,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:32,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:32,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 18:37:32,688 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-05 18:37:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1120179899, now seen corresponding path program 1 times [2022-12-05 18:37:32,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:32,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643459694] [2022-12-05 18:37:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643459694] [2022-12-05 18:37:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643459694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:33,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:33,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 18:37:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385747274] [2022-12-05 18:37:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 18:37:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 18:37:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-05 18:37:33,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 126 [2022-12-05 18:37:33,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 178 transitions, 992 flow. Second operand has 12 states, 12 states have (on average 94.41666666666667) internal successors, (1133), 12 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:33,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:33,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 126 [2022-12-05 18:37:33,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:35,145 INFO L130 PetriNetUnfolder]: 3149/11257 cut-off events. [2022-12-05 18:37:35,145 INFO L131 PetriNetUnfolder]: For 24047/25379 co-relation queries the response was YES. [2022-12-05 18:37:35,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35853 conditions, 11257 events. 3149/11257 cut-off events. For 24047/25379 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 154936 event pairs, 20 based on Foata normal form. 1/10544 useless extension candidates. Maximal degree in co-relation 35755. Up to 1052 conditions per place. [2022-12-05 18:37:35,285 INFO L137 encePairwiseOnDemand]: 110/126 looper letters, 84 selfloop transitions, 75 changer transitions 5/295 dead transitions. [2022-12-05 18:37:35,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 295 transitions, 2268 flow [2022-12-05 18:37:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 18:37:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 18:37:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1567 transitions. [2022-12-05 18:37:35,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.777281746031746 [2022-12-05 18:37:35,290 INFO L175 Difference]: Start difference. First operand has 190 places, 178 transitions, 992 flow. Second operand 16 states and 1567 transitions. [2022-12-05 18:37:35,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 295 transitions, 2268 flow [2022-12-05 18:37:36,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 295 transitions, 2001 flow, removed 94 selfloop flow, removed 17 redundant places. [2022-12-05 18:37:36,290 INFO L231 Difference]: Finished difference. Result has 194 places, 249 transitions, 1713 flow [2022-12-05 18:37:36,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1713, PETRI_PLACES=194, PETRI_TRANSITIONS=249} [2022-12-05 18:37:36,292 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 61 predicate places. [2022-12-05 18:37:36,292 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 249 transitions, 1713 flow [2022-12-05 18:37:36,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 94.41666666666667) internal successors, (1133), 12 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:36,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:36,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:36,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 18:37:36,293 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-05 18:37:36,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash -175953259, now seen corresponding path program 2 times [2022-12-05 18:37:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:36,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854441424] [2022-12-05 18:37:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:36,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854441424] [2022-12-05 18:37:36,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854441424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:36,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:36,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:37:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516009128] [2022-12-05 18:37:36,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:36,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:37:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:36,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:37:36,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:37:36,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 126 [2022-12-05 18:37:36,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 249 transitions, 1713 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:36,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:36,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 126 [2022-12-05 18:37:36,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:38,345 INFO L130 PetriNetUnfolder]: 4077/14175 cut-off events. [2022-12-05 18:37:38,345 INFO L131 PetriNetUnfolder]: For 22373/22988 co-relation queries the response was YES. [2022-12-05 18:37:38,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40648 conditions, 14175 events. 4077/14175 cut-off events. For 22373/22988 co-relation queries the response was YES. Maximal size of possible extension queue 2035. Compared 201145 event pairs, 16 based on Foata normal form. 9/13243 useless extension candidates. Maximal degree in co-relation 40612. Up to 1526 conditions per place. [2022-12-05 18:37:38,434 INFO L137 encePairwiseOnDemand]: 120/126 looper letters, 44 selfloop transitions, 7 changer transitions 62/278 dead transitions. [2022-12-05 18:37:38,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 278 transitions, 2085 flow [2022-12-05 18:37:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 18:37:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 18:37:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2022-12-05 18:37:38,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2022-12-05 18:37:38,438 INFO L175 Difference]: Start difference. First operand has 194 places, 249 transitions, 1713 flow. Second operand 7 states and 754 transitions. [2022-12-05 18:37:38,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 278 transitions, 2085 flow [2022-12-05 18:37:39,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 278 transitions, 2073 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-05 18:37:39,642 INFO L231 Difference]: Finished difference. Result has 198 places, 202 transitions, 1258 flow [2022-12-05 18:37:39,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1258, PETRI_PLACES=198, PETRI_TRANSITIONS=202} [2022-12-05 18:37:39,643 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 65 predicate places. [2022-12-05 18:37:39,643 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 202 transitions, 1258 flow [2022-12-05 18:37:39,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:39,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:39,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:39,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 18:37:39,644 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-05 18:37:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1588258059, now seen corresponding path program 3 times [2022-12-05 18:37:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:39,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887132680] [2022-12-05 18:37:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:39,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887132680] [2022-12-05 18:37:39,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887132680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:39,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:39,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 18:37:39,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503993744] [2022-12-05 18:37:39,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:39,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 18:37:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 18:37:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 18:37:39,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2022-12-05 18:37:39,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 202 transitions, 1258 flow. Second operand has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:39,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:39,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2022-12-05 18:37:39,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:41,308 INFO L130 PetriNetUnfolder]: 3872/13275 cut-off events. [2022-12-05 18:37:41,308 INFO L131 PetriNetUnfolder]: For 21363/21800 co-relation queries the response was YES. [2022-12-05 18:37:41,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38270 conditions, 13275 events. 3872/13275 cut-off events. For 21363/21800 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 189105 event pairs, 26 based on Foata normal form. 2/12495 useless extension candidates. Maximal degree in co-relation 38231. Up to 1509 conditions per place. [2022-12-05 18:37:41,424 INFO L137 encePairwiseOnDemand]: 117/126 looper letters, 30 selfloop transitions, 13 changer transitions 41/222 dead transitions. [2022-12-05 18:37:41,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 222 transitions, 1592 flow [2022-12-05 18:37:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 18:37:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 18:37:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 732 transitions. [2022-12-05 18:37:41,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8299319727891157 [2022-12-05 18:37:41,426 INFO L175 Difference]: Start difference. First operand has 198 places, 202 transitions, 1258 flow. Second operand 7 states and 732 transitions. [2022-12-05 18:37:41,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 222 transitions, 1592 flow [2022-12-05 18:37:42,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 222 transitions, 1476 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-12-05 18:37:42,652 INFO L231 Difference]: Finished difference. Result has 194 places, 180 transitions, 986 flow [2022-12-05 18:37:42,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=986, PETRI_PLACES=194, PETRI_TRANSITIONS=180} [2022-12-05 18:37:42,653 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 61 predicate places. [2022-12-05 18:37:42,653 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 180 transitions, 986 flow [2022-12-05 18:37:42,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:42,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:42,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:42,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 18:37:42,654 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-05 18:37:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash -950025323, now seen corresponding path program 4 times [2022-12-05 18:37:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923078718] [2022-12-05 18:37:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:43,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:43,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923078718] [2022-12-05 18:37:43,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923078718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:43,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:43,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-05 18:37:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320086127] [2022-12-05 18:37:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:43,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 18:37:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 18:37:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-05 18:37:43,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 126 [2022-12-05 18:37:43,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 180 transitions, 986 flow. Second operand has 9 states, 9 states have (on average 102.33333333333333) internal successors, (921), 9 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:43,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:43,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 126 [2022-12-05 18:37:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:43,759 INFO L130 PetriNetUnfolder]: 1196/4097 cut-off events. [2022-12-05 18:37:43,759 INFO L131 PetriNetUnfolder]: For 6356/6453 co-relation queries the response was YES. [2022-12-05 18:37:43,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11649 conditions, 4097 events. 1196/4097 cut-off events. For 6356/6453 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 47283 event pairs, 2 based on Foata normal form. 7/3893 useless extension candidates. Maximal degree in co-relation 11610. Up to 467 conditions per place. [2022-12-05 18:37:43,790 INFO L137 encePairwiseOnDemand]: 117/126 looper letters, 18 selfloop transitions, 9 changer transitions 9/185 dead transitions. [2022-12-05 18:37:43,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 185 transitions, 1078 flow [2022-12-05 18:37:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 18:37:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 18:37:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1028 transitions. [2022-12-05 18:37:43,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8158730158730159 [2022-12-05 18:37:43,793 INFO L175 Difference]: Start difference. First operand has 194 places, 180 transitions, 986 flow. Second operand 10 states and 1028 transitions. [2022-12-05 18:37:43,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 185 transitions, 1078 flow [2022-12-05 18:37:43,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 185 transitions, 1020 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-12-05 18:37:43,908 INFO L231 Difference]: Finished difference. Result has 192 places, 176 transitions, 929 flow [2022-12-05 18:37:43,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=929, PETRI_PLACES=192, PETRI_TRANSITIONS=176} [2022-12-05 18:37:43,909 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 59 predicate places. [2022-12-05 18:37:43,909 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 176 transitions, 929 flow [2022-12-05 18:37:43,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.33333333333333) internal successors, (921), 9 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:43,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:43,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:43,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 18:37:43,910 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-05 18:37:43,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash -998979009, now seen corresponding path program 5 times [2022-12-05 18:37:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:43,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013385180] [2022-12-05 18:37:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 18:37:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 18:37:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 18:37:44,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013385180] [2022-12-05 18:37:44,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013385180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 18:37:44,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 18:37:44,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 18:37:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313422537] [2022-12-05 18:37:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 18:37:44,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 18:37:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 18:37:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 18:37:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-05 18:37:44,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 126 [2022-12-05 18:37:44,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 176 transitions, 929 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:44,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 18:37:44,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 126 [2022-12-05 18:37:44,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 18:37:44,789 INFO L130 PetriNetUnfolder]: 1513/5005 cut-off events. [2022-12-05 18:37:44,789 INFO L131 PetriNetUnfolder]: For 7857/7991 co-relation queries the response was YES. [2022-12-05 18:37:44,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14332 conditions, 5005 events. 1513/5005 cut-off events. For 7857/7991 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 59401 event pairs, 6 based on Foata normal form. 1/4735 useless extension candidates. Maximal degree in co-relation 14296. Up to 605 conditions per place. [2022-12-05 18:37:44,827 INFO L137 encePairwiseOnDemand]: 115/126 looper letters, 21 selfloop transitions, 5 changer transitions 69/188 dead transitions. [2022-12-05 18:37:44,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 188 transitions, 1096 flow [2022-12-05 18:37:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 18:37:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 18:37:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 918 transitions. [2022-12-05 18:37:44,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2022-12-05 18:37:44,829 INFO L175 Difference]: Start difference. First operand has 192 places, 176 transitions, 929 flow. Second operand 9 states and 918 transitions. [2022-12-05 18:37:44,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 188 transitions, 1096 flow [2022-12-05 18:37:45,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 188 transitions, 1046 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-12-05 18:37:45,051 INFO L231 Difference]: Finished difference. Result has 190 places, 118 transitions, 443 flow [2022-12-05 18:37:45,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=443, PETRI_PLACES=190, PETRI_TRANSITIONS=118} [2022-12-05 18:37:45,052 INFO L294 CegarLoopForPetriNet]: 133 programPoint places, 57 predicate places. [2022-12-05 18:37:45,052 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 118 transitions, 443 flow [2022-12-05 18:37:45,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 18:37:45,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 18:37:45,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 18:37:45,053 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-05 18:37:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 18:37:45,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1086148527, now seen corresponding path program 6 times [2022-12-05 18:37:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 18:37:45,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281738811] [2022-12-05 18:37:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 18:37:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 18:37:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:37:45,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 18:37:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 18:37:45,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 18:37:45,148 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 18:37:45,149 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 18:37:45,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 18:37:45,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 18:37:45,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 18:37:45,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 18:37:45,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 18:37:45,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 18:37:45,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 18:37:45,153 INFO L458 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2022-12-05 18:37:45,160 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 18:37:45,161 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 18:37:45,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 06:37:45 BasicIcfg [2022-12-05 18:37:45,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 18:37:45,304 INFO L158 Benchmark]: Toolchain (without parser) took 29295.95ms. Allocated memory was 176.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 152.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-05 18:37:45,304 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 18:37:45,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.69ms. Allocated memory is still 176.2MB. Free memory was 151.9MB in the beginning and 125.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 18:37:45,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.41ms. Allocated memory is still 176.2MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:37:45,304 INFO L158 Benchmark]: Boogie Preprocessor took 56.43ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 120.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 18:37:45,305 INFO L158 Benchmark]: RCFGBuilder took 682.06ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 90.0MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-05 18:37:45,305 INFO L158 Benchmark]: TraceAbstraction took 27919.39ms. Allocated memory was 235.9MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 212.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-05 18:37:45,306 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.19ms. Allocated memory is still 176.2MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.69ms. Allocated memory is still 176.2MB. Free memory was 151.9MB in the beginning and 125.1MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.41ms. Allocated memory is still 176.2MB. Free memory was 125.1MB in the beginning and 122.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.43ms. Allocated memory is still 176.2MB. Free memory was 122.5MB in the beginning and 120.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 682.06ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 90.0MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 27919.39ms. Allocated memory was 235.9MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 212.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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] [L846] 0 pthread_t t1365; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365={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] [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={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] [L848] 0 pthread_t t1366; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={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] [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={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] [L850] 0 pthread_t t1367; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={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] [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={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] [L852] 0 pthread_t t1368; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={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] [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={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] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 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) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 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 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 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 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, 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=1, 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: 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. - UnprovableResult [Line: 853]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 916 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 816 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 654 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 162 mSDtfsCounter, 1541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1713occurred in iteration=9, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1251 NumberOfCodeBlocks, 1251 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 4594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 18:37:45,327 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...