/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:35:48,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:35:48,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:35:49,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:35:49,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:35:49,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:35:49,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:35:49,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:35:49,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:35:49,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:35:49,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:35:49,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:35:49,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:35:49,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:35:49,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:35:49,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:35:49,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:35:49,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:35:49,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:35:49,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:35:49,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:35:49,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:35:49,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:35:49,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:35:49,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:35:49,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:35:49,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:35:49,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:35:49,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:35:49,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:35:49,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:35:49,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:35:49,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:35:49,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:35:49,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:35:49,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:35:49,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:35:49,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:35:49,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:35:49,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:35:49,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:35:49,058 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:35:49,081 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:35:49,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:35:49,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:35:49,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:35:49,083 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:35:49,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:35:49,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:35:49,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:35:49,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:35:49,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:35:49,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:35:49,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:35:49,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:35:49,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:35:49,087 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 09:35:49,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:35:49,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:35:49,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:35:49,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:35:49,366 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:35:49,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:35:50,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:35:50,642 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:35:50,642 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:35:50,661 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2f344ab/dfa3f815b19e4a7ebf607c012204d7d8/FLAG62babb30e [2022-12-13 09:35:50,671 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2f344ab/dfa3f815b19e4a7ebf607c012204d7d8 [2022-12-13 09:35:50,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:35:50,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:35:50,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:35:50,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:35:50,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:35:50,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:35:50" (1/1) ... [2022-12-13 09:35:50,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239c078f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:50, skipping insertion in model container [2022-12-13 09:35:50,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:35:50" (1/1) ... [2022-12-13 09:35:50,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:35:50,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:35:50,863 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 09:35:51,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:35:51,026 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:35:51,036 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/safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-13 09:35:51,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:35:51,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:35:51,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:35:51,097 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:35:51,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51 WrapperNode [2022-12-13 09:35:51,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:35:51,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:35:51,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:35:51,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:35:51,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,141 INFO L138 Inliner]: procedures = 177, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2022-12-13 09:35:51,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:35:51,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:35:51,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:35:51,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:35:51,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,170 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:35:51,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:35:51,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:35:51,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:35:51,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (1/1) ... [2022-12-13 09:35:51,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:35:51,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:35:51,206 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 09:35:51,223 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 09:35:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:35:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:35:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:35:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:35:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:35:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:35:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:35:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:35:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:35:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:35:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:35:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:35:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:35:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:35:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:35:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:35:51,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:35:51,244 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 09:35:51,364 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:35:51,366 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:35:51,531 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:35:51,540 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:35:51,540 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:35:51,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:35:51 BoogieIcfgContainer [2022-12-13 09:35:51,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:35:51,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:35:51,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:35:51,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:35:51,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:35:50" (1/3) ... [2022-12-13 09:35:51,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481fa76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:35:51, skipping insertion in model container [2022-12-13 09:35:51,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:35:51" (2/3) ... [2022-12-13 09:35:51,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481fa76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:35:51, skipping insertion in model container [2022-12-13 09:35:51,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:35:51" (3/3) ... [2022-12-13 09:35:51,549 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:35:51,568 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:35:51,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:35:51,569 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:35:51,668 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:35:51,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 99 transitions, 218 flow [2022-12-13 09:35:51,786 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-12-13 09:35:51,787 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:35:51,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 09:35:51,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 99 transitions, 218 flow [2022-12-13 09:35:51,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 81 transitions, 174 flow [2022-12-13 09:35:51,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:51,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 81 transitions, 174 flow [2022-12-13 09:35:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 81 transitions, 174 flow [2022-12-13 09:35:51,865 INFO L130 PetriNetUnfolder]: 1/81 cut-off events. [2022-12-13 09:35:51,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:35:51,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 81 events. 1/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-13 09:35:51,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 81 transitions, 174 flow [2022-12-13 09:35:51,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 1542 [2022-12-13 09:35:54,004 INFO L241 LiptonReduction]: Total number of compositions: 61 [2022-12-13 09:35:54,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:35:54,020 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;@366c6b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:35:54,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:35:54,024 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 09:35:54,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:35:54,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:54,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:54,025 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 2 more)] === [2022-12-13 09:35:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 274327310, now seen corresponding path program 1 times [2022-12-13 09:35:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:54,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884980033] [2022-12-13 09:35:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:54,461 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 09:35:54,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:54,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884980033] [2022-12-13 09:35:54,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884980033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:54,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:54,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:35:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434729288] [2022-12-13 09:35:54,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:54,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:35:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:35:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:35:54,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:35:54,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 09:35:54,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:54,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:35:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:55,058 INFO L130 PetriNetUnfolder]: 5599/8282 cut-off events. [2022-12-13 09:35:55,058 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-13 09:35:55,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 8282 events. 5599/8282 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 47658 event pairs, 2229 based on Foata normal form. 244/6494 useless extension candidates. Maximal degree in co-relation 16450. Up to 5259 conditions per place. [2022-12-13 09:35:55,107 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 38 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-13 09:35:55,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 213 flow [2022-12-13 09:35:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:35:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 09:35:55,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2022-12-13 09:35:55,117 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 71 transitions. [2022-12-13 09:35:55,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 213 flow [2022-12-13 09:35:55,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:35:55,123 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2022-12-13 09:35:55,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2022-12-13 09:35:55,127 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-13 09:35:55,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:55,127 INFO L89 Accepts]: Start accepts. Operand has 44 places, 36 transitions, 108 flow [2022-12-13 09:35:55,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:55,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:55,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 108 flow [2022-12-13 09:35:55,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 108 flow [2022-12-13 09:35:55,188 INFO L130 PetriNetUnfolder]: 45/199 cut-off events. [2022-12-13 09:35:55,188 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 09:35:55,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 199 events. 45/199 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1203 event pairs, 27 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 309. Up to 78 conditions per place. [2022-12-13 09:35:55,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 108 flow [2022-12-13 09:35:55,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-13 09:35:55,252 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:55,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 09:35:55,253 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2022-12-13 09:35:55,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 09:35:55,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:55,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:35:55,254 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 2 more)] === [2022-12-13 09:35:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash -85788509, now seen corresponding path program 1 times [2022-12-13 09:35:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:55,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558000068] [2022-12-13 09:35:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:55,346 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 09:35:55,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:55,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558000068] [2022-12-13 09:35:55,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558000068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:55,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:35:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670300052] [2022-12-13 09:35:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:55,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:35:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:35:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:35:55,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:35:55,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 09:35:55,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:55,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:35:55,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:55,789 INFO L130 PetriNetUnfolder]: 5350/8039 cut-off events. [2022-12-13 09:35:55,789 INFO L131 PetriNetUnfolder]: For 1164/1164 co-relation queries the response was YES. [2022-12-13 09:35:55,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18495 conditions, 8039 events. 5350/8039 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 47097 event pairs, 637 based on Foata normal form. 76/6138 useless extension candidates. Maximal degree in co-relation 18484. Up to 4304 conditions per place. [2022-12-13 09:35:55,836 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 48 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2022-12-13 09:35:55,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 288 flow [2022-12-13 09:35:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:55,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 09:35:55,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 09:35:55,838 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 4 states and 85 transitions. [2022-12-13 09:35:55,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 288 flow [2022-12-13 09:35:55,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:35:55,853 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 137 flow [2022-12-13 09:35:55,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-13 09:35:55,854 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2022-12-13 09:35:55,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:55,854 INFO L89 Accepts]: Start accepts. Operand has 48 places, 38 transitions, 137 flow [2022-12-13 09:35:55,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:55,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:55,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 38 transitions, 137 flow [2022-12-13 09:35:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 137 flow [2022-12-13 09:35:55,863 INFO L130 PetriNetUnfolder]: 35/172 cut-off events. [2022-12-13 09:35:55,863 INFO L131 PetriNetUnfolder]: For 41/52 co-relation queries the response was YES. [2022-12-13 09:35:55,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 172 events. 35/172 cut-off events. For 41/52 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 994 event pairs, 19 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 315. Up to 63 conditions per place. [2022-12-13 09:35:55,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 38 transitions, 137 flow [2022-12-13 09:35:55,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 700 [2022-12-13 09:35:55,869 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:55,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 09:35:55,870 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 137 flow [2022-12-13 09:35:55,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 09:35:55,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:55,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:55,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:35:55,871 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 2 more)] === [2022-12-13 09:35:55,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash -85788819, now seen corresponding path program 1 times [2022-12-13 09:35:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:55,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272178863] [2022-12-13 09:35:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:56,025 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 09:35:56,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:56,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272178863] [2022-12-13 09:35:56,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272178863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:56,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:56,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:35:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370362101] [2022-12-13 09:35:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:35:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:35:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:35:56,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:35:56,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 09:35:56,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:56,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:35:56,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:56,475 INFO L130 PetriNetUnfolder]: 5079/7658 cut-off events. [2022-12-13 09:35:56,475 INFO L131 PetriNetUnfolder]: For 3320/3320 co-relation queries the response was YES. [2022-12-13 09:35:56,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18862 conditions, 7658 events. 5079/7658 cut-off events. For 3320/3320 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 44823 event pairs, 1335 based on Foata normal form. 52/5814 useless extension candidates. Maximal degree in co-relation 18848. Up to 4289 conditions per place. [2022-12-13 09:35:56,609 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 53 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2022-12-13 09:35:56,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 342 flow [2022-12-13 09:35:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 09:35:56,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 09:35:56,613 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 137 flow. Second operand 4 states and 88 transitions. [2022-12-13 09:35:56,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 342 flow [2022-12-13 09:35:56,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:35:56,619 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 173 flow [2022-12-13 09:35:56,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 09:35:56,620 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2022-12-13 09:35:56,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:56,620 INFO L89 Accepts]: Start accepts. Operand has 52 places, 40 transitions, 173 flow [2022-12-13 09:35:56,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:56,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:56,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 173 flow [2022-12-13 09:35:56,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 173 flow [2022-12-13 09:35:56,629 INFO L130 PetriNetUnfolder]: 28/151 cut-off events. [2022-12-13 09:35:56,629 INFO L131 PetriNetUnfolder]: For 87/104 co-relation queries the response was YES. [2022-12-13 09:35:56,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 151 events. 28/151 cut-off events. For 87/104 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 807 event pairs, 14 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 311. Up to 53 conditions per place. [2022-12-13 09:35:56,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 173 flow [2022-12-13 09:35:56,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-13 09:35:56,634 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:56,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 09:35:56,638 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 173 flow [2022-12-13 09:35:56,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 09:35:56,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:56,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:56,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:35:56,639 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 2 more)] === [2022-12-13 09:35:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1635522680, now seen corresponding path program 1 times [2022-12-13 09:35:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:56,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853314808] [2022-12-13 09:35:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:56,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 09:35:56,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:56,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853314808] [2022-12-13 09:35:56,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853314808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:56,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:56,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:35:56,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2980729] [2022-12-13 09:35:56,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:56,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:35:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:56,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:35:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:35:56,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:35:56,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:56,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:56,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:35:56,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:57,188 INFO L130 PetriNetUnfolder]: 4919/7468 cut-off events. [2022-12-13 09:35:57,188 INFO L131 PetriNetUnfolder]: For 6827/6827 co-relation queries the response was YES. [2022-12-13 09:35:57,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19379 conditions, 7468 events. 4919/7468 cut-off events. For 6827/6827 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43286 event pairs, 495 based on Foata normal form. 16/5636 useless extension candidates. Maximal degree in co-relation 19362. Up to 4027 conditions per place. [2022-12-13 09:35:57,228 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 47 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2022-12-13 09:35:57,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 372 flow [2022-12-13 09:35:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 09:35:57,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2022-12-13 09:35:57,232 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 173 flow. Second operand 4 states and 85 transitions. [2022-12-13 09:35:57,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 372 flow [2022-12-13 09:35:57,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:35:57,257 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 222 flow [2022-12-13 09:35:57,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 09:35:57,258 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2022-12-13 09:35:57,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:57,258 INFO L89 Accepts]: Start accepts. Operand has 55 places, 43 transitions, 222 flow [2022-12-13 09:35:57,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:57,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:57,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 43 transitions, 222 flow [2022-12-13 09:35:57,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 222 flow [2022-12-13 09:35:57,266 INFO L130 PetriNetUnfolder]: 22/123 cut-off events. [2022-12-13 09:35:57,266 INFO L131 PetriNetUnfolder]: For 105/117 co-relation queries the response was YES. [2022-12-13 09:35:57,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 123 events. 22/123 cut-off events. For 105/117 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 615 event pairs, 8 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 295. Up to 45 conditions per place. [2022-12-13 09:35:57,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 222 flow [2022-12-13 09:35:57,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 09:35:57,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:57,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 09:35:57,270 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 222 flow [2022-12-13 09:35:57,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:57,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:57,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:57,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:35:57,271 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 2 more)] === [2022-12-13 09:35:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -611006580, now seen corresponding path program 1 times [2022-12-13 09:35:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:57,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555981666] [2022-12-13 09:35:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:57,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:57,376 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 09:35:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:57,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555981666] [2022-12-13 09:35:57,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555981666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:57,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:57,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:35:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683977404] [2022-12-13 09:35:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:57,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:35:57,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:57,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:35:57,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:35:57,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:35:57,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 09:35:57,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:57,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:35:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:57,902 INFO L130 PetriNetUnfolder]: 7111/10860 cut-off events. [2022-12-13 09:35:57,903 INFO L131 PetriNetUnfolder]: For 12996/12996 co-relation queries the response was YES. [2022-12-13 09:35:57,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28513 conditions, 10860 events. 7111/10860 cut-off events. For 12996/12996 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 67784 event pairs, 1459 based on Foata normal form. 228/8276 useless extension candidates. Maximal degree in co-relation 28494. Up to 4560 conditions per place. [2022-12-13 09:35:58,029 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 51 selfloop transitions, 8 changer transitions 14/81 dead transitions. [2022-12-13 09:35:58,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 487 flow [2022-12-13 09:35:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:35:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:35:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 09:35:58,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 09:35:58,031 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 222 flow. Second operand 5 states and 105 transitions. [2022-12-13 09:35:58,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 487 flow [2022-12-13 09:35:58,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:35:58,075 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 205 flow [2022-12-13 09:35:58,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2022-12-13 09:35:58,076 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2022-12-13 09:35:58,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:58,076 INFO L89 Accepts]: Start accepts. Operand has 59 places, 40 transitions, 205 flow [2022-12-13 09:35:58,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:58,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:58,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 40 transitions, 205 flow [2022-12-13 09:35:58,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 40 transitions, 205 flow [2022-12-13 09:35:58,083 INFO L130 PetriNetUnfolder]: 13/93 cut-off events. [2022-12-13 09:35:58,083 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 09:35:58,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 93 events. 13/93 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 418 event pairs, 3 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 232. Up to 32 conditions per place. [2022-12-13 09:35:58,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 205 flow [2022-12-13 09:35:58,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-13 09:35:58,086 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:58,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 09:35:58,087 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 205 flow [2022-12-13 09:35:58,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 09:35:58,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:58,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:58,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:35:58,087 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 2 more)] === [2022-12-13 09:35:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash -382033787, now seen corresponding path program 1 times [2022-12-13 09:35:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:58,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148500120] [2022-12-13 09:35:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:58,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:58,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148500120] [2022-12-13 09:35:58,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148500120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:58,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:58,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:35:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693356043] [2022-12-13 09:35:58,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:58,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:35:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:58,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:35:58,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:35:58,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:35:58,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 09:35:58,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:58,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:35:58,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:58,602 INFO L130 PetriNetUnfolder]: 4716/7153 cut-off events. [2022-12-13 09:35:58,602 INFO L131 PetriNetUnfolder]: For 10310/10310 co-relation queries the response was YES. [2022-12-13 09:35:58,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18848 conditions, 7153 events. 4716/7153 cut-off events. For 10310/10310 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 42085 event pairs, 843 based on Foata normal form. 192/5308 useless extension candidates. Maximal degree in co-relation 18826. Up to 3779 conditions per place. [2022-12-13 09:35:58,648 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 43 selfloop transitions, 7 changer transitions 1/59 dead transitions. [2022-12-13 09:35:58,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 351 flow [2022-12-13 09:35:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 09:35:58,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 09:35:58,649 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 205 flow. Second operand 4 states and 80 transitions. [2022-12-13 09:35:58,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 351 flow [2022-12-13 09:35:58,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 319 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 09:35:58,681 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 185 flow [2022-12-13 09:35:58,681 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2022-12-13 09:35:58,683 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2022-12-13 09:35:58,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:58,683 INFO L89 Accepts]: Start accepts. Operand has 57 places, 39 transitions, 185 flow [2022-12-13 09:35:58,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:58,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:58,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 39 transitions, 185 flow [2022-12-13 09:35:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 39 transitions, 185 flow [2022-12-13 09:35:58,692 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2022-12-13 09:35:58,693 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 09:35:58,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 92 events. 7/92 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 415 event pairs, 3 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 196. Up to 26 conditions per place. [2022-12-13 09:35:58,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 39 transitions, 185 flow [2022-12-13 09:35:58,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 628 [2022-12-13 09:35:58,697 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:58,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 09:35:58,699 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 185 flow [2022-12-13 09:35:58,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 09:35:58,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:58,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:35:58,699 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 2 more)] === [2022-12-13 09:35:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash -838700026, now seen corresponding path program 2 times [2022-12-13 09:35:58,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:58,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644727531] [2022-12-13 09:35:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:58,796 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 09:35:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:58,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644727531] [2022-12-13 09:35:58,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644727531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:58,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:58,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:35:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966781906] [2022-12-13 09:35:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:58,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:35:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:35:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:35:58,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 09:35:58,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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 09:35:58,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:58,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 09:35:58,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:59,226 INFO L130 PetriNetUnfolder]: 5661/8823 cut-off events. [2022-12-13 09:35:59,227 INFO L131 PetriNetUnfolder]: For 9354/9374 co-relation queries the response was YES. [2022-12-13 09:35:59,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21123 conditions, 8823 events. 5661/8823 cut-off events. For 9354/9374 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 60254 event pairs, 1815 based on Foata normal form. 211/6298 useless extension candidates. Maximal degree in co-relation 21103. Up to 3856 conditions per place. [2022-12-13 09:35:59,264 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 48 selfloop transitions, 4 changer transitions 16/78 dead transitions. [2022-12-13 09:35:59,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 507 flow [2022-12-13 09:35:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 09:35:59,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.703125 [2022-12-13 09:35:59,265 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 185 flow. Second operand 4 states and 90 transitions. [2022-12-13 09:35:59,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 507 flow [2022-12-13 09:35:59,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 445 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 09:35:59,271 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 173 flow [2022-12-13 09:35:59,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2022-12-13 09:35:59,272 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2022-12-13 09:35:59,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:59,272 INFO L89 Accepts]: Start accepts. Operand has 58 places, 39 transitions, 173 flow [2022-12-13 09:35:59,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:59,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:59,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 39 transitions, 173 flow [2022-12-13 09:35:59,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 39 transitions, 173 flow [2022-12-13 09:35:59,277 INFO L130 PetriNetUnfolder]: 7/92 cut-off events. [2022-12-13 09:35:59,278 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 09:35:59,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 92 events. 7/92 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 401 event pairs, 3 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 192. Up to 26 conditions per place. [2022-12-13 09:35:59,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 39 transitions, 173 flow [2022-12-13 09:35:59,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-13 09:35:59,280 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:59,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 09:35:59,281 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 173 flow [2022-12-13 09:35:59,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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 09:35:59,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:59,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:59,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:35:59,281 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 2 more)] === [2022-12-13 09:35:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash -230917178, now seen corresponding path program 1 times [2022-12-13 09:35:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506782558] [2022-12-13 09:35:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:59,334 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 09:35:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:59,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506782558] [2022-12-13 09:35:59,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506782558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:59,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:59,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:35:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828496622] [2022-12-13 09:35:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:59,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:35:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:59,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:35:59,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:35:59,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:35:59,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 09:35:59,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:59,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:35:59,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:59,835 INFO L130 PetriNetUnfolder]: 8016/11323 cut-off events. [2022-12-13 09:35:59,835 INFO L131 PetriNetUnfolder]: For 12604/12630 co-relation queries the response was YES. [2022-12-13 09:35:59,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28282 conditions, 11323 events. 8016/11323 cut-off events. For 12604/12630 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 69347 event pairs, 4445 based on Foata normal form. 25/5280 useless extension candidates. Maximal degree in co-relation 28262. Up to 11032 conditions per place. [2022-12-13 09:35:59,881 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 43 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2022-12-13 09:35:59,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 383 flow [2022-12-13 09:35:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:35:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 09:35:59,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 09:35:59,882 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 173 flow. Second operand 3 states and 65 transitions. [2022-12-13 09:35:59,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 383 flow [2022-12-13 09:35:59,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 354 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 09:35:59,908 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 242 flow [2022-12-13 09:35:59,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-13 09:35:59,910 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-13 09:35:59,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:59,910 INFO L89 Accepts]: Start accepts. Operand has 56 places, 51 transitions, 242 flow [2022-12-13 09:35:59,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:59,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:59,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 51 transitions, 242 flow [2022-12-13 09:35:59,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 242 flow [2022-12-13 09:36:00,183 INFO L130 PetriNetUnfolder]: 5330/7915 cut-off events. [2022-12-13 09:36:00,183 INFO L131 PetriNetUnfolder]: For 1649/1754 co-relation queries the response was YES. [2022-12-13 09:36:00,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16809 conditions, 7915 events. 5330/7915 cut-off events. For 1649/1754 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 56220 event pairs, 3274 based on Foata normal form. 6/3189 useless extension candidates. Maximal degree in co-relation 16794. Up to 7468 conditions per place. [2022-12-13 09:36:00,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 51 transitions, 242 flow [2022-12-13 09:36:00,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 09:36:00,255 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:36:00,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-13 09:36:00,256 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 242 flow [2022-12-13 09:36:00,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 09:36:00,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:36:00,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:36:00,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:36:00,257 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 2 more)] === [2022-12-13 09:36:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:36:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1491816606, now seen corresponding path program 1 times [2022-12-13 09:36:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:36:00,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449047824] [2022-12-13 09:36:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:36:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:36:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:36:00,319 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 09:36:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:36:00,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449047824] [2022-12-13 09:36:00,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449047824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:36:00,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:36:00,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:36:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350216773] [2022-12-13 09:36:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:36:00,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:36:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:36:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:36:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:36:00,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:36:00,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:36:00,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:36:00,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:36:00,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:36:00,835 INFO L130 PetriNetUnfolder]: 6759/9742 cut-off events. [2022-12-13 09:36:00,836 INFO L131 PetriNetUnfolder]: For 5538/6845 co-relation queries the response was YES. [2022-12-13 09:36:00,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31412 conditions, 9742 events. 6759/9742 cut-off events. For 5538/6845 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 61184 event pairs, 1694 based on Foata normal form. 131/4673 useless extension candidates. Maximal degree in co-relation 31394. Up to 9289 conditions per place. [2022-12-13 09:36:00,880 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 51 selfloop transitions, 25 changer transitions 0/84 dead transitions. [2022-12-13 09:36:00,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 548 flow [2022-12-13 09:36:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:36:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:36:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 09:36:00,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2022-12-13 09:36:00,881 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 242 flow. Second operand 4 states and 89 transitions. [2022-12-13 09:36:00,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 548 flow [2022-12-13 09:36:00,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:36:00,895 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 377 flow [2022-12-13 09:36:00,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-13 09:36:00,895 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2022-12-13 09:36:00,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:36:00,895 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 377 flow [2022-12-13 09:36:00,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:36:00,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:36:00,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 377 flow [2022-12-13 09:36:00,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 377 flow [2022-12-13 09:36:01,201 INFO L130 PetriNetUnfolder]: 4361/6886 cut-off events. [2022-12-13 09:36:01,201 INFO L131 PetriNetUnfolder]: For 2672/10847 co-relation queries the response was YES. [2022-12-13 09:36:01,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21809 conditions, 6886 events. 4361/6886 cut-off events. For 2672/10847 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 50950 event pairs, 1387 based on Foata normal form. 5/2979 useless extension candidates. Maximal degree in co-relation 21792. Up to 6358 conditions per place. [2022-12-13 09:36:01,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 377 flow [2022-12-13 09:36:01,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-13 09:36:01,262 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:36:01,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-13 09:36:01,263 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 377 flow [2022-12-13 09:36:01,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:36:01,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:36:01,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:36:01,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:36:01,263 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 2 more)] === [2022-12-13 09:36:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:36:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -998348875, now seen corresponding path program 1 times [2022-12-13 09:36:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:36:01,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830547599] [2022-12-13 09:36:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:36:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:36:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:36:01,333 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 09:36:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:36:01,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830547599] [2022-12-13 09:36:01,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830547599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:36:01,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:36:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:36:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174668360] [2022-12-13 09:36:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:36:01,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:36:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:36:01,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:36:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:36:01,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:36:01,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:36:01,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:36:01,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:36:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:36:01,693 INFO L130 PetriNetUnfolder]: 4374/6700 cut-off events. [2022-12-13 09:36:01,693 INFO L131 PetriNetUnfolder]: For 4219/6708 co-relation queries the response was YES. [2022-12-13 09:36:01,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28021 conditions, 6700 events. 4374/6700 cut-off events. For 4219/6708 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 43821 event pairs, 362 based on Foata normal form. 368/3578 useless extension candidates. Maximal degree in co-relation 28001. Up to 5701 conditions per place. [2022-12-13 09:36:01,722 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 56 selfloop transitions, 37 changer transitions 0/101 dead transitions. [2022-12-13 09:36:01,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 766 flow [2022-12-13 09:36:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:36:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:36:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 09:36:01,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 09:36:01,724 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 377 flow. Second operand 5 states and 112 transitions. [2022-12-13 09:36:01,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 766 flow [2022-12-13 09:36:01,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 716 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 09:36:01,731 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 523 flow [2022-12-13 09:36:01,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2022-12-13 09:36:01,732 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2022-12-13 09:36:01,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:36:01,732 INFO L89 Accepts]: Start accepts. Operand has 62 places, 75 transitions, 523 flow [2022-12-13 09:36:01,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:36:01,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:36:01,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 75 transitions, 523 flow [2022-12-13 09:36:01,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 75 transitions, 523 flow [2022-12-13 09:36:01,925 INFO L130 PetriNetUnfolder]: 2759/4690 cut-off events. [2022-12-13 09:36:01,925 INFO L131 PetriNetUnfolder]: For 2717/11705 co-relation queries the response was YES. [2022-12-13 09:36:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19698 conditions, 4690 events. 2759/4690 cut-off events. For 2717/11705 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 35698 event pairs, 271 based on Foata normal form. 12/2059 useless extension candidates. Maximal degree in co-relation 19680. Up to 4321 conditions per place. [2022-12-13 09:36:01,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 75 transitions, 523 flow [2022-12-13 09:36:01,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 09:36:01,952 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:36:01,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-13 09:36:01,953 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 523 flow [2022-12-13 09:36:01,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:36:01,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:36:01,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:36:01,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:36:01,953 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 2 more)] === [2022-12-13 09:36:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:36:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash -307672070, now seen corresponding path program 1 times [2022-12-13 09:36:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:36:01,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196557999] [2022-12-13 09:36:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:36:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:36:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:36:02,024 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 09:36:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:36:02,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196557999] [2022-12-13 09:36:02,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196557999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:36:02,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:36:02,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:36:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498661391] [2022-12-13 09:36:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:36:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:36:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:36:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:36:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:36:02,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:36:02,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 09:36:02,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:36:02,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:36:02,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:36:02,461 INFO L130 PetriNetUnfolder]: 5365/8405 cut-off events. [2022-12-13 09:36:02,462 INFO L131 PetriNetUnfolder]: For 13335/15440 co-relation queries the response was YES. [2022-12-13 09:36:02,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40498 conditions, 8405 events. 5365/8405 cut-off events. For 13335/15440 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 56361 event pairs, 575 based on Foata normal form. 581/6665 useless extension candidates. Maximal degree in co-relation 40477. Up to 7053 conditions per place. [2022-12-13 09:36:02,496 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 84 selfloop transitions, 8 changer transitions 59/171 dead transitions. [2022-12-13 09:36:02,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1550 flow [2022-12-13 09:36:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:36:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:36:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-13 09:36:02,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2022-12-13 09:36:02,498 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 523 flow. Second operand 6 states and 115 transitions. [2022-12-13 09:36:02,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1550 flow [2022-12-13 09:36:02,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 171 transitions, 1272 flow, removed 68 selfloop flow, removed 3 redundant places. [2022-12-13 09:36:02,538 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 444 flow [2022-12-13 09:36:02,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2022-12-13 09:36:02,538 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2022-12-13 09:36:02,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:36:02,538 INFO L89 Accepts]: Start accepts. Operand has 65 places, 75 transitions, 444 flow [2022-12-13 09:36:02,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:36:02,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:36:02,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 75 transitions, 444 flow [2022-12-13 09:36:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 75 transitions, 444 flow [2022-12-13 09:36:02,751 INFO L130 PetriNetUnfolder]: 3514/5801 cut-off events. [2022-12-13 09:36:02,751 INFO L131 PetriNetUnfolder]: For 4886/7004 co-relation queries the response was YES. [2022-12-13 09:36:02,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20031 conditions, 5801 events. 3514/5801 cut-off events. For 4886/7004 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 44220 event pairs, 352 based on Foata normal form. 40/2451 useless extension candidates. Maximal degree in co-relation 20012. Up to 5023 conditions per place. [2022-12-13 09:36:02,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 75 transitions, 444 flow [2022-12-13 09:36:02,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-13 09:36:02,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:36:02,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-13 09:36:02,798 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 444 flow [2022-12-13 09:36:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 09:36:02,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:36:02,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:36:02,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:36:02,799 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:36:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:36:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash -725121462, now seen corresponding path program 1 times [2022-12-13 09:36:02,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:36:02,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214236348] [2022-12-13 09:36:02,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:36:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:36:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:36:02,871 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 09:36:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:36:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214236348] [2022-12-13 09:36:02,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214236348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:36:02,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:36:02,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:36:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000534241] [2022-12-13 09:36:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:36:02,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:36:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:36:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:36:02,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:36:02,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 09:36:02,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 09:36:02,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:36:02,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 09:36:02,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:36:03,161 INFO L130 PetriNetUnfolder]: 3374/5336 cut-off events. [2022-12-13 09:36:03,162 INFO L131 PetriNetUnfolder]: For 6333/8543 co-relation queries the response was YES. [2022-12-13 09:36:03,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21458 conditions, 5336 events. 3374/5336 cut-off events. For 6333/8543 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 35608 event pairs, 11 based on Foata normal form. 615/2940 useless extension candidates. Maximal degree in co-relation 21436. Up to 3619 conditions per place. [2022-12-13 09:36:03,178 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 25 selfloop transitions, 49 changer transitions 22/101 dead transitions. [2022-12-13 09:36:03,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 101 transitions, 782 flow [2022-12-13 09:36:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:36:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:36:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-12-13 09:36:03,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-13 09:36:03,180 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 444 flow. Second operand 6 states and 118 transitions. [2022-12-13 09:36:03,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 101 transitions, 782 flow [2022-12-13 09:36:03,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 731 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 09:36:03,211 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 494 flow [2022-12-13 09:36:03,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2022-12-13 09:36:03,212 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2022-12-13 09:36:03,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:36:03,212 INFO L89 Accepts]: Start accepts. Operand has 65 places, 67 transitions, 494 flow [2022-12-13 09:36:03,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:36:03,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:36:03,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 67 transitions, 494 flow [2022-12-13 09:36:03,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 67 transitions, 494 flow [2022-12-13 09:36:03,246 INFO L130 PetriNetUnfolder]: 513/947 cut-off events. [2022-12-13 09:36:03,247 INFO L131 PetriNetUnfolder]: For 834/1755 co-relation queries the response was YES. [2022-12-13 09:36:03,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 947 events. 513/947 cut-off events. For 834/1755 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 5656 event pairs, 0 based on Foata normal form. 1/387 useless extension candidates. Maximal degree in co-relation 4155. Up to 730 conditions per place. [2022-12-13 09:36:03,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 67 transitions, 494 flow [2022-12-13 09:36:03,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-13 09:36:03,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [298] $Ultimate##0-->L747: Formula: (and (= v_~__unbuffered_cnt~0_715 (+ v_~__unbuffered_cnt~0_716 1)) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|) (= v_~x~0_51 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_716} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_715, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:36:03,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [299] $Ultimate##0-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= v_~x~0_53 1) (= |v_P1Thread1of1ForFork1_#res.offset_99| 0) (= |v_P1Thread1of1ForFork1_#res.base_99| 0) (= v_~__unbuffered_cnt~0_719 (+ v_~__unbuffered_cnt~0_720 1))) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_720} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_99|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_719, ~x~0=v_~x~0_53, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_99|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:36:03,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] $Ultimate##0-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_21| v_P1Thread1of1ForFork1_~arg.offset_21) (= |v_P1Thread1of1ForFork1_#res.offset_101| 0) (= v_P1Thread1of1ForFork1_~arg.base_21 |v_P1Thread1of1ForFork1_#in~arg.base_21|) (= 0 |v_P1Thread1of1ForFork1_#res.base_101|) (= v_~x~0_55 1) (= v_~__unbuffered_cnt~0_723 (+ v_~__unbuffered_cnt~0_724 1))) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_724} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_101|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_723, ~x~0=v_~x~0_55, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_101|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:36:04,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [242] $Ultimate##0-->L742: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_5 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] and [243] $Ultimate##0-->L754: Formula: (and (= v_~__unbuffered_p2_EAX~0_4 v_~x~0_7) (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0] [2022-12-13 09:36:04,202 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 09:36:04,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-13 09:36:04,203 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 564 flow [2022-12-13 09:36:04,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 09:36:04,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:36:04,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:36:04,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:36:04,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:36:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:36:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2070677496, now seen corresponding path program 1 times [2022-12-13 09:36:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:36:04,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870026980] [2022-12-13 09:36:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:36:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:36:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:36:04,288 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 09:36:04,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:36:04,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870026980] [2022-12-13 09:36:04,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870026980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:36:04,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:36:04,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:36:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771479778] [2022-12-13 09:36:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:36:04,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:36:04,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:36:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:36:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:36:04,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 45 [2022-12-13 09:36:04,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 564 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 09:36:04,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:36:04,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 45 [2022-12-13 09:36:04,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:36:04,384 INFO L130 PetriNetUnfolder]: 587/913 cut-off events. [2022-12-13 09:36:04,384 INFO L131 PetriNetUnfolder]: For 1912/1918 co-relation queries the response was YES. [2022-12-13 09:36:04,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5003 conditions, 913 events. 587/913 cut-off events. For 1912/1918 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 4032 event pairs, 0 based on Foata normal form. 87/645 useless extension candidates. Maximal degree in co-relation 4992. Up to 661 conditions per place. [2022-12-13 09:36:04,387 INFO L137 encePairwiseOnDemand]: 19/45 looper letters, 0 selfloop transitions, 0 changer transitions 78/78 dead transitions. [2022-12-13 09:36:04,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 782 flow [2022-12-13 09:36:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:36:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:36:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 09:36:04,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3511111111111111 [2022-12-13 09:36:04,388 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 564 flow. Second operand 5 states and 79 transitions. [2022-12-13 09:36:04,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 782 flow [2022-12-13 09:36:04,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 467 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-12-13 09:36:04,396 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2022-12-13 09:36:04,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2022-12-13 09:36:04,397 INFO L295 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2022-12-13 09:36:04,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:36:04,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 0 transitions, 0 flow [2022-12-13 09:36:04,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:36:04,397 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:36:04,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:36:04,398 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 09:36:04,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:36:04,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:36:04,398 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:36:04,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 09:36:04,398 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:36:04,399 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 09:36:04,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:36:04,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 09:36:04,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:36:04,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:36:04,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 09:36:04,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:36:04,403 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:36:04,405 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:36:04,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:36:04,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:36:04 BasicIcfg [2022-12-13 09:36:04,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:36:04,407 INFO L158 Benchmark]: Toolchain (without parser) took 13732.46ms. Allocated memory was 255.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 232.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 280.0MB. Max. memory is 8.0GB. [2022-12-13 09:36:04,407 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 233.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:36:04,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.45ms. Allocated memory is still 255.9MB. Free memory was 231.7MB in the beginning and 208.1MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 09:36:04,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.58ms. Allocated memory is still 255.9MB. Free memory was 207.6MB in the beginning and 206.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:36:04,407 INFO L158 Benchmark]: Boogie Preprocessor took 34.29ms. Allocated memory is still 255.9MB. Free memory was 206.0MB in the beginning and 204.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:36:04,407 INFO L158 Benchmark]: RCFGBuilder took 365.83ms. Allocated memory is still 255.9MB. Free memory was 204.4MB in the beginning and 189.2MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 09:36:04,408 INFO L158 Benchmark]: TraceAbstraction took 12862.55ms. Allocated memory was 255.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 188.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 235.9MB. Max. memory is 8.0GB. [2022-12-13 09:36:04,408 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 255.9MB. Free memory is still 233.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.45ms. Allocated memory is still 255.9MB. Free memory was 231.7MB in the beginning and 208.1MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.58ms. Allocated memory is still 255.9MB. Free memory was 207.6MB in the beginning and 206.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.29ms. Allocated memory is still 255.9MB. Free memory was 206.0MB in the beginning and 204.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 365.83ms. Allocated memory is still 255.9MB. Free memory was 204.4MB in the beginning and 189.2MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12862.55ms. Allocated memory was 255.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 188.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 235.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 93 PlacesBefore, 45 PlacesAfterwards, 81 TransitionsBefore, 33 TransitionsAfterwards, 1542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 61 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1445, independent: 1390, independent conditional: 1390, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1231, independent: 1194, independent conditional: 0, independent unconditional: 1194, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1231, independent: 1194, independent conditional: 0, independent unconditional: 1194, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1231, independent: 1149, independent conditional: 0, independent unconditional: 1149, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 131, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1445, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 1231, unknown conditional: 1231, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1231, Positive cache size: 1194, Positive conditional cache size: 1194, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 140, independent conditional: 24, independent unconditional: 116, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 148, independent: 140, independent conditional: 24, independent unconditional: 116, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 148, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 10, dependent conditional: 1, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 148, unknown conditional: 148, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 140, Positive conditional cache size: 140, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 37, independent conditional: 31, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 37, independent conditional: 31, independent unconditional: 6, 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: 38, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 177, Positive conditional cache size: 177, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 11, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 11, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 82, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 194, Positive conditional cache size: 194, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 14, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 14, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 76, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 217, Positive conditional cache size: 217, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 226, Positive conditional cache size: 226, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 241, Positive conditional cache size: 241, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 261, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 261, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 261, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 261, Positive cache size: 251, Positive conditional cache size: 251, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 61 PlacesBefore, 57 PlacesAfterwards, 67 TransitionsBefore, 63 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 643, independent: 643, independent conditional: 643, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 129, independent conditional: 127, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 129, independent: 129, independent conditional: 127, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 129, independent: 129, independent conditional: 0, independent unconditional: 129, 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: 643, independent: 514, independent conditional: 514, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 129, unknown conditional: 129, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 380, Positive conditional cache size: 380, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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: 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: 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: 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): 390, Positive cache size: 380, Positive conditional cache size: 380, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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 9 procedures, 128 locations, 5 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: 12.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 18 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=12, InterpolantAutomatonStates: 57, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:36:04,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...