/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:16:03,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:16:03,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:16:03,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:16:03,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:16:03,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:16:03,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:16:03,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:16:03,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:16:03,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:16:03,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:16:03,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:16:03,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:16:03,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:16:03,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:16:03,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:16:03,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:16:03,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:16:03,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:16:03,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:16:03,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:16:03,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:16:03,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:16:03,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:16:03,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:16:03,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:16:03,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:16:03,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:16:03,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:16:03,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:16:03,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:16:03,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:16:03,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:16:03,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:16:03,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:16:03,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:16:03,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:16:03,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:16:03,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:16:03,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:16:03,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:16:03,695 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-RepeatedSemanticLbe.epf [2022-12-13 06:16:03,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:16:03,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:16:03,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:16:03,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:16:03,722 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:16:03,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:16:03,723 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:16:03,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:16:03,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:16:03,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:16:03,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:16:03,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:16:03,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:16:03,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:16:03,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:16:03,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:16:03,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:16:03,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:16:03,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:16:03,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:16:03,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:16:04,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:16:04,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:16:04,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:16:04,017 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:16:04,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2022-12-13 06:16:05,023 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:16:05,298 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:16:05,299 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2022-12-13 06:16:05,317 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa86ef1ad/bd36bb4a828b4d27964962d0ebd20381/FLAG80b0a93f1 [2022-12-13 06:16:05,328 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa86ef1ad/bd36bb4a828b4d27964962d0ebd20381 [2022-12-13 06:16:05,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:16:05,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:16:05,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:16:05,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:16:05,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:16:05,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35752ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05, skipping insertion in model container [2022-12-13 06:16:05,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:16:05,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:16:05,544 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/mix043.opt.i[944,957] [2022-12-13 06:16:05,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:16:05,761 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:16:05,771 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/mix043.opt.i[944,957] [2022-12-13 06:16:05,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:16:05,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:16:05,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:16:05,878 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:16:05,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05 WrapperNode [2022-12-13 06:16:05,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:16:05,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:16:05,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:16:05,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:16:05,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,946 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2022-12-13 06:16:05,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:16:05,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:16:05,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:16:05,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:16:05,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,981 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:16:05,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:16:05,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:16:05,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:16:05,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (1/1) ... [2022-12-13 06:16:05,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:16:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:16:06,022 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-13 06:16:06,044 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-13 06:16:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:16:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:16:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:16:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:16:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:16:06,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:16:06,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:16:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:16:06,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:16:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 06:16:06,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 06:16:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 06:16:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 06:16:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:16:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:16:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:16:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:16:06,062 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:16:06,166 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:16:06,176 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:16:06,451 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:16:06,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:16:06,622 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:16:06,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:16:06 BoogieIcfgContainer [2022-12-13 06:16:06,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:16:06,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:16:06,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:16:06,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:16:06,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:16:05" (1/3) ... [2022-12-13 06:16:06,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faa29eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:16:06, skipping insertion in model container [2022-12-13 06:16:06,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:05" (2/3) ... [2022-12-13 06:16:06,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faa29eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:16:06, skipping insertion in model container [2022-12-13 06:16:06,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:16:06" (3/3) ... [2022-12-13 06:16:06,630 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2022-12-13 06:16:06,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:16:06,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:16:06,647 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:16:06,698 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:16:06,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 06:16:06,783 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 06:16:06,784 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:16:06,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 06:16:06,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 06:16:06,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-13 06:16:06,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:06,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 06:16:06,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-13 06:16:06,844 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 06:16:06,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:16:06,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 06:16:06,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 06:16:06,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-13 06:16:16,825 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-13 06:16:16,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:16:16,841 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=REPEATED_LIPTON_PN, 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;@11aabe59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:16:16,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 06:16:16,846 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 06:16:16,846 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:16:16,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:16,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:16,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2037744349, now seen corresponding path program 1 times [2022-12-13 06:16:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:16,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727477312] [2022-12-13 06:16:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:17,249 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-13 06:16:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:17,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727477312] [2022-12-13 06:16:17,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727477312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:17,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:17,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:16:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232592893] [2022-12-13 06:16:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:17,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:16:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:16:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:16:17,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 68 [2022-12-13 06:16:17,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-13 06:16:17,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:17,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 68 [2022-12-13 06:16:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:23,617 INFO L130 PetriNetUnfolder]: 49367/69921 cut-off events. [2022-12-13 06:16:23,617 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-13 06:16:23,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135377 conditions, 69921 events. 49367/69921 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 4112. Compared 535234 event pairs, 5495 based on Foata normal form. 0/40874 useless extension candidates. Maximal degree in co-relation 135365. Up to 57313 conditions per place. [2022-12-13 06:16:23,834 INFO L137 encePairwiseOnDemand]: 61/68 looper letters, 37 selfloop transitions, 3 changer transitions 48/101 dead transitions. [2022-12-13 06:16:23,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 101 transitions, 390 flow [2022-12-13 06:16:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:16:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:16:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-12-13 06:16:23,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6568627450980392 [2022-12-13 06:16:23,850 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2022-12-13 06:16:23,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 101 transitions, 390 flow [2022-12-13 06:16:23,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 53 transitions, 198 flow [2022-12-13 06:16:24,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:24,286 INFO L89 Accepts]: Start accepts. Operand has 55 places, 53 transitions, 198 flow [2022-12-13 06:16:24,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:24,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:24,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 53 transitions, 198 flow [2022-12-13 06:16:24,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 198 flow [2022-12-13 06:16:24,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 06:16:26,727 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:26,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2444 [2022-12-13 06:16:26,729 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 198 flow [2022-12-13 06:16:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-13 06:16:26,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:26,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:26,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:16:26,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -232742346, now seen corresponding path program 1 times [2022-12-13 06:16:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:26,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093510758] [2022-12-13 06:16:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:26,953 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-13 06:16:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:26,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093510758] [2022-12-13 06:16:26,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093510758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:26,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:26,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:16:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258679931] [2022-12-13 06:16:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:16:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:16:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:16:26,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 06:16:26,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-13 06:16:26,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:26,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 06:16:26,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:27,709 INFO L130 PetriNetUnfolder]: 6143/9017 cut-off events. [2022-12-13 06:16:27,710 INFO L131 PetriNetUnfolder]: For 366/408 co-relation queries the response was YES. [2022-12-13 06:16:27,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25914 conditions, 9017 events. 6143/9017 cut-off events. For 366/408 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 55811 event pairs, 1135 based on Foata normal form. 240/7146 useless extension candidates. Maximal degree in co-relation 25899. Up to 7009 conditions per place. [2022-12-13 06:16:27,758 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 48 selfloop transitions, 2 changer transitions 1/64 dead transitions. [2022-12-13 06:16:27,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 344 flow [2022-12-13 06:16:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:16:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:16:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 06:16:27,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2022-12-13 06:16:27,761 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -23 predicate places. [2022-12-13 06:16:27,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 64 transitions, 344 flow [2022-12-13 06:16:27,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 63 transitions, 338 flow [2022-12-13 06:16:27,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:27,842 INFO L89 Accepts]: Start accepts. Operand has 56 places, 63 transitions, 338 flow [2022-12-13 06:16:27,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:27,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:27,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 63 transitions, 338 flow [2022-12-13 06:16:27,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 63 transitions, 338 flow [2022-12-13 06:16:27,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-13 06:16:27,960 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:27,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 06:16:27,961 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 338 flow [2022-12-13 06:16:27,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-13 06:16:27,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:27,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:27,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:16:27,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash -327045383, now seen corresponding path program 1 times [2022-12-13 06:16:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:27,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375586321] [2022-12-13 06:16:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:28,353 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-13 06:16:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375586321] [2022-12-13 06:16:28,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375586321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:28,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:28,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:16:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137108824] [2022-12-13 06:16:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:28,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:16:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:16:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:16:28,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 06:16:28,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 338 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-13 06:16:28,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:28,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 06:16:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:29,216 INFO L130 PetriNetUnfolder]: 6775/9935 cut-off events. [2022-12-13 06:16:29,216 INFO L131 PetriNetUnfolder]: For 2558/2578 co-relation queries the response was YES. [2022-12-13 06:16:29,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36993 conditions, 9935 events. 6775/9935 cut-off events. For 2558/2578 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 60928 event pairs, 647 based on Foata normal form. 48/7960 useless extension candidates. Maximal degree in co-relation 36975. Up to 7321 conditions per place. [2022-12-13 06:16:29,285 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 88 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2022-12-13 06:16:29,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:16:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:16:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2022-12-13 06:16:29,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2022-12-13 06:16:29,287 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -21 predicate places. [2022-12-13 06:16:29,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:29,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:29,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:29,391 INFO L89 Accepts]: Start accepts. Operand has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:29,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:29,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:29,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:29,395 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:29,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 1390 [2022-12-13 06:16:30,302 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:16:30,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 912 [2022-12-13 06:16:30,304 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 108 transitions, 798 flow [2022-12-13 06:16:30,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-13 06:16:30,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:30,304 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:30,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:16:30,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash -942964506, now seen corresponding path program 1 times [2022-12-13 06:16:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:30,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296079368] [2022-12-13 06:16:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:30,640 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-13 06:16:30,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:30,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296079368] [2022-12-13 06:16:30,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296079368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:30,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:30,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:16:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028933393] [2022-12-13 06:16:30,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:30,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:16:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:16:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:16:30,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2022-12-13 06:16:30,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 108 transitions, 798 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-13 06:16:30,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:30,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2022-12-13 06:16:30,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:31,681 INFO L130 PetriNetUnfolder]: 6879/10113 cut-off events. [2022-12-13 06:16:31,682 INFO L131 PetriNetUnfolder]: For 3689/3815 co-relation queries the response was YES. [2022-12-13 06:16:31,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46964 conditions, 10113 events. 6879/10113 cut-off events. For 3689/3815 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 62497 event pairs, 631 based on Foata normal form. 32/8098 useless extension candidates. Maximal degree in co-relation 46943. Up to 7449 conditions per place. [2022-12-13 06:16:31,761 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 111 selfloop transitions, 12 changer transitions 0/135 dead transitions. [2022-12-13 06:16:31,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:16:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:16:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2022-12-13 06:16:31,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.63 [2022-12-13 06:16:31,764 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2022-12-13 06:16:31,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:31,902 INFO L89 Accepts]: Start accepts. Operand has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:31,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:31,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 1666 [2022-12-13 06:16:31,998 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:31,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 06:16:31,999 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 135 transitions, 1260 flow [2022-12-13 06:16:31,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-13 06:16:31,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:32,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:32,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:16:32,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -758072616, now seen corresponding path program 1 times [2022-12-13 06:16:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:32,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798751146] [2022-12-13 06:16:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:32,167 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-13 06:16:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:32,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798751146] [2022-12-13 06:16:32,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798751146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:32,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:32,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:16:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558589414] [2022-12-13 06:16:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:32,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:16:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:32,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:16:32,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:16:32,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:16:32,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 135 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 06:16:32,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:32,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:16:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:33,782 INFO L130 PetriNetUnfolder]: 13645/19074 cut-off events. [2022-12-13 06:16:33,782 INFO L131 PetriNetUnfolder]: For 28201/28359 co-relation queries the response was YES. [2022-12-13 06:16:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98490 conditions, 19074 events. 13645/19074 cut-off events. For 28201/28359 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 117913 event pairs, 2003 based on Foata normal form. 112/16014 useless extension candidates. Maximal degree in co-relation 98466. Up to 17775 conditions per place. [2022-12-13 06:16:33,942 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 170 selfloop transitions, 49 changer transitions 0/230 dead transitions. [2022-12-13 06:16:33,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:16:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:16:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 06:16:33,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 06:16:33,944 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -15 predicate places. [2022-12-13 06:16:33,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:34,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:34,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:34,316 INFO L89 Accepts]: Start accepts. Operand has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:34,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:34,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:34,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:34,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:34,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 1922 [2022-12-13 06:16:34,485 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:34,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 06:16:34,488 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 230 transitions, 2631 flow [2022-12-13 06:16:34,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 06:16:34,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:34,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:34,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:16:34,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1789090464, now seen corresponding path program 1 times [2022-12-13 06:16:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:34,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740271430] [2022-12-13 06:16:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:34,694 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-13 06:16:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:34,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740271430] [2022-12-13 06:16:34,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740271430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:34,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:34,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:16:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951557731] [2022-12-13 06:16:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:34,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:16:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:16:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:16:34,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:16:34,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 230 transitions, 2631 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-13 06:16:34,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:34,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:16:34,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:35,928 INFO L130 PetriNetUnfolder]: 9207/13523 cut-off events. [2022-12-13 06:16:35,929 INFO L131 PetriNetUnfolder]: For 25000/25192 co-relation queries the response was YES. [2022-12-13 06:16:35,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83014 conditions, 13523 events. 9207/13523 cut-off events. For 25000/25192 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 86598 event pairs, 847 based on Foata normal form. 362/11671 useless extension candidates. Maximal degree in co-relation 82987. Up to 12539 conditions per place. [2022-12-13 06:16:36,070 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 173 selfloop transitions, 97 changer transitions 0/281 dead transitions. [2022-12-13 06:16:36,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:16:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:16:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-13 06:16:36,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 06:16:36,074 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -12 predicate places. [2022-12-13 06:16:36,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:36,297 INFO L89 Accepts]: Start accepts. Operand has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:36,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:36,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 2124 [2022-12-13 06:16:36,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:36,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 06:16:36,425 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 281 transitions, 3763 flow [2022-12-13 06:16:36,425 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-13 06:16:36,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:36,425 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-13 06:16:36,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:16:36,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -742311293, now seen corresponding path program 1 times [2022-12-13 06:16:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:36,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519968070] [2022-12-13 06:16:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:36,578 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-13 06:16:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519968070] [2022-12-13 06:16:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519968070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:36,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:36,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:16:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875327445] [2022-12-13 06:16:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:36,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:16:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:16:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:16:36,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2022-12-13 06:16:36,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 281 transitions, 3763 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-13 06:16:36,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:36,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2022-12-13 06:16:36,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:38,746 INFO L130 PetriNetUnfolder]: 14013/20619 cut-off events. [2022-12-13 06:16:38,746 INFO L131 PetriNetUnfolder]: For 62243/62549 co-relation queries the response was YES. [2022-12-13 06:16:38,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141783 conditions, 20619 events. 14013/20619 cut-off events. For 62243/62549 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 143433 event pairs, 1482 based on Foata normal form. 1036/17909 useless extension candidates. Maximal degree in co-relation 141753. Up to 19149 conditions per place. [2022-12-13 06:16:38,911 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 425 selfloop transitions, 22 changer transitions 17/486 dead transitions. [2022-12-13 06:16:38,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 486 transitions, 7579 flow [2022-12-13 06:16:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:16:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:16:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-13 06:16:38,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 06:16:38,913 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -9 predicate places. [2022-12-13 06:16:38,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 486 transitions, 7579 flow [2022-12-13 06:16:39,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 469 transitions, 7307 flow [2022-12-13 06:16:39,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:39,164 INFO L89 Accepts]: Start accepts. Operand has 71 places, 469 transitions, 7307 flow [2022-12-13 06:16:39,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:39,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:39,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 469 transitions, 7307 flow [2022-12-13 06:16:39,184 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 469 transitions, 7307 flow [2022-12-13 06:16:39,184 INFO L226 LiptonReduction]: Number of co-enabled transitions 2856 [2022-12-13 06:16:39,292 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:39,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 06:16:39,293 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 469 transitions, 7307 flow [2022-12-13 06:16:39,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-13 06:16:39,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:39,293 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-13 06:16:39,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:16:39,293 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:39,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1285251155, now seen corresponding path program 1 times [2022-12-13 06:16:39,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:39,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711795333] [2022-12-13 06:16:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:39,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:39,453 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-13 06:16:39,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:39,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711795333] [2022-12-13 06:16:39,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711795333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:39,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:39,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:16:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150017810] [2022-12-13 06:16:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:39,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:16:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:16:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:16:39,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:16:39,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 469 transitions, 7307 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-13 06:16:39,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:39,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:16:39,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:40,961 INFO L130 PetriNetUnfolder]: 6443/10231 cut-off events. [2022-12-13 06:16:40,961 INFO L131 PetriNetUnfolder]: For 41587/41931 co-relation queries the response was YES. [2022-12-13 06:16:40,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80242 conditions, 10231 events. 6443/10231 cut-off events. For 41587/41931 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 71988 event pairs, 254 based on Foata normal form. 790/9112 useless extension candidates. Maximal degree in co-relation 80209. Up to 9352 conditions per place. [2022-12-13 06:16:41,045 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 251 selfloop transitions, 191 changer transitions 23/477 dead transitions. [2022-12-13 06:16:41,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 477 transitions, 8328 flow [2022-12-13 06:16:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:16:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:16:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2022-12-13 06:16:41,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.73 [2022-12-13 06:16:41,047 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2022-12-13 06:16:41,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 477 transitions, 8328 flow [2022-12-13 06:16:41,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 454 transitions, 7914 flow [2022-12-13 06:16:41,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:41,190 INFO L89 Accepts]: Start accepts. Operand has 75 places, 454 transitions, 7914 flow [2022-12-13 06:16:41,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:41,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:41,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 454 transitions, 7914 flow [2022-12-13 06:16:41,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 454 transitions, 7914 flow [2022-12-13 06:16:41,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 2692 [2022-12-13 06:16:41,263 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:41,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 06:16:41,264 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 454 transitions, 7914 flow [2022-12-13 06:16:41,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-13 06:16:41,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:41,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:41,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:16:41,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1463753584, now seen corresponding path program 1 times [2022-12-13 06:16:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:41,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384962465] [2022-12-13 06:16:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:41,384 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-13 06:16:41,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:41,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384962465] [2022-12-13 06:16:41,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384962465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:41,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:41,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:16:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247382705] [2022-12-13 06:16:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:41,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:16:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:16:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:16:41,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2022-12-13 06:16:41,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 454 transitions, 7914 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-13 06:16:41,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:41,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2022-12-13 06:16:41,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:43,340 INFO L130 PetriNetUnfolder]: 9912/16145 cut-off events. [2022-12-13 06:16:43,340 INFO L131 PetriNetUnfolder]: For 90975/91385 co-relation queries the response was YES. [2022-12-13 06:16:43,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136643 conditions, 16145 events. 9912/16145 cut-off events. For 90975/91385 co-relation queries the response was YES. Maximal size of possible extension queue 933. Compared 124552 event pairs, 345 based on Foata normal form. 539/13575 useless extension candidates. Maximal degree in co-relation 136607. Up to 14422 conditions per place. [2022-12-13 06:16:43,423 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 596 selfloop transitions, 43 changer transitions 218/884 dead transitions. [2022-12-13 06:16:43,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 884 transitions, 17433 flow [2022-12-13 06:16:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:16:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:16:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-13 06:16:43,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 06:16:43,425 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2022-12-13 06:16:43,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 884 transitions, 17433 flow [2022-12-13 06:16:43,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 666 transitions, 13034 flow [2022-12-13 06:16:43,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:43,649 INFO L89 Accepts]: Start accepts. Operand has 78 places, 666 transitions, 13034 flow [2022-12-13 06:16:43,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:43,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:43,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 666 transitions, 13034 flow [2022-12-13 06:16:43,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 666 transitions, 13034 flow [2022-12-13 06:16:43,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 3040 [2022-12-13 06:16:43,743 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:16:43,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 06:16:43,744 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 666 transitions, 13034 flow [2022-12-13 06:16:43,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-13 06:16:43,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:43,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:43,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:16:43,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash 120628118, now seen corresponding path program 2 times [2022-12-13 06:16:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:43,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047478696] [2022-12-13 06:16:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:43,877 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-13 06:16:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:43,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047478696] [2022-12-13 06:16:43,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047478696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:43,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:43,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:16:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640596973] [2022-12-13 06:16:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:43,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:16:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:43,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:16:43,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:16:43,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 06:16:43,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 666 transitions, 13034 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-13 06:16:43,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:43,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 06:16:43,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:45,113 INFO L130 PetriNetUnfolder]: 5514/8892 cut-off events. [2022-12-13 06:16:45,113 INFO L131 PetriNetUnfolder]: For 65886/66457 co-relation queries the response was YES. [2022-12-13 06:16:45,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80756 conditions, 8892 events. 5514/8892 cut-off events. For 65886/66457 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 61972 event pairs, 81 based on Foata normal form. 753/7978 useless extension candidates. Maximal degree in co-relation 80717. Up to 7690 conditions per place. [2022-12-13 06:16:45,161 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 98 selfloop transitions, 99 changer transitions 449/657 dead transitions. [2022-12-13 06:16:45,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 657 transitions, 14142 flow [2022-12-13 06:16:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:16:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:16:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-12-13 06:16:45,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-13 06:16:45,163 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2022-12-13 06:16:45,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 657 transitions, 14142 flow [2022-12-13 06:16:45,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 208 transitions, 4201 flow [2022-12-13 06:16:45,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:45,291 INFO L89 Accepts]: Start accepts. Operand has 80 places, 208 transitions, 4201 flow [2022-12-13 06:16:45,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:45,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:45,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 208 transitions, 4201 flow [2022-12-13 06:16:45,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 208 transitions, 4201 flow [2022-12-13 06:16:45,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-13 06:16:46,845 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 06:16:46,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1556 [2022-12-13 06:16:46,846 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 207 transitions, 4179 flow [2022-12-13 06:16:46,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-13 06:16:46,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:46,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:46,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:16:46,846 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 549368684, now seen corresponding path program 1 times [2022-12-13 06:16:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:46,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675341060] [2022-12-13 06:16:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:16:46,979 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-13 06:16:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:16:46,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675341060] [2022-12-13 06:16:46,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675341060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:16:46,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:16:46,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:16:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138351775] [2022-12-13 06:16:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:16:46,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:16:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:16:46,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:16:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:16:46,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2022-12-13 06:16:46,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 207 transitions, 4179 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-13 06:16:46,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:16:46,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2022-12-13 06:16:46,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:16:47,536 INFO L130 PetriNetUnfolder]: 3991/6163 cut-off events. [2022-12-13 06:16:47,537 INFO L131 PetriNetUnfolder]: For 40998/41370 co-relation queries the response was YES. [2022-12-13 06:16:47,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60063 conditions, 6163 events. 3991/6163 cut-off events. For 40998/41370 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 36167 event pairs, 97 based on Foata normal form. 116/4727 useless extension candidates. Maximal degree in co-relation 60021. Up to 5535 conditions per place. [2022-12-13 06:16:47,572 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 118 selfloop transitions, 7 changer transitions 176/324 dead transitions. [2022-12-13 06:16:47,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 324 transitions, 7332 flow [2022-12-13 06:16:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:16:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:16:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-13 06:16:47,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-13 06:16:47,574 INFO L295 CegarLoopForPetriNet]: 80 programPoint places, 2 predicate places. [2022-12-13 06:16:47,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 324 transitions, 7332 flow [2022-12-13 06:16:47,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 148 transitions, 3178 flow [2022-12-13 06:16:47,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:16:47,648 INFO L89 Accepts]: Start accepts. Operand has 77 places, 148 transitions, 3178 flow [2022-12-13 06:16:47,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:16:47,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:16:47,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 148 transitions, 3178 flow [2022-12-13 06:16:47,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 148 transitions, 3178 flow [2022-12-13 06:16:47,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 06:16:47,910 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 06:16:47,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-13 06:16:47,911 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 147 transitions, 3154 flow [2022-12-13 06:16:47,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-13 06:16:47,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:16:47,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:16:47,911 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:16:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:16:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1538263791, now seen corresponding path program 1 times [2022-12-13 06:16:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:16:47,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947474604] [2022-12-13 06:16:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:16:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:16:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:16:47,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:16:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:16:47,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:16:47,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:16:47,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 06:16:47,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 06:16:47,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 06:16:47,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 06:16:47,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 06:16:47,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 06:16:47,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 06:16:47,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 06:16:47,999 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:16:48,004 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:16:48,004 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:16:48,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:16:48 BasicIcfg [2022-12-13 06:16:48,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:16:48,075 INFO L158 Benchmark]: Toolchain (without parser) took 42743.52ms. Allocated memory was 192.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 166.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-13 06:16:48,075 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 168.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:16:48,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.54ms. Allocated memory is still 192.9MB. Free memory was 166.6MB in the beginning and 138.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 06:16:48,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.77ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 135.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:16:48,076 INFO L158 Benchmark]: Boogie Preprocessor took 36.49ms. Allocated memory is still 192.9MB. Free memory was 135.3MB in the beginning and 133.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:16:48,076 INFO L158 Benchmark]: RCFGBuilder took 639.29ms. Allocated memory is still 192.9MB. Free memory was 133.0MB in the beginning and 98.9MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 06:16:48,076 INFO L158 Benchmark]: TraceAbstraction took 41449.42ms. Allocated memory was 192.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 97.9MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-13 06:16:48,077 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.10ms. Allocated memory is still 192.9MB. Free memory is still 168.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.54ms. Allocated memory is still 192.9MB. Free memory was 166.6MB in the beginning and 138.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.77ms. Allocated memory is still 192.9MB. Free memory was 138.2MB in the beginning and 135.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.49ms. Allocated memory is still 192.9MB. Free memory was 135.3MB in the beginning and 133.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 639.29ms. Allocated memory is still 192.9MB. Free memory was 133.0MB in the beginning and 98.9MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 41449.42ms. Allocated memory was 192.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 97.9MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 138 PlacesBefore, 80 PlacesAfterwards, 127 TransitionsBefore, 68 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 4 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4475, independent: 4319, independent conditional: 4319, independent unconditional: 0, dependent: 156, dependent conditional: 156, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4475, independent: 4319, independent conditional: 0, independent unconditional: 4319, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4475, independent: 4319, independent conditional: 0, independent unconditional: 4319, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4475, independent: 4319, independent conditional: 0, independent unconditional: 4319, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2705, independent: 2653, independent conditional: 0, independent unconditional: 2653, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2705, independent: 2602, independent conditional: 0, independent unconditional: 2602, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 307, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4475, independent: 1666, independent conditional: 0, independent unconditional: 1666, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 2705, unknown conditional: 0, unknown unconditional: 2705] , Statistics on independence cache: Total cache size (in pairs): 4765, Positive cache size: 4713, Positive conditional cache size: 0, Positive unconditional cache size: 4713, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 55 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 165, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 99, independent unconditional: 66, dependent: 18, dependent conditional: 17, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 165, independent conditional: 6, independent unconditional: 159, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 6, independent unconditional: 159, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, independent: 91, independent conditional: 4, independent unconditional: 87, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 74, independent conditional: 2, independent unconditional: 72, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 100, unknown conditional: 6, unknown unconditional: 94] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 91, Positive conditional cache size: 4, Positive unconditional cache size: 87, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 107, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 56 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 261, independent conditional: 261, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 261, independent conditional: 162, independent unconditional: 99, dependent: 29, dependent conditional: 25, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 238, independent conditional: 0, independent unconditional: 238, dependent: 51, dependent conditional: 5, dependent unconditional: 46, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 114, Positive conditional cache size: 4, Positive unconditional cache size: 110, Negative cache size: 12, Negative conditional cache size: 2, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 207, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 59 PlacesBefore, 59 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 1390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 678, independent: 578, independent conditional: 578, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 678, independent: 578, independent conditional: 358, independent unconditional: 220, dependent: 100, dependent conditional: 94, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 858, independent: 578, independent conditional: 0, independent unconditional: 578, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 858, independent: 578, independent conditional: 0, independent unconditional: 578, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 858, independent: 569, independent conditional: 0, independent unconditional: 569, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 123, Positive conditional cache size: 4, Positive unconditional cache size: 119, Negative cache size: 12, Negative conditional cache size: 2, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 632, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 1666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, independent: 415, independent conditional: 415, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 483, independent: 415, independent conditional: 278, independent unconditional: 137, dependent: 68, dependent conditional: 62, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 669, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 669, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 669, independent: 410, independent conditional: 0, independent unconditional: 410, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 128, Positive conditional cache size: 4, Positive unconditional cache size: 124, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 526, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 230 TransitionsBefore, 230 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 963, independent: 840, independent conditional: 840, independent unconditional: 0, dependent: 123, dependent conditional: 123, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 963, independent: 840, independent conditional: 601, independent unconditional: 239, dependent: 123, dependent conditional: 123, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1431, independent: 840, independent conditional: 58, independent unconditional: 782, dependent: 591, dependent conditional: 0, dependent unconditional: 591, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1431, independent: 840, independent conditional: 58, independent unconditional: 782, dependent: 591, dependent conditional: 0, dependent unconditional: 591, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1431, independent: 839, independent conditional: 58, independent unconditional: 781, dependent: 591, dependent conditional: 0, dependent unconditional: 591, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 129, Positive conditional cache size: 4, Positive unconditional cache size: 125, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1134, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 598, independent: 458, independent conditional: 458, independent unconditional: 0, dependent: 140, dependent conditional: 140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 598, independent: 458, independent conditional: 196, independent unconditional: 262, dependent: 140, dependent conditional: 9, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 616, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 616, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 616, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 137, Positive conditional cache size: 4, Positive unconditional cache size: 133, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 223, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 71 PlacesBefore, 71 PlacesAfterwards, 469 TransitionsBefore, 469 TransitionsAfterwards, 2856 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1436, independent: 1240, independent conditional: 1240, independent unconditional: 0, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1436, independent: 1240, independent conditional: 992, independent unconditional: 248, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2200, independent: 1240, independent conditional: 372, independent unconditional: 868, dependent: 960, dependent conditional: 0, dependent unconditional: 960, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2200, independent: 1240, independent conditional: 372, independent unconditional: 868, dependent: 960, dependent conditional: 0, dependent unconditional: 960, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2200, independent: 1240, independent conditional: 372, independent unconditional: 868, dependent: 960, dependent conditional: 0, dependent unconditional: 960, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 137, Positive conditional cache size: 4, Positive unconditional cache size: 133, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1580, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 75 PlacesBefore, 75 PlacesAfterwards, 454 TransitionsBefore, 454 TransitionsAfterwards, 2692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2136, independent: 1940, independent conditional: 1940, independent unconditional: 0, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2136, independent: 1940, independent conditional: 1620, independent unconditional: 320, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3384, independent: 1940, independent conditional: 444, independent unconditional: 1496, dependent: 1444, dependent conditional: 0, dependent unconditional: 1444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3384, independent: 1940, independent conditional: 444, independent unconditional: 1496, dependent: 1444, dependent conditional: 0, dependent unconditional: 1444, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3384, independent: 1933, independent conditional: 443, independent unconditional: 1490, dependent: 1444, dependent conditional: 0, dependent unconditional: 1444, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 144, Positive conditional cache size: 5, Positive unconditional cache size: 139, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2620, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 666 TransitionsBefore, 666 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4410, independent: 4284, independent conditional: 4284, independent unconditional: 0, dependent: 126, dependent conditional: 126, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4410, independent: 4284, independent conditional: 4032, independent unconditional: 252, dependent: 126, dependent conditional: 126, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5292, independent: 4284, independent conditional: 2520, independent unconditional: 1764, dependent: 1008, dependent conditional: 0, dependent unconditional: 1008, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5292, independent: 4284, independent conditional: 2520, independent unconditional: 1764, dependent: 1008, dependent conditional: 0, dependent unconditional: 1008, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5292, independent: 4264, independent conditional: 2504, independent unconditional: 1760, dependent: 1008, dependent conditional: 0, dependent unconditional: 1008, unknown: 20, unknown conditional: 16, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 164, Positive conditional cache size: 21, Positive unconditional cache size: 143, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2520, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 80 PlacesBefore, 79 PlacesAfterwards, 208 TransitionsBefore, 207 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 645, independent: 597, independent conditional: 597, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 645, independent: 597, independent conditional: 443, independent unconditional: 154, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 885, independent: 597, independent conditional: 344, independent unconditional: 253, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 885, independent: 597, independent conditional: 344, independent unconditional: 253, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 885, independent: 585, independent conditional: 338, independent unconditional: 247, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 183, Positive conditional cache size: 27, Positive unconditional cache size: 156, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 387, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 77 PlacesBefore, 76 PlacesAfterwards, 148 TransitionsBefore, 147 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 31, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 50, independent conditional: 25, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 25, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 44, independent conditional: 23, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 219, Positive conditional cache size: 29, Positive unconditional cache size: 190, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1098 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 5 mSDtfsCounter, 1098 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13034occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 766 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-13 06:16:48,103 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...