/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 14:40:41,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 14:40:41,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 14:40:41,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 14:40:41,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 14:40:41,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 14:40:41,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 14:40:41,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 14:40:41,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 14:40:41,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 14:40:41,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 14:40:41,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 14:40:41,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 14:40:41,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 14:40:41,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 14:40:41,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 14:40:41,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 14:40:41,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 14:40:41,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 14:40:41,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 14:40:41,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 14:40:41,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 14:40:41,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 14:40:41,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 14:40:41,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 14:40:41,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 14:40:41,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 14:40:41,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 14:40:41,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 14:40:41,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 14:40:41,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 14:40:41,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 14:40:41,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 14:40:41,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 14:40:41,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 14:40:41,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 14:40:41,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 14:40:41,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 14:40:41,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 14:40:41,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 14:40:41,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 14:40:41,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 14:40:41,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 14:40:41,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 14:40:41,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 14:40:41,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 14:40:41,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 14:40:41,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 14:40:41,507 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 14:40:41,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 14:40:41,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 14:40:41,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 14:40:41,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 14:40:41,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:40:41,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 14:40:41,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 14:40:41,510 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-12 14:40:41,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 14:40:41,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 14:40:41,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 14:40:41,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 14:40:41,798 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 14:40:41,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-12 14:40:42,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 14:40:43,266 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 14:40:43,266 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-12 14:40:43,289 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fb45273/acc1d632c4b544ba8e2424e3480eb579/FLAGd5297cfea [2022-12-12 14:40:43,299 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94fb45273/acc1d632c4b544ba8e2424e3480eb579 [2022-12-12 14:40:43,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 14:40:43,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 14:40:43,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 14:40:43,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 14:40:43,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 14:40:43,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c26a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43, skipping insertion in model container [2022-12-12 14:40:43,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 14:40:43,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 14:40:43,467 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-12 14:40:43,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:40:43,644 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 14:40:43,650 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/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2022-12-12 14:40:43,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 14:40:43,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 14:40:43,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 14:40:43,715 INFO L208 MainTranslator]: Completed translation [2022-12-12 14:40:43,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43 WrapperNode [2022-12-12 14:40:43,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 14:40:43,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 14:40:43,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 14:40:43,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 14:40:43,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,759 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-12 14:40:43,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 14:40:43,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 14:40:43,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 14:40:43,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 14:40:43,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 14:40:43,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 14:40:43,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 14:40:43,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 14:40:43,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (1/1) ... [2022-12-12 14:40:43,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 14:40:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 14:40:43,848 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-12 14:40:43,858 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-12 14:40:43,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 14:40:43,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 14:40:43,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 14:40:43,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 14:40:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 14:40:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 14:40:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 14:40:43,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 14:40:43,885 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 14:40:43,978 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 14:40:43,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 14:40:44,325 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 14:40:44,474 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 14:40:44,475 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 14:40:44,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:40:44 BoogieIcfgContainer [2022-12-12 14:40:44,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 14:40:44,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 14:40:44,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 14:40:44,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 14:40:44,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 02:40:43" (1/3) ... [2022-12-12 14:40:44,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dbf804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:40:44, skipping insertion in model container [2022-12-12 14:40:44,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 02:40:43" (2/3) ... [2022-12-12 14:40:44,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dbf804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 02:40:44, skipping insertion in model container [2022-12-12 14:40:44,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 02:40:44" (3/3) ... [2022-12-12 14:40:44,483 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2022-12-12 14:40:44,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 14:40:44,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 14:40:44,497 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 14:40:44,556 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 14:40:44,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 14:40:44,648 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 14:40:44,648 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:44,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 14:40:44,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-12 14:40:44,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-12 14:40:44,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 14:40:44,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-12 14:40:44,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-12 14:40:44,725 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-12 14:40:44,726 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:44,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-12 14:40:44,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-12 14:40:44,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-12 14:40:48,384 INFO L241 LiptonReduction]: Total number of compositions: 85 [2022-12-12 14:40:48,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 14:40:48,411 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;@bb5189e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 14:40:48,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 14:40:48,414 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-12 14:40:48,414 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 14:40:48,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:48,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-12 14:40:48,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 459366838, now seen corresponding path program 1 times [2022-12-12 14:40:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:48,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080942520] [2022-12-12 14:40:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:48,891 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-12 14:40:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:48,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080942520] [2022-12-12 14:40:48,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080942520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:48,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:48,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548568935] [2022-12-12 14:40:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:48,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:48,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:48,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-12 14:40:48,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-12 14:40:48,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:48,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-12 14:40:48,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:49,952 INFO L130 PetriNetUnfolder]: 7624/12094 cut-off events. [2022-12-12 14:40:49,953 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-12 14:40:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23071 conditions, 12094 events. 7624/12094 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 84090 event pairs, 2133 based on Foata normal form. 0/7427 useless extension candidates. Maximal degree in co-relation 23060. Up to 9237 conditions per place. [2022-12-12 14:40:49,989 INFO L137 encePairwiseOnDemand]: 55/60 looper letters, 32 selfloop transitions, 2 changer transitions 50/95 dead transitions. [2022-12-12 14:40:49,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 370 flow [2022-12-12 14:40:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-12 14:40:50,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-12 14:40:50,035 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 129 flow. Second operand 3 states and 122 transitions. [2022-12-12 14:40:50,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 370 flow [2022-12-12 14:40:50,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 14:40:50,040 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 74 flow [2022-12-12 14:40:50,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2022-12-12 14:40:50,044 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-12 14:40:50,045 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 32 transitions, 74 flow [2022-12-12 14:40:50,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-12 14:40:50,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:50,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:50,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 14:40:50,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash -370227403, now seen corresponding path program 1 times [2022-12-12 14:40:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143989885] [2022-12-12 14:40:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:50,198 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-12 14:40:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143989885] [2022-12-12 14:40:50,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143989885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:50,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:50,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 14:40:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198618916] [2022-12-12 14:40:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:50,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 14:40:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 14:40:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 14:40:50,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 14:40:50,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-12 14:40:50,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:50,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 14:40:50,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:50,494 INFO L130 PetriNetUnfolder]: 1450/2376 cut-off events. [2022-12-12 14:40:50,495 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-12 14:40:50,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4707 conditions, 2376 events. 1450/2376 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13125 event pairs, 430 based on Foata normal form. 0/1859 useless extension candidates. Maximal degree in co-relation 4697. Up to 2079 conditions per place. [2022-12-12 14:40:50,504 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 30 selfloop transitions, 3 changer transitions 2/45 dead transitions. [2022-12-12 14:40:50,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 176 flow [2022-12-12 14:40:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-12 14:40:50,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-12 14:40:50,505 INFO L175 Difference]: Start difference. First operand has 66 places, 32 transitions, 74 flow. Second operand 3 states and 66 transitions. [2022-12-12 14:40:50,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 176 flow [2022-12-12 14:40:50,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:50,506 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 87 flow [2022-12-12 14:40:50,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-12 14:40:50,507 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -27 predicate places. [2022-12-12 14:40:50,507 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 87 flow [2022-12-12 14:40:50,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-12 14:40:50,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:50,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:50,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 14:40:50,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1407850557, now seen corresponding path program 1 times [2022-12-12 14:40:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:50,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627963701] [2022-12-12 14:40:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:50,653 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-12 14:40:50,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:50,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627963701] [2022-12-12 14:40:50,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627963701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:50,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:50,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218377991] [2022-12-12 14:40:50,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:50,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:50,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:50,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 14:40:50,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-12 14:40:50,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:50,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 14:40:50,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:50,808 INFO L130 PetriNetUnfolder]: 1099/1844 cut-off events. [2022-12-12 14:40:50,808 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-12 14:40:50,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3870 conditions, 1844 events. 1099/1844 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9716 event pairs, 259 based on Foata normal form. 20/1547 useless extension candidates. Maximal degree in co-relation 3859. Up to 1316 conditions per place. [2022-12-12 14:40:50,818 INFO L137 encePairwiseOnDemand]: 57/60 looper letters, 29 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-12 14:40:50,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 169 flow [2022-12-12 14:40:50,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-12 14:40:50,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-12 14:40:50,821 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 87 flow. Second operand 3 states and 62 transitions. [2022-12-12 14:40:50,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 169 flow [2022-12-12 14:40:50,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 14:40:50,822 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 95 flow [2022-12-12 14:40:50,823 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-12 14:40:50,824 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2022-12-12 14:40:50,824 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 95 flow [2022-12-12 14:40:50,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-12 14:40:50,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:50,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:50,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 14:40:50,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:50,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1407850681, now seen corresponding path program 1 times [2022-12-12 14:40:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:50,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182325264] [2022-12-12 14:40:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:50,955 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-12 14:40:50,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:50,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182325264] [2022-12-12 14:40:50,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182325264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:50,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:50,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192470351] [2022-12-12 14:40:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:50,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:50,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:50,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:50,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-12 14:40:50,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-12 14:40:50,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:50,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-12 14:40:50,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:51,185 INFO L130 PetriNetUnfolder]: 1708/2823 cut-off events. [2022-12-12 14:40:51,185 INFO L131 PetriNetUnfolder]: For 893/893 co-relation queries the response was YES. [2022-12-12 14:40:51,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 2823 events. 1708/2823 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15976 event pairs, 336 based on Foata normal form. 120/2430 useless extension candidates. Maximal degree in co-relation 6036. Up to 1037 conditions per place. [2022-12-12 14:40:51,195 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 36 selfloop transitions, 4 changer transitions 10/59 dead transitions. [2022-12-12 14:40:51,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 265 flow [2022-12-12 14:40:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-12 14:40:51,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-12 14:40:51,196 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 95 flow. Second operand 4 states and 84 transitions. [2022-12-12 14:40:51,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 265 flow [2022-12-12 14:40:51,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:51,197 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 106 flow [2022-12-12 14:40:51,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-12 14:40:51,198 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-12 14:40:51,198 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 106 flow [2022-12-12 14:40:51,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-12 14:40:51,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:51,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:51,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 14:40:51,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -394830727, now seen corresponding path program 1 times [2022-12-12 14:40:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:51,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471165165] [2022-12-12 14:40:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:51,275 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-12 14:40:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:51,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471165165] [2022-12-12 14:40:51,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471165165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:51,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:51,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 14:40:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731279021] [2022-12-12 14:40:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:51,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:51,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:51,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 14:40:51,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-12 14:40:51,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:51,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 14:40:51,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:51,405 INFO L130 PetriNetUnfolder]: 860/1401 cut-off events. [2022-12-12 14:40:51,406 INFO L131 PetriNetUnfolder]: For 957/962 co-relation queries the response was YES. [2022-12-12 14:40:51,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1401 events. 860/1401 cut-off events. For 957/962 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6537 event pairs, 561 based on Foata normal form. 19/1121 useless extension candidates. Maximal degree in co-relation 3332. Up to 1141 conditions per place. [2022-12-12 14:40:51,414 INFO L137 encePairwiseOnDemand]: 57/60 looper letters, 33 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-12 14:40:51,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 208 flow [2022-12-12 14:40:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 14:40:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 14:40:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-12 14:40:51,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-12 14:40:51,418 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 106 flow. Second operand 3 states and 66 transitions. [2022-12-12 14:40:51,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 208 flow [2022-12-12 14:40:51,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 194 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-12 14:40:51,421 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 103 flow [2022-12-12 14:40:51,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-12 14:40:51,423 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-12 14:40:51,423 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 103 flow [2022-12-12 14:40:51,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-12 14:40:51,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:51,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:51,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 14:40:51,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2123635269, now seen corresponding path program 1 times [2022-12-12 14:40:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:51,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632408074] [2022-12-12 14:40:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:51,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:51,541 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-12 14:40:51,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:51,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632408074] [2022-12-12 14:40:51,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632408074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:51,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:51,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:51,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86862164] [2022-12-12 14:40:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:51,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:51,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-12 14:40:51,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-12 14:40:51,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:51,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-12 14:40:51,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:51,711 INFO L130 PetriNetUnfolder]: 1361/2220 cut-off events. [2022-12-12 14:40:51,712 INFO L131 PetriNetUnfolder]: For 1125/1130 co-relation queries the response was YES. [2022-12-12 14:40:51,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 2220 events. 1361/2220 cut-off events. For 1125/1130 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11125 event pairs, 353 based on Foata normal form. 80/1856 useless extension candidates. Maximal degree in co-relation 4912. Up to 817 conditions per place. [2022-12-12 14:40:51,718 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 32 selfloop transitions, 3 changer transitions 11/53 dead transitions. [2022-12-12 14:40:51,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 236 flow [2022-12-12 14:40:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 14:40:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 14:40:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-12 14:40:51,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-12 14:40:51,719 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 103 flow. Second operand 4 states and 80 transitions. [2022-12-12 14:40:51,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 236 flow [2022-12-12 14:40:51,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:51,721 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 96 flow [2022-12-12 14:40:51,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2022-12-12 14:40:51,724 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -21 predicate places. [2022-12-12 14:40:51,725 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 96 flow [2022-12-12 14:40:51,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-12 14:40:51,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:51,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:51,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 14:40:51,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1489311807, now seen corresponding path program 1 times [2022-12-12 14:40:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:51,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446162256] [2022-12-12 14:40:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:51,828 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-12 14:40:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:51,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446162256] [2022-12-12 14:40:51,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446162256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:51,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:51,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 14:40:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661913824] [2022-12-12 14:40:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:51,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 14:40:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:51,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 14:40:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 14:40:51,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 14:40:51,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-12 14:40:51,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:51,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 14:40:51,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:52,051 INFO L130 PetriNetUnfolder]: 1316/2053 cut-off events. [2022-12-12 14:40:52,052 INFO L131 PetriNetUnfolder]: For 1899/1900 co-relation queries the response was YES. [2022-12-12 14:40:52,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 2053 events. 1316/2053 cut-off events. For 1899/1900 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10079 event pairs, 414 based on Foata normal form. 156/1454 useless extension candidates. Maximal degree in co-relation 5096. Up to 1615 conditions per place. [2022-12-12 14:40:52,060 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 30 selfloop transitions, 10 changer transitions 30/75 dead transitions. [2022-12-12 14:40:52,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 360 flow [2022-12-12 14:40:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 14:40:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 14:40:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-12 14:40:52,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2022-12-12 14:40:52,063 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 96 flow. Second operand 5 states and 112 transitions. [2022-12-12 14:40:52,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 360 flow [2022-12-12 14:40:52,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 315 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-12 14:40:52,066 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 162 flow [2022-12-12 14:40:52,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-12 14:40:52,067 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-12 14:40:52,067 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 162 flow [2022-12-12 14:40:52,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-12 14:40:52,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:52,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:52,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 14:40:52,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -43740272, now seen corresponding path program 1 times [2022-12-12 14:40:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302142863] [2022-12-12 14:40:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:52,209 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-12 14:40:52,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:52,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302142863] [2022-12-12 14:40:52,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302142863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:52,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:52,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552163127] [2022-12-12 14:40:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:52,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 14:40:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 14:40:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 14:40:52,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 14:40:52,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-12 14:40:52,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:52,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 14:40:52,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:52,392 INFO L130 PetriNetUnfolder]: 782/1366 cut-off events. [2022-12-12 14:40:52,392 INFO L131 PetriNetUnfolder]: For 559/560 co-relation queries the response was YES. [2022-12-12 14:40:52,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4643 conditions, 1366 events. 782/1366 cut-off events. For 559/560 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7276 event pairs, 95 based on Foata normal form. 141/1026 useless extension candidates. Maximal degree in co-relation 4629. Up to 856 conditions per place. [2022-12-12 14:40:52,397 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 34 selfloop transitions, 19 changer transitions 28/86 dead transitions. [2022-12-12 14:40:52,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 86 transitions, 542 flow [2022-12-12 14:40:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:40:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:40:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-12-12 14:40:52,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2022-12-12 14:40:52,398 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 162 flow. Second operand 6 states and 131 transitions. [2022-12-12 14:40:52,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 86 transitions, 542 flow [2022-12-12 14:40:52,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 530 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-12 14:40:52,407 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 302 flow [2022-12-12 14:40:52,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-12 14:40:52,408 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -19 predicate places. [2022-12-12 14:40:52,408 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 302 flow [2022-12-12 14:40:52,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-12 14:40:52,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:52,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:52,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 14:40:52,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:52,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash 177262945, now seen corresponding path program 1 times [2022-12-12 14:40:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485772930] [2022-12-12 14:40:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:52,539 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-12 14:40:52,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:52,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485772930] [2022-12-12 14:40:52,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485772930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:52,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:52,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:40:52,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491318711] [2022-12-12 14:40:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:52,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:52,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 60 [2022-12-12 14:40:52,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-12 14:40:52,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:52,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 60 [2022-12-12 14:40:52,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:52,668 INFO L130 PetriNetUnfolder]: 320/673 cut-off events. [2022-12-12 14:40:52,669 INFO L131 PetriNetUnfolder]: For 575/576 co-relation queries the response was YES. [2022-12-12 14:40:52,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2954 conditions, 673 events. 320/673 cut-off events. For 575/576 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3545 event pairs, 14 based on Foata normal form. 90/528 useless extension candidates. Maximal degree in co-relation 2937. Up to 436 conditions per place. [2022-12-12 14:40:52,671 INFO L137 encePairwiseOnDemand]: 48/60 looper letters, 25 selfloop transitions, 28 changer transitions 14/72 dead transitions. [2022-12-12 14:40:52,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 571 flow [2022-12-12 14:40:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 14:40:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 14:40:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-12 14:40:52,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2022-12-12 14:40:52,672 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 302 flow. Second operand 7 states and 125 transitions. [2022-12-12 14:40:52,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 571 flow [2022-12-12 14:40:52,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 468 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-12-12 14:40:52,677 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 300 flow [2022-12-12 14:40:52,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2022-12-12 14:40:52,678 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -17 predicate places. [2022-12-12 14:40:52,678 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 300 flow [2022-12-12 14:40:52,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-12 14:40:52,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:52,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:52,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 14:40:52,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1126457762, now seen corresponding path program 1 times [2022-12-12 14:40:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:52,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859544804] [2022-12-12 14:40:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:53,289 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-12 14:40:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:53,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859544804] [2022-12-12 14:40:53,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859544804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:53,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:53,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 14:40:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688302831] [2022-12-12 14:40:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:53,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 14:40:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 14:40:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 14:40:53,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 14:40:53,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-12 14:40:53,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:53,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 14:40:53,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:53,425 INFO L130 PetriNetUnfolder]: 335/744 cut-off events. [2022-12-12 14:40:53,425 INFO L131 PetriNetUnfolder]: For 1195/1250 co-relation queries the response was YES. [2022-12-12 14:40:53,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 744 events. 335/744 cut-off events. For 1195/1250 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4328 event pairs, 48 based on Foata normal form. 49/626 useless extension candidates. Maximal degree in co-relation 3175. Up to 443 conditions per place. [2022-12-12 14:40:53,428 INFO L137 encePairwiseOnDemand]: 54/60 looper letters, 34 selfloop transitions, 4 changer transitions 37/88 dead transitions. [2022-12-12 14:40:53,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 713 flow [2022-12-12 14:40:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 14:40:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 14:40:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-12 14:40:53,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-12 14:40:53,429 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 300 flow. Second operand 6 states and 107 transitions. [2022-12-12 14:40:53,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 713 flow [2022-12-12 14:40:53,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 88 transitions, 537 flow, removed 51 selfloop flow, removed 6 redundant places. [2022-12-12 14:40:53,436 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 225 flow [2022-12-12 14:40:53,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-12 14:40:53,436 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -17 predicate places. [2022-12-12 14:40:53,436 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 225 flow [2022-12-12 14:40:53,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-12 14:40:53,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:53,437 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:53,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 14:40:53,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1961331646, now seen corresponding path program 1 times [2022-12-12 14:40:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:53,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008669548] [2022-12-12 14:40:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 14:40:53,822 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-12 14:40:53,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 14:40:53,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008669548] [2022-12-12 14:40:53,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008669548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 14:40:53,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 14:40:53,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 14:40:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543705323] [2022-12-12 14:40:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 14:40:53,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 14:40:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 14:40:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 14:40:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 14:40:53,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2022-12-12 14:40:53,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-12 14:40:53,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 14:40:53,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2022-12-12 14:40:53,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 14:40:54,003 INFO L130 PetriNetUnfolder]: 260/606 cut-off events. [2022-12-12 14:40:54,003 INFO L131 PetriNetUnfolder]: For 490/513 co-relation queries the response was YES. [2022-12-12 14:40:54,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 606 events. 260/606 cut-off events. For 490/513 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3633 event pairs, 8 based on Foata normal form. 41/508 useless extension candidates. Maximal degree in co-relation 1955. Up to 229 conditions per place. [2022-12-12 14:40:54,005 INFO L137 encePairwiseOnDemand]: 53/60 looper letters, 44 selfloop transitions, 8 changer transitions 26/91 dead transitions. [2022-12-12 14:40:54,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 609 flow [2022-12-12 14:40:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 14:40:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 14:40:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-12 14:40:54,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26875 [2022-12-12 14:40:54,007 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 225 flow. Second operand 8 states and 129 transitions. [2022-12-12 14:40:54,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 609 flow [2022-12-12 14:40:54,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 598 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-12 14:40:54,009 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 251 flow [2022-12-12 14:40:54,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-12 14:40:54,010 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -14 predicate places. [2022-12-12 14:40:54,010 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 251 flow [2022-12-12 14:40:54,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-12 14:40:54,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 14:40:54,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:54,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:40:54,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 14:40:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 14:40:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1738849228, now seen corresponding path program 2 times [2022-12-12 14:40:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 14:40:54,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037886949] [2022-12-12 14:40:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 14:40:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 14:40:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:40:54,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 14:40:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 14:40:54,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 14:40:54,068 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 14:40:54,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 14:40:54,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 14:40:54,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 14:40:54,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 14:40:54,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 14:40:54,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 14:40:54,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 14:40:54,070 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 14:40:54,074 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:40:54,074 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:40:54,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:40:54 BasicIcfg [2022-12-12 14:40:54,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:40:54,110 INFO L158 Benchmark]: Toolchain (without parser) took 10807.92ms. Allocated memory was 181.4MB in the beginning and 647.0MB in the end (delta: 465.6MB). Free memory was 153.4MB in the beginning and 318.6MB in the end (delta: -165.2MB). Peak memory consumption was 302.0MB. Max. memory is 8.0GB. [2022-12-12 14:40:54,110 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:40:54,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.58ms. Allocated memory is still 181.4MB. Free memory was 153.4MB in the beginning and 127.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 14:40:54,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.91ms. Allocated memory is still 181.4MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:40:54,110 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 181.4MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:40:54,111 INFO L158 Benchmark]: RCFGBuilder took 668.57ms. Allocated memory was 181.4MB in the beginning and 232.8MB in the end (delta: 51.4MB). Free memory was 123.0MB in the beginning and 201.8MB in the end (delta: -78.8MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. [2022-12-12 14:40:54,111 INFO L158 Benchmark]: TraceAbstraction took 9631.01ms. Allocated memory was 232.8MB in the beginning and 647.0MB in the end (delta: 414.2MB). Free memory was 200.2MB in the beginning and 318.6MB in the end (delta: -118.4MB). Peak memory consumption was 295.8MB. Max. memory is 8.0GB. [2022-12-12 14:40:54,112 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.13ms. Allocated memory is still 181.4MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.58ms. Allocated memory is still 181.4MB. Free memory was 153.4MB in the beginning and 127.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.91ms. Allocated memory is still 181.4MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 181.4MB. Free memory was 125.1MB in the beginning and 123.0MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 668.57ms. Allocated memory was 181.4MB in the beginning and 232.8MB in the end (delta: 51.4MB). Free memory was 123.0MB in the beginning and 201.8MB in the end (delta: -78.8MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. * TraceAbstraction took 9631.01ms. Allocated memory was 232.8MB in the beginning and 647.0MB in the end (delta: 414.2MB). Free memory was 200.2MB in the beginning and 318.6MB in the end (delta: -118.4MB). Peak memory consumption was 295.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 113 PlacesBefore, 69 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2986, independent: 2874, independent conditional: 2874, independent unconditional: 0, dependent: 112, dependent conditional: 112, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2986, independent: 2874, independent conditional: 0, independent unconditional: 2874, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2986, independent: 2874, independent conditional: 0, independent unconditional: 2874, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2986, independent: 2874, independent conditional: 0, independent unconditional: 2874, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1599, independent: 1556, independent conditional: 0, independent unconditional: 1556, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1599, independent: 1540, independent conditional: 0, independent unconditional: 1540, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2986, independent: 1318, independent conditional: 0, independent unconditional: 1318, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1599, unknown conditional: 0, unknown unconditional: 1599] , Statistics on independence cache: Total cache size (in pairs): 2907, Positive cache size: 2864, Positive conditional cache size: 0, Positive unconditional cache size: 2864, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=-1, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=1, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 834]: 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: 836]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 984 IncrementalHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 2 mSDtfsCounter, 984 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=8, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-12 14:40:54,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...