/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:40:59,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:40:59,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:40:59,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:40:59,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:40:59,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:40:59,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:40:59,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:40:59,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:40:59,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:40:59,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:40:59,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:40:59,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:40:59,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:40:59,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:40:59,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:40:59,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:40:59,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:40:59,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:40:59,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:40:59,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:40:59,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:40:59,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:40:59,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:40:59,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:40:59,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:40:59,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:40:59,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:40:59,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:40:59,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:40:59,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:40:59,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:40:59,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:40:59,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:40:59,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:40:59,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:40:59,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:40:59,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:40:59,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:40:59,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:40:59,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:40:59,729 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:40:59,755 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:40:59,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:40:59,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:40:59,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:40:59,758 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:40:59,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:40:59,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:40:59,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:40:59,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:40:59,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:40:59,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:40:59,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:40:59,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:40:59,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:40:59,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:40:59,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:40:59,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:40:59,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:40:59,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:40:59,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:40:59,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:40:59,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:40:59,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:41:00,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:41:00,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:41:00,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:41:00,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:41:00,076 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:41:00,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2022-12-06 06:41:01,051 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:41:01,263 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:41:01,264 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2022-12-06 06:41:01,289 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c2bbf6a/fa89042ca750479196533913e43df78c/FLAG039e3a148 [2022-12-06 06:41:01,301 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3c2bbf6a/fa89042ca750479196533913e43df78c [2022-12-06 06:41:01,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:41:01,303 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:41:01,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:41:01,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:41:01,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:41:01,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2383c36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01, skipping insertion in model container [2022-12-06 06:41:01,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:41:01,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:41:01,482 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/safe018_rmo.oepc.i[993,1006] [2022-12-06 06:41:01,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:41:01,681 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:41:01,695 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/safe018_rmo.oepc.i[993,1006] [2022-12-06 06:41:01,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:41:01,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:41:01,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:41:01,784 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:41:01,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01 WrapperNode [2022-12-06 06:41:01,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:41:01,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:41:01,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:41:01,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:41:01,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,843 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 06:41:01,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:41:01,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:41:01,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:41:01,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:41:01,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,875 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:41:01,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:41:01,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:41:01,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:41:01,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (1/1) ... [2022-12-06 06:41:01,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:41:01,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:41:01,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:41:01,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:41:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:41:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:41:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:41:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:41:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:41:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:41:01,966 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:41:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:41:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:41:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:41:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:41:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:41:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:41:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:41:01,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:41:01,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:41:01,969 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:41:02,094 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:41:02,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:41:02,354 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:41:02,485 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:41:02,486 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:41:02,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:41:02 BoogieIcfgContainer [2022-12-06 06:41:02,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:41:02,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:41:02,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:41:02,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:41:02,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:41:01" (1/3) ... [2022-12-06 06:41:02,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5387efa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:41:02, skipping insertion in model container [2022-12-06 06:41:02,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:41:01" (2/3) ... [2022-12-06 06:41:02,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5387efa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:41:02, skipping insertion in model container [2022-12-06 06:41:02,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:41:02" (3/3) ... [2022-12-06 06:41:02,495 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-12-06 06:41:02,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:41:02,508 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:41:02,509 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:41:02,554 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:41:02,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 06:41:02,658 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-12-06 06:41:02,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:02,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 06:41:02,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 06:41:02,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2022-12-06 06:41:02,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:02,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 06:41:02,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2022-12-06 06:41:02,711 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2022-12-06 06:41:02,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:02,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 06:41:02,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 06:41:02,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-06 06:41:09,344 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 06:41:09,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:41:09,360 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;@b03665c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:41:09,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:41:09,364 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 06:41:09,364 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:09,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:09,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:09,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1729796226, now seen corresponding path program 1 times [2022-12-06 06:41:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:09,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384549106] [2022-12-06 06:41:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:09,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384549106] [2022-12-06 06:41:09,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384549106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:09,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:09,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954903770] [2022-12-06 06:41:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:09,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:41:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:41:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:41:09,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:41:09,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 47 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:09,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:09,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:41:09,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:09,710 INFO L130 PetriNetUnfolder]: 293/481 cut-off events. [2022-12-06 06:41:09,710 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:41:09,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 481 events. 293/481 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1896 event pairs, 293 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 963. Up to 463 conditions per place. [2022-12-06 06:41:09,717 INFO L137 encePairwiseOnDemand]: 18/19 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2022-12-06 06:41:09,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 18 transitions, 77 flow [2022-12-06 06:41:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:41:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:41:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 06:41:09,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 06:41:09,726 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 47 flow. Second operand 2 states and 21 transitions. [2022-12-06 06:41:09,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 18 transitions, 77 flow [2022-12-06 06:41:09,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:41:09,730 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 42 flow [2022-12-06 06:41:09,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2022-12-06 06:41:09,734 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 06:41:09,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:09,734 INFO L89 Accepts]: Start accepts. Operand has 26 places, 18 transitions, 42 flow [2022-12-06 06:41:09,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:09,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:09,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 42 flow [2022-12-06 06:41:09,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 42 flow [2022-12-06 06:41:09,750 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 06:41:09,750 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:09,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:41:09,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 42 flow [2022-12-06 06:41:09,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 06:41:09,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:09,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 06:41:09,848 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 42 flow [2022-12-06 06:41:09,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:09,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:09,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:09,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:41:09,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -181862396, now seen corresponding path program 1 times [2022-12-06 06:41:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:09,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638569103] [2022-12-06 06:41:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638569103] [2022-12-06 06:41:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638569103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:10,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775624133] [2022-12-06 06:41:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:10,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:41:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:41:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:41:10,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 06:41:10,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:10,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 06:41:10,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:10,240 INFO L130 PetriNetUnfolder]: 272/460 cut-off events. [2022-12-06 06:41:10,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 460 events. 272/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1841 event pairs, 74 based on Foata normal form. 9/468 useless extension candidates. Maximal degree in co-relation 912. Up to 325 conditions per place. [2022-12-06 06:41:10,246 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-06 06:41:10,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 98 flow [2022-12-06 06:41:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:41:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:41:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 06:41:10,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-06 06:41:10,247 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 29 transitions. [2022-12-06 06:41:10,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 98 flow [2022-12-06 06:41:10,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:41:10,249 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 50 flow [2022-12-06 06:41:10,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2022-12-06 06:41:10,250 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2022-12-06 06:41:10,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:10,250 INFO L89 Accepts]: Start accepts. Operand has 28 places, 18 transitions, 50 flow [2022-12-06 06:41:10,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:10,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:10,251 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 18 transitions, 50 flow [2022-12-06 06:41:10,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 18 transitions, 50 flow [2022-12-06 06:41:10,254 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 06:41:10,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:41:10,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:10,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 18 transitions, 50 flow [2022-12-06 06:41:10,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 06:41:10,350 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:10,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-06 06:41:10,352 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 50 flow [2022-12-06 06:41:10,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:10,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:10,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:41:10,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1342766355, now seen corresponding path program 1 times [2022-12-06 06:41:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:10,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998862285] [2022-12-06 06:41:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:10,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:10,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998862285] [2022-12-06 06:41:10,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998862285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:10,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:10,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:41:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856612129] [2022-12-06 06:41:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:10,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:10,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:10,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:10,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:41:10,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:10,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:41:10,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:10,667 INFO L130 PetriNetUnfolder]: 465/766 cut-off events. [2022-12-06 06:41:10,669 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 06:41:10,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 766 events. 465/766 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3258 event pairs, 109 based on Foata normal form. 36/798 useless extension candidates. Maximal degree in co-relation 1628. Up to 324 conditions per place. [2022-12-06 06:41:10,677 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 27 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2022-12-06 06:41:10,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 161 flow [2022-12-06 06:41:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 06:41:10,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-06 06:41:10,678 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 50 flow. Second operand 4 states and 41 transitions. [2022-12-06 06:41:10,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 161 flow [2022-12-06 06:41:10,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:10,680 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 60 flow [2022-12-06 06:41:10,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-12-06 06:41:10,681 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-06 06:41:10,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:10,681 INFO L89 Accepts]: Start accepts. Operand has 31 places, 18 transitions, 60 flow [2022-12-06 06:41:10,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:10,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:10,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 18 transitions, 60 flow [2022-12-06 06:41:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 18 transitions, 60 flow [2022-12-06 06:41:10,686 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 06:41:10,686 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 06:41:10,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 18 events. 0/18 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:10,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 18 transitions, 60 flow [2022-12-06 06:41:10,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 06:41:10,690 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:10,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:41:10,691 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2022-12-06 06:41:10,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,692 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:10,692 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:10,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:41:10,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1323832973, now seen corresponding path program 1 times [2022-12-06 06:41:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:10,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597034704] [2022-12-06 06:41:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:10,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597034704] [2022-12-06 06:41:10,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597034704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:10,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:10,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:41:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499402292] [2022-12-06 06:41:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:10,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:41:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:41:10,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:41:10,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 06:41:10,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:10,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 06:41:10,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:10,954 INFO L130 PetriNetUnfolder]: 175/320 cut-off events. [2022-12-06 06:41:10,954 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-06 06:41:10,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 320 events. 175/320 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1214 event pairs, 55 based on Foata normal form. 6/324 useless extension candidates. Maximal degree in co-relation 753. Up to 229 conditions per place. [2022-12-06 06:41:10,956 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 06:41:10,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 148 flow [2022-12-06 06:41:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:41:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:41:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:41:10,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 06:41:10,957 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:41:10,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 148 flow [2022-12-06 06:41:10,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 131 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:41:10,959 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 56 flow [2022-12-06 06:41:10,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2022-12-06 06:41:10,961 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2022-12-06 06:41:10,961 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:10,961 INFO L89 Accepts]: Start accepts. Operand has 30 places, 18 transitions, 56 flow [2022-12-06 06:41:10,962 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:10,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:10,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-06 06:41:10,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 56 flow [2022-12-06 06:41:10,971 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 06:41:10,971 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:41:10,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:41:10,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 56 flow [2022-12-06 06:41:10,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 06:41:10,973 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:10,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 06:41:10,980 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 56 flow [2022-12-06 06:41:10,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:10,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:10,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:10,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:41:10,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:10,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 891790460, now seen corresponding path program 1 times [2022-12-06 06:41:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:10,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116133819] [2022-12-06 06:41:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:11,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116133819] [2022-12-06 06:41:11,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116133819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:11,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:11,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:41:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336566117] [2022-12-06 06:41:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:11,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:41:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:41:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:41:11,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:41:11,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:11,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:11,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:41:11,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:12,104 INFO L130 PetriNetUnfolder]: 278/485 cut-off events. [2022-12-06 06:41:12,104 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-06 06:41:12,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 485 events. 278/485 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2019 event pairs, 75 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1152. Up to 202 conditions per place. [2022-12-06 06:41:12,107 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 28 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-12-06 06:41:12,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 172 flow [2022-12-06 06:41:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 06:41:12,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 06:41:12,109 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 56 flow. Second operand 4 states and 39 transitions. [2022-12-06 06:41:12,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 172 flow [2022-12-06 06:41:12,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:12,110 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 90 flow [2022-12-06 06:41:12,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 06:41:12,110 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2022-12-06 06:41:12,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:12,110 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 90 flow [2022-12-06 06:41:12,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:12,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:12,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 90 flow [2022-12-06 06:41:12,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 90 flow [2022-12-06 06:41:12,116 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 06:41:12,116 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-06 06:41:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 39 events. 3/39 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 117 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 76. Up to 8 conditions per place. [2022-12-06 06:41:12,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 90 flow [2022-12-06 06:41:12,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:41:12,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:12,150 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 06:41:12,150 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 92 flow [2022-12-06 06:41:12,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:12,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:12,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:12,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:41:12,151 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1178684358, now seen corresponding path program 2 times [2022-12-06 06:41:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622762569] [2022-12-06 06:41:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:12,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622762569] [2022-12-06 06:41:12,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622762569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:12,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63589391] [2022-12-06 06:41:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:12,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:41:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:41:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:41:12,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:41:12,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:12,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:12,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:41:12,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:12,989 INFO L130 PetriNetUnfolder]: 270/473 cut-off events. [2022-12-06 06:41:12,989 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-06 06:41:12,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 473 events. 270/473 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2043 event pairs, 53 based on Foata normal form. 4/476 useless extension candidates. Maximal degree in co-relation 1253. Up to 214 conditions per place. [2022-12-06 06:41:12,991 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-06 06:41:12,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 35 transitions, 198 flow [2022-12-06 06:41:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 06:41:12,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:41:12,993 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 92 flow. Second operand 4 states and 38 transitions. [2022-12-06 06:41:12,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 35 transitions, 198 flow [2022-12-06 06:41:12,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:41:12,994 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 108 flow [2022-12-06 06:41:12,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 06:41:12,995 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 8 predicate places. [2022-12-06 06:41:12,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:12,995 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 108 flow [2022-12-06 06:41:12,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:12,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:12,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 108 flow [2022-12-06 06:41:12,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 108 flow [2022-12-06 06:41:13,001 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 06:41:13,001 INFO L131 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2022-12-06 06:41:13,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 39 events. 3/39 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 0 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 83. Up to 8 conditions per place. [2022-12-06 06:41:13,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 108 flow [2022-12-06 06:41:13,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 06:41:13,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:41:13,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 06:41:13,077 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 108 flow [2022-12-06 06:41:13,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:13,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:13,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:13,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:41:13,078 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1133084728, now seen corresponding path program 1 times [2022-12-06 06:41:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:13,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404438899] [2022-12-06 06:41:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:13,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:13,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404438899] [2022-12-06 06:41:13,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404438899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:13,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:13,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029658944] [2022-12-06 06:41:13,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:13,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:13,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:41:13,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:13,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:13,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:41:13,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:13,295 INFO L130 PetriNetUnfolder]: 196/360 cut-off events. [2022-12-06 06:41:13,296 INFO L131 PetriNetUnfolder]: For 447/447 co-relation queries the response was YES. [2022-12-06 06:41:13,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 360 events. 196/360 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1488 event pairs, 21 based on Foata normal form. 33/391 useless extension candidates. Maximal degree in co-relation 1077. Up to 152 conditions per place. [2022-12-06 06:41:13,298 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2022-12-06 06:41:13,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 332 flow [2022-12-06 06:41:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 06:41:13,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-06 06:41:13,299 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 108 flow. Second operand 4 states and 47 transitions. [2022-12-06 06:41:13,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 332 flow [2022-12-06 06:41:13,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:13,301 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 131 flow [2022-12-06 06:41:13,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 06:41:13,301 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2022-12-06 06:41:13,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:13,301 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 131 flow [2022-12-06 06:41:13,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:13,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:13,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 131 flow [2022-12-06 06:41:13,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 131 flow [2022-12-06 06:41:13,311 INFO L130 PetriNetUnfolder]: 24/82 cut-off events. [2022-12-06 06:41:13,311 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-12-06 06:41:13,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 82 events. 24/82 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 300 event pairs, 8 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 203. Up to 48 conditions per place. [2022-12-06 06:41:13,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 131 flow [2022-12-06 06:41:13,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 06:41:13,314 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:13,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:41:13,315 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 131 flow [2022-12-06 06:41:13,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:13,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:13,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:13,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:41:13,315 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:13,316 INFO L85 PathProgramCache]: Analyzing trace with hash 189194982, now seen corresponding path program 1 times [2022-12-06 06:41:13,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:13,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386536524] [2022-12-06 06:41:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:13,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386536524] [2022-12-06 06:41:13,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386536524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:13,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:13,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:41:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719845862] [2022-12-06 06:41:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:41:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:13,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:41:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:41:13,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:41:13,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:13,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:13,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:41:13,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:13,569 INFO L130 PetriNetUnfolder]: 118/237 cut-off events. [2022-12-06 06:41:13,569 INFO L131 PetriNetUnfolder]: For 340/340 co-relation queries the response was YES. [2022-12-06 06:41:13,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 237 events. 118/237 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 888 event pairs, 10 based on Foata normal form. 23/258 useless extension candidates. Maximal degree in co-relation 851. Up to 98 conditions per place. [2022-12-06 06:41:13,571 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 45 selfloop transitions, 8 changer transitions 1/55 dead transitions. [2022-12-06 06:41:13,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 388 flow [2022-12-06 06:41:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:41:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:41:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 06:41:13,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 06:41:13,574 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 131 flow. Second operand 5 states and 55 transitions. [2022-12-06 06:41:13,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 388 flow [2022-12-06 06:41:13,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 378 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:41:13,576 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 171 flow [2022-12-06 06:41:13,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2022-12-06 06:41:13,579 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 14 predicate places. [2022-12-06 06:41:13,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:13,579 INFO L89 Accepts]: Start accepts. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 06:41:13,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:13,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:13,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 06:41:13,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 171 flow [2022-12-06 06:41:13,595 INFO L130 PetriNetUnfolder]: 14/64 cut-off events. [2022-12-06 06:41:13,595 INFO L131 PetriNetUnfolder]: For 79/93 co-relation queries the response was YES. [2022-12-06 06:41:13,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 64 events. 14/64 cut-off events. For 79/93 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 1 based on Foata normal form. 4/67 useless extension candidates. Maximal degree in co-relation 202. Up to 32 conditions per place. [2022-12-06 06:41:13,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 171 flow [2022-12-06 06:41:13,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:41:13,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:41:13,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 06:41:13,601 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 171 flow [2022-12-06 06:41:13,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:13,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:13,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:13,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:41:13,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash 695063832, now seen corresponding path program 1 times [2022-12-06 06:41:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:13,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195451426] [2022-12-06 06:41:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:13,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:13,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:13,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195451426] [2022-12-06 06:41:13,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195451426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:13,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:13,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:41:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360519790] [2022-12-06 06:41:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:13,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:41:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:41:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:41:13,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:41:13,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:13,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:13,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:41:13,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:13,853 INFO L130 PetriNetUnfolder]: 79/165 cut-off events. [2022-12-06 06:41:13,853 INFO L131 PetriNetUnfolder]: For 374/374 co-relation queries the response was YES. [2022-12-06 06:41:13,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 165 events. 79/165 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 566 event pairs, 10 based on Foata normal form. 8/171 useless extension candidates. Maximal degree in co-relation 681. Up to 69 conditions per place. [2022-12-06 06:41:13,854 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 35 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2022-12-06 06:41:13,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 370 flow [2022-12-06 06:41:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:41:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:41:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 06:41:13,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-12-06 06:41:13,856 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 171 flow. Second operand 6 states and 49 transitions. [2022-12-06 06:41:13,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 370 flow [2022-12-06 06:41:13,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 326 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 06:41:13,859 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 174 flow [2022-12-06 06:41:13,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 06:41:13,860 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2022-12-06 06:41:13,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:13,860 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 174 flow [2022-12-06 06:41:13,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:13,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:13,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 174 flow [2022-12-06 06:41:13,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 174 flow [2022-12-06 06:41:13,867 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-06 06:41:13,867 INFO L131 PetriNetUnfolder]: For 80/86 co-relation queries the response was YES. [2022-12-06 06:41:13,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 50 events. 11/50 cut-off events. For 80/86 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 153. Up to 17 conditions per place. [2022-12-06 06:41:13,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 174 flow [2022-12-06 06:41:13,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 06:41:14,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L780-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_13|) (= |v_P0Thread1of1ForFork0_#res.base_13| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [570] L836-3-->L847: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_170 256) 0))) (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_180 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_370 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse0 (select |v_#memory_int_523| |v_~#y~0.base_227|)) (.cse2 (not .cse4)) (.cse11 (and .cse10 .cse1)) (.cse7 (not .cse5)) (.cse8 (not .cse6))) (and (= (store |v_#memory_int_523| |v_~#y~0.base_227| (store .cse0 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite22#1_173|)) |v_#memory_int_522|) (= v_~y$w_buff0_used~0_370 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_371)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem20#1_224| |v_ULTIMATE.start_main_#t~mem20#1_222|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~ite22#1_173|) (or (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~mem20#1_222|) (= (select .cse0 |v_~#y~0.offset_227|) |v_ULTIMATE.start_main_#t~mem20#1_222|)) (and .cse7 .cse8 (= v_~y$w_buff1~0_205 |v_ULTIMATE.start_main_#t~ite21#1_217|) .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite21#1_219| |v_ULTIMATE.start_main_#t~ite21#1_217|) (= |v_ULTIMATE.start_main_#t~ite22#1_173| v_~y$w_buff0~0_185) .cse1 .cse2 .cse9))) (= v_~y$r_buff1_thd0~0_179 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_367 256) 0)) .cse8) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_169 256) 0)))) 0 v_~y$r_buff1_thd0~0_180)) (= v_~y$r_buff0_thd0~0_169 (ite .cse11 0 v_~y$r_buff0_thd0~0_170)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~y$w_buff1_used~0_367 (ite (or .cse11 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_368)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_224|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_185, #memory_int=|v_#memory_int_523|, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_219|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_77|, ~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~#y~0.base=|v_~#y~0.base_227|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_172|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_185, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, #memory_int=|v_#memory_int_522|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[|v_ULTIMATE.start_main_#t~ite21#1_217|, |v_ULTIMATE.start_main_#t~mem20#1_222|, |v_ULTIMATE.start_main_#t~ite22#1_173|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ite22#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:41:14,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L814-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [570] L836-3-->L847: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_170 256) 0))) (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_180 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_370 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse0 (select |v_#memory_int_523| |v_~#y~0.base_227|)) (.cse2 (not .cse4)) (.cse11 (and .cse10 .cse1)) (.cse7 (not .cse5)) (.cse8 (not .cse6))) (and (= (store |v_#memory_int_523| |v_~#y~0.base_227| (store .cse0 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite22#1_173|)) |v_#memory_int_522|) (= v_~y$w_buff0_used~0_370 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_371)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem20#1_224| |v_ULTIMATE.start_main_#t~mem20#1_222|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~ite22#1_173|) (or (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~mem20#1_222|) (= (select .cse0 |v_~#y~0.offset_227|) |v_ULTIMATE.start_main_#t~mem20#1_222|)) (and .cse7 .cse8 (= v_~y$w_buff1~0_205 |v_ULTIMATE.start_main_#t~ite21#1_217|) .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite21#1_219| |v_ULTIMATE.start_main_#t~ite21#1_217|) (= |v_ULTIMATE.start_main_#t~ite22#1_173| v_~y$w_buff0~0_185) .cse1 .cse2 .cse9))) (= v_~y$r_buff1_thd0~0_179 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_367 256) 0)) .cse8) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_169 256) 0)))) 0 v_~y$r_buff1_thd0~0_180)) (= v_~y$r_buff0_thd0~0_169 (ite .cse11 0 v_~y$r_buff0_thd0~0_170)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~y$w_buff1_used~0_367 (ite (or .cse11 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_368)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_224|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_185, #memory_int=|v_#memory_int_523|, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_219|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_77|, ~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~#y~0.base=|v_~#y~0.base_227|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_172|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_185, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, #memory_int=|v_#memory_int_522|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[|v_ULTIMATE.start_main_#t~ite21#1_217|, |v_ULTIMATE.start_main_#t~mem20#1_222|, |v_ULTIMATE.start_main_#t~ite22#1_173|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ite22#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:41:15,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] L792-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_17| 0) (= |v_P1Thread1of1ForFork1_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [570] L836-3-->L847: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_170 256) 0))) (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_180 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_368 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_370 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse0 (select |v_#memory_int_523| |v_~#y~0.base_227|)) (.cse2 (not .cse4)) (.cse11 (and .cse10 .cse1)) (.cse7 (not .cse5)) (.cse8 (not .cse6))) (and (= (store |v_#memory_int_523| |v_~#y~0.base_227| (store .cse0 |v_~#y~0.offset_227| |v_ULTIMATE.start_main_#t~ite22#1_173|)) |v_#memory_int_522|) (= v_~y$w_buff0_used~0_370 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_371)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem20#1_224| |v_ULTIMATE.start_main_#t~mem20#1_222|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~ite22#1_173|) (or (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite21#1_217| |v_ULTIMATE.start_main_#t~mem20#1_222|) (= (select .cse0 |v_~#y~0.offset_227|) |v_ULTIMATE.start_main_#t~mem20#1_222|)) (and .cse7 .cse8 (= v_~y$w_buff1~0_205 |v_ULTIMATE.start_main_#t~ite21#1_217|) .cse9))) (and (= |v_ULTIMATE.start_main_#t~ite21#1_219| |v_ULTIMATE.start_main_#t~ite21#1_217|) (= |v_ULTIMATE.start_main_#t~ite22#1_173| v_~y$w_buff0~0_185) .cse1 .cse2 .cse9))) (= v_~y$r_buff1_thd0~0_179 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_367 256) 0)) .cse8) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_169 256) 0)))) 0 v_~y$r_buff1_thd0~0_180)) (= v_~y$r_buff0_thd0~0_169 (ite .cse11 0 v_~y$r_buff0_thd0~0_170)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_229 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~y$w_buff1_used~0_367 (ite (or .cse11 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_368)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~#y~0.base=|v_~#y~0.base_227|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_224|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_185, #memory_int=|v_#memory_int_523|, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_219|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_368} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_77|, ~#y~0.offset=|v_~#y~0.offset_227|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~#y~0.base=|v_~#y~0.base_227|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_172|, ~y$w_buff1~0=v_~y$w_buff1~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_169, ~y$w_buff0~0=v_~y$w_buff0~0_185, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, #memory_int=|v_#memory_int_522|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_229, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_61|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_367, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[|v_ULTIMATE.start_main_#t~ite21#1_217|, |v_ULTIMATE.start_main_#t~mem20#1_222|, |v_ULTIMATE.start_main_#t~ite22#1_173|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~y$w_buff0_used~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~ite22#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:41:17,416 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:41:17,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3557 [2022-12-06 06:41:17,417 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 168 flow [2022-12-06 06:41:17,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:17,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:17,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:41:17,417 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1477741865, now seen corresponding path program 1 times [2022-12-06 06:41:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:17,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936213469] [2022-12-06 06:41:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:41:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:41:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:41:17,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936213469] [2022-12-06 06:41:17,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936213469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:41:17,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:41:17,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:41:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462151035] [2022-12-06 06:41:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:41:17,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:41:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:41:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:41:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:41:17,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:41:17,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 168 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:17,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:41:17,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:41:17,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:41:17,633 INFO L130 PetriNetUnfolder]: 141/275 cut-off events. [2022-12-06 06:41:17,633 INFO L131 PetriNetUnfolder]: For 647/647 co-relation queries the response was YES. [2022-12-06 06:41:17,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 275 events. 141/275 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1088 event pairs, 22 based on Foata normal form. 3/278 useless extension candidates. Maximal degree in co-relation 1073. Up to 142 conditions per place. [2022-12-06 06:41:17,634 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 1 changer transitions 16/43 dead transitions. [2022-12-06 06:41:17,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 362 flow [2022-12-06 06:41:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:41:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:41:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 06:41:17,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-06 06:41:17,635 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 168 flow. Second operand 4 states and 35 transitions. [2022-12-06 06:41:17,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 362 flow [2022-12-06 06:41:17,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 280 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 06:41:17,637 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 115 flow [2022-12-06 06:41:17,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 06:41:17,638 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2022-12-06 06:41:17,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:41:17,638 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 115 flow [2022-12-06 06:41:17,639 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:41:17,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:41:17,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 115 flow [2022-12-06 06:41:17,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 115 flow [2022-12-06 06:41:17,645 INFO L130 PetriNetUnfolder]: 11/53 cut-off events. [2022-12-06 06:41:17,645 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-12-06 06:41:17,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 53 events. 11/53 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 166 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 120. Up to 12 conditions per place. [2022-12-06 06:41:17,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 115 flow [2022-12-06 06:41:17,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 06:41:20,102 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:41:20,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2464 [2022-12-06 06:41:20,103 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 119 flow [2022-12-06 06:41:20,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:41:20,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:41:20,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:20,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:41:20,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:41:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:41:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2092349930, now seen corresponding path program 1 times [2022-12-06 06:41:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:41:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921463820] [2022-12-06 06:41:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:41:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:41:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:41:20,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:41:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:41:20,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:41:20,214 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:41:20,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:41:20,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:41:20,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:41:20,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:41:20,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:41:20,216 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:41:20,221 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:41:20,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:41:20,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:41:20 BasicIcfg [2022-12-06 06:41:20,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:41:20,293 INFO L158 Benchmark]: Toolchain (without parser) took 18990.03ms. Allocated memory was 182.5MB in the beginning and 494.9MB in the end (delta: 312.5MB). Free memory was 156.2MB in the beginning and 341.5MB in the end (delta: -185.3MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. [2022-12-06 06:41:20,293 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:41:20,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.97ms. Allocated memory is still 182.5MB. Free memory was 156.2MB in the beginning and 130.7MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:41:20,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.74ms. Allocated memory is still 182.5MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:20,294 INFO L158 Benchmark]: Boogie Preprocessor took 44.12ms. Allocated memory is still 182.5MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:41:20,294 INFO L158 Benchmark]: RCFGBuilder took 598.75ms. Allocated memory is still 182.5MB. Free memory was 126.2MB in the beginning and 116.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-12-06 06:41:20,295 INFO L158 Benchmark]: TraceAbstraction took 17802.47ms. Allocated memory was 182.5MB in the beginning and 494.9MB in the end (delta: 312.5MB). Free memory was 116.3MB in the beginning and 341.5MB in the end (delta: -225.3MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. [2022-12-06 06:41:20,296 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.09ms. Allocated memory is still 127.9MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 480.97ms. Allocated memory is still 182.5MB. Free memory was 156.2MB in the beginning and 130.7MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.74ms. Allocated memory is still 182.5MB. Free memory was 130.4MB in the beginning and 128.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.12ms. Allocated memory is still 182.5MB. Free memory was 128.3MB in the beginning and 126.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 598.75ms. Allocated memory is still 182.5MB. Free memory was 126.2MB in the beginning and 116.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 17802.47ms. Allocated memory was 182.5MB in the beginning and 494.9MB in the end (delta: 312.5MB). Free memory was 116.3MB in the beginning and 341.5MB in the end (delta: -225.3MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 117 PlacesBefore, 28 PlacesAfterwards, 108 TransitionsBefore, 19 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 765, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 690, independent: 657, independent conditional: 0, independent unconditional: 657, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 690, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 203, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 806, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 690, unknown conditional: 0, unknown unconditional: 690] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 977, Positive conditional cache size: 0, Positive unconditional cache size: 977, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: 0.1s, 28 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 10, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 29, independent conditional: 3, independent unconditional: 26, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 80, independent conditional: 34, independent unconditional: 46, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 80, independent conditional: 29, independent unconditional: 51, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 80, independent conditional: 29, independent unconditional: 51, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 74, independent conditional: 25, independent unconditional: 49, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 43, Positive conditional cache size: 4, Positive unconditional cache size: 39, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 120, independent: 96, independent conditional: 36, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 96, independent conditional: 26, independent unconditional: 70, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 96, independent conditional: 26, independent unconditional: 70, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 4, independent unconditional: 10, 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: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 82, independent conditional: 22, independent unconditional: 60, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 14, unknown conditional: 4, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 57, Positive conditional cache size: 8, Positive unconditional cache size: 49, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 18, independent unconditional: 8, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 26, independent conditional: 12, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 12, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 7, independent unconditional: 4, 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: 12, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 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] ], Cache Queries: [ total: 36, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 68, Positive conditional cache size: 15, Positive unconditional cache size: 53, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 15, independent unconditional: 10, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 25, independent conditional: 10, independent unconditional: 15, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 10, independent unconditional: 15, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 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] ], Cache Queries: [ total: 39, independent: 24, independent conditional: 9, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 69, Positive conditional cache size: 16, Positive unconditional cache size: 53, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 43 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 50, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 82, Positive conditional cache size: 21, Positive unconditional cache size: 61, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 36 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 26, independent unconditional: 0, 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: 26, independent: 26, independent conditional: 26, independent unconditional: 0, 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: 26, independent: 26, independent conditional: 26, independent unconditional: 0, 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: 6, 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: 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: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 104, Positive conditional cache size: 27, Positive unconditional cache size: 77, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=9, t2213={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t2214; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=10, t2213={7:0}, t2214={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t2215; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 1 __unbuffered_p0_EBX = x [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=11, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 3 __unbuffered_p2_EAX = x [L806] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L840] RET 2 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 2 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 2 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 2 \read(y) [L842] EXPR 2 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 2 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 2 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 2 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 2 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 2 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 2 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 2 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 2 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 2 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 2 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 4 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: 17.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 1 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=9, InterpolantAutomatonStates: 39, 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.6s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:41:20,332 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...