/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/safe015_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:01:51,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:01:51,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:01:51,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:01:51,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:01:51,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:01:51,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:01:51,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:01:51,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:01:51,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:01:51,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:01:51,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:01:51,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:01:51,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:01:51,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:01:51,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:01:51,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:01:51,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:01:51,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:01:51,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:01:51,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:01:51,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:01:51,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:01:51,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:01:51,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:01:51,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:01:51,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:01:51,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:01:51,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:01:51,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:01:51,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:01:51,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:01:51,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:01:51,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:01:51,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:01:51,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:01:51,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:01:51,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:01:51,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:01:51,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:01:51,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:01:51,700 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-13 12:01:51,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:01:51,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:01:51,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:01:51,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:01:51,740 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:01:51,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:01:51,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:01:51,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:01:51,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:01:51,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:01:51,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:01:51,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:01:51,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:01:51,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:01:51,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:01:51,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:01:51,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:01:51,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:01:51,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:01:51,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:01:51,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:01:51,744 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-13 12:01:52,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:01:52,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:01:52,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:01:52,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:01:52,074 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:01:52,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 12:01:53,241 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:01:53,512 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:01:53,513 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 12:01:53,544 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cbfcf09/3b981194cd1e42f88e45a48a780ed99c/FLAG20a9281fa [2022-12-13 12:01:53,557 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0cbfcf09/3b981194cd1e42f88e45a48a780ed99c [2022-12-13 12:01:53,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:01:53,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:01:53,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:53,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:01:53,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:01:53,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:53" (1/1) ... [2022-12-13 12:01:53,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46dd9ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:53, skipping insertion in model container [2022-12-13 12:01:53,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:01:53" (1/1) ... [2022-12-13 12:01:53,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:01:53,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:01:53,758 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/safe015_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 12:01:53,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:53,920 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:01:53,932 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/safe015_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 12:01:53,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:01:53,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:01:53,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:01:54,003 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:01:54,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54 WrapperNode [2022-12-13 12:01:54,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:01:54,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:54,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:01:54,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:01:54,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,044 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-13 12:01:54,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:01:54,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:01:54,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:01:54,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:01:54,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,080 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:01:54,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:01:54,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:01:54,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:01:54,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (1/1) ... [2022-12-13 12:01:54,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:01:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:01:54,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:01:54,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:01:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:01:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:01:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:01:54,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:01:54,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:01:54,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:01:54,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:01:54,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:01:54,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:01:54,151 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:01:54,233 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:01:54,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:01:54,362 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:01:54,366 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:01:54,367 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:01:54,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:54 BoogieIcfgContainer [2022-12-13 12:01:54,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:01:54,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:01:54,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:01:54,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:01:54,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:01:53" (1/3) ... [2022-12-13 12:01:54,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e35b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:01:54, skipping insertion in model container [2022-12-13 12:01:54,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:01:54" (2/3) ... [2022-12-13 12:01:54,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e35b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:01:54, skipping insertion in model container [2022-12-13 12:01:54,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:01:54" (3/3) ... [2022-12-13 12:01:54,386 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 12:01:54,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:01:54,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:01:54,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:01:54,505 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:01:54,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 183 flow [2022-12-13 12:01:54,618 INFO L130 PetriNetUnfolder]: 2/81 cut-off events. [2022-12-13 12:01:54,618 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:54,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 12:01:54,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 183 flow [2022-12-13 12:01:54,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 69 transitions, 147 flow [2022-12-13 12:01:54,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:54,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-13 12:01:54,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 147 flow [2022-12-13 12:01:54,724 INFO L130 PetriNetUnfolder]: 1/69 cut-off events. [2022-12-13 12:01:54,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:54,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 1/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 12:01:54,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 69 transitions, 147 flow [2022-12-13 12:01:54,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 12:01:57,290 INFO L241 LiptonReduction]: Total number of compositions: 52 [2022-12-13 12:01:57,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:01:57,338 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;@79aa0fc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:01:57,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:01:57,346 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 12:01:57,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:01:57,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:57,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:57,348 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-13 12:01:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1753090777, now seen corresponding path program 1 times [2022-12-13 12:01:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:57,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479617272] [2022-12-13 12:01:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479617272] [2022-12-13 12:01:58,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479617272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:58,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:58,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:01:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264638429] [2022-12-13 12:01:58,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:58,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:58,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 12:01:58,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:58,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:58,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 12:01:58,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:58,556 INFO L130 PetriNetUnfolder]: 1237/2076 cut-off events. [2022-12-13 12:01:58,556 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 12:01:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4088 conditions, 2076 events. 1237/2076 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11576 event pairs, 510 based on Foata normal form. 110/1762 useless extension candidates. Maximal degree in co-relation 4077. Up to 986 conditions per place. [2022-12-13 12:01:58,585 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 30 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-13 12:01:58,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 175 flow [2022-12-13 12:01:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 12:01:58,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2022-12-13 12:01:58,604 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 58 transitions. [2022-12-13 12:01:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 175 flow [2022-12-13 12:01:58,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:01:58,608 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 112 flow [2022-12-13 12:01:58,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2022-12-13 12:01:58,612 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-13 12:01:58,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:58,613 INFO L89 Accepts]: Start accepts. Operand has 37 places, 32 transitions, 112 flow [2022-12-13 12:01:58,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:58,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:58,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 112 flow [2022-12-13 12:01:58,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 112 flow [2022-12-13 12:01:58,663 INFO L130 PetriNetUnfolder]: 88/296 cut-off events. [2022-12-13 12:01:58,664 INFO L131 PetriNetUnfolder]: For 32/40 co-relation queries the response was YES. [2022-12-13 12:01:58,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 296 events. 88/296 cut-off events. For 32/40 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1876 event pairs, 34 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 544. Up to 87 conditions per place. [2022-12-13 12:01:58,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 112 flow [2022-12-13 12:01:58,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 12:01:58,688 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:58,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 12:01:58,690 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 112 flow [2022-12-13 12:01:58,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:58,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:58,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:58,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:01:58,690 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-13 12:01:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1488760456, now seen corresponding path program 1 times [2022-12-13 12:01:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240369455] [2022-12-13 12:01:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:58,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240369455] [2022-12-13 12:01:58,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240369455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:58,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:58,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608766184] [2022-12-13 12:01:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:58,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:58,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:58,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:58,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:58,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:58,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:59,150 INFO L130 PetriNetUnfolder]: 1174/1986 cut-off events. [2022-12-13 12:01:59,151 INFO L131 PetriNetUnfolder]: For 639/639 co-relation queries the response was YES. [2022-12-13 12:01:59,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4978 conditions, 1986 events. 1174/1986 cut-off events. For 639/639 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11023 event pairs, 129 based on Foata normal form. 9/1583 useless extension candidates. Maximal degree in co-relation 4966. Up to 869 conditions per place. [2022-12-13 12:01:59,162 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 42 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2022-12-13 12:01:59,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 288 flow [2022-12-13 12:01:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 12:01:59,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2022-12-13 12:01:59,163 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 112 flow. Second operand 4 states and 70 transitions. [2022-12-13 12:01:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 288 flow [2022-12-13 12:01:59,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:59,167 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 156 flow [2022-12-13 12:01:59,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-13 12:01:59,168 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 12:01:59,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:59,168 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 156 flow [2022-12-13 12:01:59,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:59,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:59,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 156 flow [2022-12-13 12:01:59,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 156 flow [2022-12-13 12:01:59,180 INFO L130 PetriNetUnfolder]: 65/239 cut-off events. [2022-12-13 12:01:59,180 INFO L131 PetriNetUnfolder]: For 91/121 co-relation queries the response was YES. [2022-12-13 12:01:59,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 239 events. 65/239 cut-off events. For 91/121 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1412 event pairs, 22 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 514. Up to 73 conditions per place. [2022-12-13 12:01:59,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 156 flow [2022-12-13 12:01:59,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 12:01:59,183 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:59,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 12:01:59,184 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 156 flow [2022-12-13 12:01:59,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:59,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:59,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:01:59,185 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-13 12:01:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1093053932, now seen corresponding path program 1 times [2022-12-13 12:01:59,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:59,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038210455] [2022-12-13 12:01:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:59,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:59,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038210455] [2022-12-13 12:01:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038210455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:59,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138181833] [2022-12-13 12:01:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:59,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:59,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 12:01:59,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:59,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 12:01:59,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:59,400 INFO L130 PetriNetUnfolder]: 1031/1765 cut-off events. [2022-12-13 12:01:59,400 INFO L131 PetriNetUnfolder]: For 1295/1295 co-relation queries the response was YES. [2022-12-13 12:01:59,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4836 conditions, 1765 events. 1031/1765 cut-off events. For 1295/1295 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9623 event pairs, 671 based on Foata normal form. 9/1387 useless extension candidates. Maximal degree in co-relation 4821. Up to 1351 conditions per place. [2022-12-13 12:01:59,410 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 36 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-12-13 12:01:59,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 288 flow [2022-12-13 12:01:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-13 12:01:59,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-13 12:01:59,411 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 156 flow. Second operand 3 states and 51 transitions. [2022-12-13 12:01:59,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 288 flow [2022-12-13 12:01:59,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:01:59,415 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 167 flow [2022-12-13 12:01:59,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-13 12:01:59,415 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-13 12:01:59,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:59,415 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 167 flow [2022-12-13 12:01:59,416 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:59,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:59,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 167 flow [2022-12-13 12:01:59,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 167 flow [2022-12-13 12:01:59,425 INFO L130 PetriNetUnfolder]: 48/179 cut-off events. [2022-12-13 12:01:59,425 INFO L131 PetriNetUnfolder]: For 113/153 co-relation queries the response was YES. [2022-12-13 12:01:59,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 179 events. 48/179 cut-off events. For 113/153 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 948 event pairs, 6 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 444. Up to 54 conditions per place. [2022-12-13 12:01:59,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 167 flow [2022-12-13 12:01:59,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 12:01:59,428 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:59,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:01:59,428 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 167 flow [2022-12-13 12:01:59,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:59,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:59,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:01:59,429 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-13 12:01:59,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1126948619, now seen corresponding path program 1 times [2022-12-13 12:01:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:59,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876198377] [2022-12-13 12:01:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:59,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876198377] [2022-12-13 12:01:59,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876198377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:59,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:59,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680529522] [2022-12-13 12:01:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:59,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:59,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:59,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:59,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:59,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:59,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:59,684 INFO L130 PetriNetUnfolder]: 1089/1852 cut-off events. [2022-12-13 12:01:59,684 INFO L131 PetriNetUnfolder]: For 1866/1866 co-relation queries the response was YES. [2022-12-13 12:01:59,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 1852 events. 1089/1852 cut-off events. For 1866/1866 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10198 event pairs, 167 based on Foata normal form. 6/1466 useless extension candidates. Maximal degree in co-relation 5299. Up to 848 conditions per place. [2022-12-13 12:01:59,694 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 44 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2022-12-13 12:01:59,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 425 flow [2022-12-13 12:01:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:01:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:01:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 12:01:59,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2022-12-13 12:01:59,695 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 167 flow. Second operand 4 states and 74 transitions. [2022-12-13 12:01:59,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 425 flow [2022-12-13 12:01:59,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:01:59,699 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 308 flow [2022-12-13 12:01:59,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2022-12-13 12:01:59,699 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 12:01:59,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:59,700 INFO L89 Accepts]: Start accepts. Operand has 47 places, 46 transitions, 308 flow [2022-12-13 12:01:59,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:59,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:59,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 46 transitions, 308 flow [2022-12-13 12:01:59,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 308 flow [2022-12-13 12:01:59,711 INFO L130 PetriNetUnfolder]: 44/169 cut-off events. [2022-12-13 12:01:59,711 INFO L131 PetriNetUnfolder]: For 261/349 co-relation queries the response was YES. [2022-12-13 12:01:59,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 169 events. 44/169 cut-off events. For 261/349 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 869 event pairs, 4 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 513. Up to 48 conditions per place. [2022-12-13 12:01:59,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 46 transitions, 308 flow [2022-12-13 12:01:59,713 INFO L226 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 12:01:59,714 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:59,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 12:01:59,715 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 308 flow [2022-12-13 12:01:59,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:59,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:59,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:01:59,715 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-13 12:01:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash -474693334, now seen corresponding path program 1 times [2022-12-13 12:01:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:59,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783065919] [2022-12-13 12:01:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:59,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783065919] [2022-12-13 12:01:59,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783065919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:59,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:59,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:01:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364174087] [2022-12-13 12:01:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:59,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:01:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:01:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:01:59,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2022-12-13 12:01:59,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:59,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2022-12-13 12:01:59,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:01:59,885 INFO L130 PetriNetUnfolder]: 826/1493 cut-off events. [2022-12-13 12:01:59,886 INFO L131 PetriNetUnfolder]: For 2712/2768 co-relation queries the response was YES. [2022-12-13 12:01:59,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1493 events. 826/1493 cut-off events. For 2712/2768 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8784 event pairs, 230 based on Foata normal form. 63/1201 useless extension candidates. Maximal degree in co-relation 4517. Up to 935 conditions per place. [2022-12-13 12:01:59,896 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 31 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2022-12-13 12:01:59,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 432 flow [2022-12-13 12:01:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:01:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:01:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 12:01:59,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:01:59,897 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 308 flow. Second operand 3 states and 52 transitions. [2022-12-13 12:01:59,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 432 flow [2022-12-13 12:01:59,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:01:59,902 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 328 flow [2022-12-13 12:01:59,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-13 12:01:59,903 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-13 12:01:59,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:01:59,903 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 328 flow [2022-12-13 12:01:59,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:01:59,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:01:59,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 328 flow [2022-12-13 12:01:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 328 flow [2022-12-13 12:01:59,912 INFO L130 PetriNetUnfolder]: 41/163 cut-off events. [2022-12-13 12:01:59,912 INFO L131 PetriNetUnfolder]: For 310/395 co-relation queries the response was YES. [2022-12-13 12:01:59,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 163 events. 41/163 cut-off events. For 310/395 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 817 event pairs, 3 based on Foata normal form. 2/118 useless extension candidates. Maximal degree in co-relation 514. Up to 46 conditions per place. [2022-12-13 12:01:59,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 328 flow [2022-12-13 12:01:59,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 12:01:59,915 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:01:59,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 12:01:59,915 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 328 flow [2022-12-13 12:01:59,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:01:59,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:01:59,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:01:59,916 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-13 12:01:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:01:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1197505512, now seen corresponding path program 1 times [2022-12-13 12:01:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:01:59,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839677595] [2022-12-13 12:01:59,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:01:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:01:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:01:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:01:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:01:59,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839677595] [2022-12-13 12:01:59,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839677595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:01:59,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:01:59,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:01:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672536992] [2022-12-13 12:01:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:01:59,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:01:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:01:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:01:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:01:59,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:01:59,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:01:59,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:01:59,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:01:59,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:00,221 INFO L130 PetriNetUnfolder]: 1866/3066 cut-off events. [2022-12-13 12:02:00,221 INFO L131 PetriNetUnfolder]: For 8181/8313 co-relation queries the response was YES. [2022-12-13 12:02:00,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9004 conditions, 3066 events. 1866/3066 cut-off events. For 8181/8313 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 19976 event pairs, 497 based on Foata normal form. 250/1968 useless extension candidates. Maximal degree in co-relation 8981. Up to 2134 conditions per place. [2022-12-13 12:02:00,241 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 75 selfloop transitions, 20 changer transitions 0/110 dead transitions. [2022-12-13 12:02:00,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 915 flow [2022-12-13 12:02:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:02:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:02:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 12:02:00,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7153846153846154 [2022-12-13 12:02:00,242 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 328 flow. Second operand 5 states and 93 transitions. [2022-12-13 12:02:00,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 915 flow [2022-12-13 12:02:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 881 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:00,249 INFO L231 Difference]: Finished difference. Result has 55 places, 65 transitions, 466 flow [2022-12-13 12:02:00,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=55, PETRI_TRANSITIONS=65} [2022-12-13 12:02:00,249 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 12:02:00,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:00,249 INFO L89 Accepts]: Start accepts. Operand has 55 places, 65 transitions, 466 flow [2022-12-13 12:02:00,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:00,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:00,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 65 transitions, 466 flow [2022-12-13 12:02:00,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 65 transitions, 466 flow [2022-12-13 12:02:00,348 INFO L130 PetriNetUnfolder]: 1168/2089 cut-off events. [2022-12-13 12:02:00,349 INFO L131 PetriNetUnfolder]: For 3536/4015 co-relation queries the response was YES. [2022-12-13 12:02:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6847 conditions, 2089 events. 1168/2089 cut-off events. For 3536/4015 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 15123 event pairs, 470 based on Foata normal form. 13/955 useless extension candidates. Maximal degree in co-relation 6824. Up to 1784 conditions per place. [2022-12-13 12:02:00,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 65 transitions, 466 flow [2022-12-13 12:02:00,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 886 [2022-12-13 12:02:00,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [236] L744-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_13|) (= |v_P1Thread1of1ForFork2_#res.base_13| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 12:02:00,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [189] L759-->L764: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:02:00,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [206] L759-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 12:02:00,508 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [177] L729-->L734: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:02:00,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [223] L759-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P2Thread1of1ForFork0_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 12:02:00,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [221] L729-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= |v_P0Thread1of1ForFork1_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 12:02:00,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [183] L744-->L749: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 12:02:00,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [240] L729-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_161 (+ v_~__unbuffered_cnt~0_162 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 12:02:00,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L783-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39| (mod v_~main$tmp_guard0~0_50 256)) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_177 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_47|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [231] L744-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 12:02:00,893 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:02:00,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 645 [2022-12-13 12:02:00,894 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 436 flow [2022-12-13 12:02:00,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:00,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:00,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:00,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:02:00,894 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-13 12:02:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1218788363, now seen corresponding path program 1 times [2022-12-13 12:02:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:00,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804636011] [2022-12-13 12:02:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:00,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:00,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804636011] [2022-12-13 12:02:00,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804636011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:00,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:00,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539354873] [2022-12-13 12:02:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:00,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:02:00,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:02:00,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:02:00,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 12:02:00,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:00,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:00,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 12:02:00,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:01,231 INFO L130 PetriNetUnfolder]: 1435/2602 cut-off events. [2022-12-13 12:02:01,231 INFO L131 PetriNetUnfolder]: For 8400/9032 co-relation queries the response was YES. [2022-12-13 12:02:01,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11259 conditions, 2602 events. 1435/2602 cut-off events. For 8400/9032 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 18572 event pairs, 96 based on Foata normal form. 215/1661 useless extension candidates. Maximal degree in co-relation 11233. Up to 1936 conditions per place. [2022-12-13 12:02:01,251 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 61 selfloop transitions, 32 changer transitions 12/120 dead transitions. [2022-12-13 12:02:01,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 1088 flow [2022-12-13 12:02:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:02:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:02:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-12-13 12:02:01,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:02:01,253 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 436 flow. Second operand 6 states and 116 transitions. [2022-12-13 12:02:01,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 1088 flow [2022-12-13 12:02:01,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 120 transitions, 1072 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:01,266 INFO L231 Difference]: Finished difference. Result has 61 places, 77 transitions, 661 flow [2022-12-13 12:02:01,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=61, PETRI_TRANSITIONS=77} [2022-12-13 12:02:01,267 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 12:02:01,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:01,267 INFO L89 Accepts]: Start accepts. Operand has 61 places, 77 transitions, 661 flow [2022-12-13 12:02:01,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:01,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:01,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 77 transitions, 661 flow [2022-12-13 12:02:01,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 77 transitions, 661 flow [2022-12-13 12:02:01,361 INFO L130 PetriNetUnfolder]: 676/1533 cut-off events. [2022-12-13 12:02:01,361 INFO L131 PetriNetUnfolder]: For 4520/5057 co-relation queries the response was YES. [2022-12-13 12:02:01,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7061 conditions, 1533 events. 676/1533 cut-off events. For 4520/5057 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 12604 event pairs, 84 based on Foata normal form. 4/749 useless extension candidates. Maximal degree in co-relation 7034. Up to 1342 conditions per place. [2022-12-13 12:02:01,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 77 transitions, 661 flow [2022-12-13 12:02:01,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 866 [2022-12-13 12:02:01,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:02:01,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 414 [2022-12-13 12:02:01,681 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 653 flow [2022-12-13 12:02:01,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:01,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:01,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:01,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:02:01,682 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-13 12:02:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1135873337, now seen corresponding path program 1 times [2022-12-13 12:02:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:01,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305112961] [2022-12-13 12:02:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305112961] [2022-12-13 12:02:01,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305112961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:01,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:01,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278303183] [2022-12-13 12:02:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:01,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:01,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:01,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:01,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2022-12-13 12:02:01,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 653 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:01,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:01,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2022-12-13 12:02:01,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:02,076 INFO L130 PetriNetUnfolder]: 1462/2749 cut-off events. [2022-12-13 12:02:02,077 INFO L131 PetriNetUnfolder]: For 12808/13153 co-relation queries the response was YES. [2022-12-13 12:02:02,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14230 conditions, 2749 events. 1462/2749 cut-off events. For 12808/13153 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 18950 event pairs, 255 based on Foata normal form. 134/2266 useless extension candidates. Maximal degree in co-relation 14200. Up to 1997 conditions per place. [2022-12-13 12:02:02,094 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 64 selfloop transitions, 22 changer transitions 35/133 dead transitions. [2022-12-13 12:02:02,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 133 transitions, 1356 flow [2022-12-13 12:02:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 12:02:02,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2022-12-13 12:02:02,096 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 653 flow. Second operand 4 states and 82 transitions. [2022-12-13 12:02:02,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 133 transitions, 1356 flow [2022-12-13 12:02:02,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 1144 flow, removed 72 selfloop flow, removed 3 redundant places. [2022-12-13 12:02:02,127 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 599 flow [2022-12-13 12:02:02,127 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-13 12:02:02,129 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2022-12-13 12:02:02,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:02,129 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 599 flow [2022-12-13 12:02:02,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:02,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:02,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 599 flow [2022-12-13 12:02:02,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 599 flow [2022-12-13 12:02:02,208 INFO L130 PetriNetUnfolder]: 828/1649 cut-off events. [2022-12-13 12:02:02,208 INFO L131 PetriNetUnfolder]: For 3865/4048 co-relation queries the response was YES. [2022-12-13 12:02:02,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6516 conditions, 1649 events. 828/1649 cut-off events. For 3865/4048 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 12314 event pairs, 138 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 6487. Up to 1129 conditions per place. [2022-12-13 12:02:02,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 66 transitions, 599 flow [2022-12-13 12:02:02,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 646 [2022-12-13 12:02:02,223 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:02,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 12:02:02,225 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 599 flow [2022-12-13 12:02:02,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:02,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:02,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:02,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:02:02,225 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-13 12:02:02,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1609772050, now seen corresponding path program 1 times [2022-12-13 12:02:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:02,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568483521] [2022-12-13 12:02:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:02,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568483521] [2022-12-13 12:02:02,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568483521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:02,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:02,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:02:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140862180] [2022-12-13 12:02:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:02,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:02:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:02,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:02:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:02:02,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:02:02,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 599 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:02,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:02,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:02:02,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:02,576 INFO L130 PetriNetUnfolder]: 1023/2025 cut-off events. [2022-12-13 12:02:02,577 INFO L131 PetriNetUnfolder]: For 7248/7531 co-relation queries the response was YES. [2022-12-13 12:02:02,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9584 conditions, 2025 events. 1023/2025 cut-off events. For 7248/7531 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 15097 event pairs, 15 based on Foata normal form. 133/1250 useless extension candidates. Maximal degree in co-relation 9552. Up to 1135 conditions per place. [2022-12-13 12:02:02,583 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 19 selfloop transitions, 28 changer transitions 44/101 dead transitions. [2022-12-13 12:02:02,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 1084 flow [2022-12-13 12:02:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:02:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:02:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-13 12:02:02,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5879120879120879 [2022-12-13 12:02:02,585 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 599 flow. Second operand 7 states and 107 transitions. [2022-12-13 12:02:02,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 1084 flow [2022-12-13 12:02:02,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 1038 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:02,600 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 485 flow [2022-12-13 12:02:02,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2022-12-13 12:02:02,601 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2022-12-13 12:02:02,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:02,601 INFO L89 Accepts]: Start accepts. Operand has 69 places, 52 transitions, 485 flow [2022-12-13 12:02:02,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:02,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:02,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 52 transitions, 485 flow [2022-12-13 12:02:02,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 52 transitions, 485 flow [2022-12-13 12:02:02,622 INFO L130 PetriNetUnfolder]: 166/393 cut-off events. [2022-12-13 12:02:02,623 INFO L131 PetriNetUnfolder]: For 1300/1500 co-relation queries the response was YES. [2022-12-13 12:02:02,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 393 events. 166/393 cut-off events. For 1300/1500 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2537 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 1920. Up to 271 conditions per place. [2022-12-13 12:02:02,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 52 transitions, 485 flow [2022-12-13 12:02:02,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-13 12:02:02,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:02:02,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 12:02:02,696 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 483 flow [2022-12-13 12:02:02,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:02,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:02,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:02,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:02:02,697 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-13 12:02:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash 824105399, now seen corresponding path program 1 times [2022-12-13 12:02:02,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:02,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060305143] [2022-12-13 12:02:02,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:02,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060305143] [2022-12-13 12:02:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060305143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:02,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:02,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065180455] [2022-12-13 12:02:02,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:02,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:02:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:02,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:02:02,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:02:02,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 12:02:02,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 483 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:02,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:02,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 12:02:02,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:02,875 INFO L130 PetriNetUnfolder]: 346/652 cut-off events. [2022-12-13 12:02:02,875 INFO L131 PetriNetUnfolder]: For 5060/5107 co-relation queries the response was YES. [2022-12-13 12:02:02,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 652 events. 346/652 cut-off events. For 5060/5107 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 3529 event pairs, 16 based on Foata normal form. 49/507 useless extension candidates. Maximal degree in co-relation 3849. Up to 474 conditions per place. [2022-12-13 12:02:02,879 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 34 selfloop transitions, 7 changer transitions 39/90 dead transitions. [2022-12-13 12:02:02,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 972 flow [2022-12-13 12:02:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:02:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:02:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 12:02:02,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.592 [2022-12-13 12:02:02,880 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 483 flow. Second operand 5 states and 74 transitions. [2022-12-13 12:02:02,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 972 flow [2022-12-13 12:02:02,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 716 flow, removed 38 selfloop flow, removed 15 redundant places. [2022-12-13 12:02:02,889 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 270 flow [2022-12-13 12:02:02,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-12-13 12:02:02,889 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-13 12:02:02,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:02,889 INFO L89 Accepts]: Start accepts. Operand has 56 places, 41 transitions, 270 flow [2022-12-13 12:02:02,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:02,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:02,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 270 flow [2022-12-13 12:02:02,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 270 flow [2022-12-13 12:02:02,898 INFO L130 PetriNetUnfolder]: 81/184 cut-off events. [2022-12-13 12:02:02,899 INFO L131 PetriNetUnfolder]: For 654/661 co-relation queries the response was YES. [2022-12-13 12:02:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 184 events. 81/184 cut-off events. For 654/661 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 834 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 615. Up to 109 conditions per place. [2022-12-13 12:02:02,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 41 transitions, 270 flow [2022-12-13 12:02:02,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 12:02:03,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [232] $Ultimate##0-->L741: Formula: (and (= v_~x~0_51 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [264] $Ultimate##0-->L759: Formula: (and (= v_~x~0_89 v_~__unbuffered_p2_EAX~0_70) (= |v_P2Thread1of1ForFork0_#in~arg.base_13| v_P2Thread1of1ForFork0_~arg.base_13) (= |v_P2Thread1of1ForFork0_#in~arg.offset_13| v_P2Thread1of1ForFork0_~arg.offset_13) (= v_~y~0_70 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, ~x~0=v_~x~0_89, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_13, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ~y~0=v_~y~0_70, ~x~0=v_~x~0_89, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 12:02:03,389 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 12:02:03,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 501 [2022-12-13 12:02:03,390 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 437 flow [2022-12-13 12:02:03,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:03,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:03,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:02:03,391 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-13 12:02:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash -449212430, now seen corresponding path program 1 times [2022-12-13 12:02:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:03,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501480616] [2022-12-13 12:02:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:03,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501480616] [2022-12-13 12:02:03,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501480616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:03,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:03,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732847746] [2022-12-13 12:02:03,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:03,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:03,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 12:02:03,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:03,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:03,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 12:02:03,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:03,491 INFO L130 PetriNetUnfolder]: 81/156 cut-off events. [2022-12-13 12:02:03,492 INFO L131 PetriNetUnfolder]: For 668/668 co-relation queries the response was YES. [2022-12-13 12:02:03,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 156 events. 81/156 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 582 event pairs, 0 based on Foata normal form. 27/117 useless extension candidates. Maximal degree in co-relation 861. Up to 119 conditions per place. [2022-12-13 12:02:03,492 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 0 selfloop transitions, 0 changer transitions 36/36 dead transitions. [2022-12-13 12:02:03,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 36 transitions, 483 flow [2022-12-13 12:02:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 12:02:03,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 12:02:03,494 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 437 flow. Second operand 4 states and 40 transitions. [2022-12-13 12:02:03,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 36 transitions, 483 flow [2022-12-13 12:02:03,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 215 flow, removed 36 selfloop flow, removed 19 redundant places. [2022-12-13 12:02:03,496 INFO L231 Difference]: Finished difference. Result has 33 places, 0 transitions, 0 flow [2022-12-13 12:02:03,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=33, PETRI_TRANSITIONS=0} [2022-12-13 12:02:03,496 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-13 12:02:03,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:03,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 0 transitions, 0 flow [2022-12-13 12:02:03,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:02:03,497 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:02:03,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:03,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 12:02:03,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:02:03,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:02:03,497 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:03,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 12:02:03,498 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:02:03,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:03,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 12:02:03,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 12:02:03,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 12:02:03,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 12:02:03,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:02:03,501 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:03,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:02:03,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:02:03,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:02:03 BasicIcfg [2022-12-13 12:02:03,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:02:03,510 INFO L158 Benchmark]: Toolchain (without parser) took 9949.85ms. Allocated memory was 190.8MB in the beginning and 414.2MB in the end (delta: 223.3MB). Free memory was 166.0MB in the beginning and 170.0MB in the end (delta: -4.0MB). Peak memory consumption was 219.8MB. Max. memory is 8.0GB. [2022-12-13 12:02:03,510 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:02:03,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.96ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 142.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 12:02:03,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.02ms. Allocated memory is still 190.8MB. Free memory was 142.4MB in the beginning and 140.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:02:03,511 INFO L158 Benchmark]: Boogie Preprocessor took 37.51ms. Allocated memory is still 190.8MB. Free memory was 140.3MB in the beginning and 138.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:02:03,511 INFO L158 Benchmark]: RCFGBuilder took 285.50ms. Allocated memory is still 190.8MB. Free memory was 138.7MB in the beginning and 125.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 12:02:03,511 INFO L158 Benchmark]: TraceAbstraction took 9139.37ms. Allocated memory was 190.8MB in the beginning and 414.2MB in the end (delta: 223.3MB). Free memory was 124.6MB in the beginning and 170.0MB in the end (delta: -45.4MB). Peak memory consumption was 178.9MB. Max. memory is 8.0GB. [2022-12-13 12:02:03,512 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 190.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.96ms. Allocated memory is still 190.8MB. Free memory was 166.0MB in the beginning and 142.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.02ms. Allocated memory is still 190.8MB. Free memory was 142.4MB in the beginning and 140.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.51ms. Allocated memory is still 190.8MB. Free memory was 140.3MB in the beginning and 138.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.50ms. Allocated memory is still 190.8MB. Free memory was 138.7MB in the beginning and 125.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9139.37ms. Allocated memory was 190.8MB in the beginning and 414.2MB in the end (delta: 223.3MB). Free memory was 124.6MB in the beginning and 170.0MB in the end (delta: -45.4MB). Peak memory consumption was 178.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 78 PlacesBefore, 36 PlacesAfterwards, 69 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1021, independent: 968, independent conditional: 968, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1021, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1021, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1021, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 756, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 756, independent: 702, independent conditional: 0, independent unconditional: 702, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 187, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1021, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 756, unknown conditional: 0, unknown unconditional: 756] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1172, Positive conditional cache size: 0, Positive unconditional cache size: 1172, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 47 PlacesBefore, 47 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 55 PlacesBefore, 54 PlacesAfterwards, 65 TransitionsBefore, 58 TransitionsAfterwards, 886 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, independent: 333, independent conditional: 333, 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: 333, independent: 333, independent conditional: 333, 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: 333, independent: 333, independent conditional: 225, independent unconditional: 108, 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: 333, independent: 333, independent conditional: 225, independent unconditional: 108, 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: 47, independent: 47, independent conditional: 33, independent unconditional: 14, 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: 47, independent: 47, independent conditional: 0, independent unconditional: 47, 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: 333, independent: 286, independent conditional: 192, independent unconditional: 94, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 47, unknown conditional: 33, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 50, Positive conditional cache size: 33, Positive unconditional cache size: 17, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 108, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 61 PlacesBefore, 61 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 19, independent unconditional: 2, 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: 21, independent: 21, independent conditional: 19, independent unconditional: 2, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 21, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 54, Positive conditional cache size: 37, Positive unconditional cache size: 17, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 646 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 54, Positive conditional cache size: 37, Positive unconditional cache size: 17, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 67 PlacesBefore, 66 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 54, Positive conditional cache size: 37, Positive unconditional cache size: 17, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.5s, 54 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 37 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 130, independent conditional: 130, 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: 130, independent: 130, independent conditional: 130, 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: 130, independent: 130, independent conditional: 15, independent unconditional: 115, 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: 130, independent: 130, independent conditional: 15, independent unconditional: 115, 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: 19, independent: 19, independent conditional: 6, independent unconditional: 13, 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: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 130, independent: 111, independent conditional: 9, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 6, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 74, Positive conditional cache size: 43, Positive unconditional cache size: 31, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 115, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 74, Positive conditional cache size: 43, Positive unconditional cache size: 31, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 107 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: 9.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 665 IncrementalHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 19 mSDtfsCounter, 665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=661occurred in iteration=7, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 12:02:03,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...