/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:19:47,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:19:47,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:19:47,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:19:47,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:19:47,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:19:47,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:19:47,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:19:47,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:19:47,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:19:47,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:19:47,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:19:47,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:19:47,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:19:47,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:19:47,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:19:47,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:19:47,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:19:47,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:19:47,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:19:47,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:19:47,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:19:47,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:19:47,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:19:47,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:19:47,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:19:47,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:19:47,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:19:47,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:19:47,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:19:47,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:19:47,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:19:47,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:19:47,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:19:47,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:19:47,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:19:47,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:19:47,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:19:47,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:19:47,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:19:47,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:19:47,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:19:47,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:19:47,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:19:47,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:19:47,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:19:47,206 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:19:47,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:19:47,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:19:47,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:19:47,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:19:47,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:19:47,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:19:47,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:19:47,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:19:47,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:19:47,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:19:47,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:19:47,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:19:47,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:19:47,481 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:19:47,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:19:48,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:19:48,711 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:19:48,711 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:19:48,727 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b11cf42/49869bfd038b4febb525e30c93c257f7/FLAG808b666df [2022-12-06 01:19:48,749 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b11cf42/49869bfd038b4febb525e30c93c257f7 [2022-12-06 01:19:48,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:19:48,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:19:48,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:19:48,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:19:48,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:19:48,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:19:48" (1/1) ... [2022-12-06 01:19:48,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4787053b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:48, skipping insertion in model container [2022-12-06 01:19:48,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:19:48" (1/1) ... [2022-12-06 01:19:48,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:19:48,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:19:48,942 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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:19:49,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:19:49,115 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:19:49,124 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/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:19:49,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:19:49,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:19:49,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:19:49,198 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:19:49,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49 WrapperNode [2022-12-06 01:19:49,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:19:49,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:19:49,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:19:49,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:19:49,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,248 INFO L138 Inliner]: procedures = 177, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-12-06 01:19:49,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:19:49,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:19:49,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:19:49,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:19:49,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:19:49,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:19:49,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:19:49,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:19:49,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (1/1) ... [2022-12-06 01:19:49,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:19:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:19:49,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:19:49,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:19:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:19:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:19:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:19:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:19:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:19:49,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:19:49,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:19:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:19:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:19:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:19:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:19:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:19:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:19:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:19:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:19:49,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:19:49,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:19:49,381 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:19:49,483 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:19:49,485 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:19:49,619 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:19:49,626 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:19:49,626 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:19:49,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:49 BoogieIcfgContainer [2022-12-06 01:19:49,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:19:49,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:19:49,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:19:49,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:19:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:19:48" (1/3) ... [2022-12-06 01:19:49,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2856228d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:19:49, skipping insertion in model container [2022-12-06 01:19:49,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:19:49" (2/3) ... [2022-12-06 01:19:49,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2856228d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:19:49, skipping insertion in model container [2022-12-06 01:19:49,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:19:49" (3/3) ... [2022-12-06 01:19:49,636 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:19:49,652 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:19:49,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:19:49,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:19:49,734 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:19:49,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 104 transitions, 228 flow [2022-12-06 01:19:49,830 INFO L130 PetriNetUnfolder]: 2/100 cut-off events. [2022-12-06 01:19:49,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:19:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-06 01:19:49,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 104 transitions, 228 flow [2022-12-06 01:19:49,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 86 transitions, 184 flow [2022-12-06 01:19:49,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:49,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 86 transitions, 184 flow [2022-12-06 01:19:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 86 transitions, 184 flow [2022-12-06 01:19:49,905 INFO L130 PetriNetUnfolder]: 1/86 cut-off events. [2022-12-06 01:19:49,906 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:19:49,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 1/86 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/85 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 01:19:49,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 86 transitions, 184 flow [2022-12-06 01:19:49,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-06 01:19:52,563 INFO L203 LiptonReduction]: Total number of compositions: 64 [2022-12-06 01:19:52,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:19:52,582 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;@2a30e05b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:19:52,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 01:19:52,587 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-06 01:19:52,587 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:19:52,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:52,588 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:52,588 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-06 01:19:52,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 359997830, now seen corresponding path program 1 times [2022-12-06 01:19:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:52,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56562736] [2022-12-06 01:19:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:52,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56562736] [2022-12-06 01:19:52,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56562736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:52,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:52,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:19:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500625265] [2022-12-06 01:19:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:19:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:19:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:19:52,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 01:19:52,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:52,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:52,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 01:19:52,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:53,103 INFO L130 PetriNetUnfolder]: 700/1137 cut-off events. [2022-12-06 01:19:53,103 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 01:19:53,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 1137 events. 700/1137 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5671 event pairs, 416 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 2232. Up to 1013 conditions per place. [2022-12-06 01:19:53,112 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 24 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2022-12-06 01:19:53,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 145 flow [2022-12-06 01:19:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-06 01:19:53,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-06 01:19:53,122 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 01:19:53,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:53,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 145 flow [2022-12-06 01:19:53,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 145 flow [2022-12-06 01:19:53,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 01:19:53,335 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 01:19:53,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 01:19:53,337 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 137 flow [2022-12-06 01:19:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:53,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:53,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:53,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:19:53,337 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-06 01:19:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1724969940, now seen corresponding path program 1 times [2022-12-06 01:19:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:53,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335547376] [2022-12-06 01:19:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:53,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335547376] [2022-12-06 01:19:53,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335547376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:53,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:53,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128994449] [2022-12-06 01:19:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:53,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:53,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:53,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 137 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:53,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:53,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:53,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:53,539 INFO L130 PetriNetUnfolder]: 597/892 cut-off events. [2022-12-06 01:19:53,539 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 01:19:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 892 events. 597/892 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3391 event pairs, 241 based on Foata normal form. 52/944 useless extension candidates. Maximal degree in co-relation 2748. Up to 884 conditions per place. [2022-12-06 01:19:53,544 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 36 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-06 01:19:53,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 261 flow [2022-12-06 01:19:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 01:19:53,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 01:19:53,547 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 01:19:53,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:53,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 39 transitions, 261 flow [2022-12-06 01:19:53,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 39 transitions, 261 flow [2022-12-06 01:19:53,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:53,588 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:53,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 01:19:53,589 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 39 transitions, 261 flow [2022-12-06 01:19:53,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:53,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:53,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:53,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:19:53,590 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-06 01:19:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1724970281, now seen corresponding path program 1 times [2022-12-06 01:19:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:53,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993478653] [2022-12-06 01:19:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:53,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:53,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993478653] [2022-12-06 01:19:53,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993478653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:53,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:53,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:53,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299847865] [2022-12-06 01:19:53,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:53,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:53,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 39 transitions, 261 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:53,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:53,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:53,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:53,819 INFO L130 PetriNetUnfolder]: 769/1192 cut-off events. [2022-12-06 01:19:53,819 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-06 01:19:53,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 1192 events. 769/1192 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5285 event pairs, 84 based on Foata normal form. 108/1300 useless extension candidates. Maximal degree in co-relation 4870. Up to 1184 conditions per place. [2022-12-06 01:19:53,826 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 64 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2022-12-06 01:19:53,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 683 flow [2022-12-06 01:19:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:19:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:19:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 01:19:53,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 01:19:53,830 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 01:19:53,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:53,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 79 transitions, 683 flow [2022-12-06 01:19:53,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 79 transitions, 683 flow [2022-12-06 01:19:53,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:53,837 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:53,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 01:19:53,838 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 79 transitions, 683 flow [2022-12-06 01:19:53,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:53,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:53,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:53,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:19:53,839 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-06 01:19:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1934470484, now seen corresponding path program 1 times [2022-12-06 01:19:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:53,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880701169] [2022-12-06 01:19:53,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880701169] [2022-12-06 01:19:53,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880701169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:53,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:53,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:53,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192889789] [2022-12-06 01:19:53,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:53,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:53,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:53,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:53,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 79 transitions, 683 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:53,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:53,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:53,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:54,026 INFO L130 PetriNetUnfolder]: 718/1127 cut-off events. [2022-12-06 01:19:54,027 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-06 01:19:54,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 1127 events. 718/1127 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5016 event pairs, 38 based on Foata normal form. 28/1155 useless extension candidates. Maximal degree in co-relation 5735. Up to 1119 conditions per place. [2022-12-06 01:19:54,033 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 103 selfloop transitions, 8 changer transitions 1/112 dead transitions. [2022-12-06 01:19:54,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 112 transitions, 1186 flow [2022-12-06 01:19:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 01:19:54,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:19:54,035 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 01:19:54,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:54,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 112 transitions, 1186 flow [2022-12-06 01:19:54,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 112 transitions, 1186 flow [2022-12-06 01:19:54,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:54,057 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:54,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 01:19:54,058 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 112 transitions, 1186 flow [2022-12-06 01:19:54,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:54,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:54,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:19:54,058 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-06 01:19:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1934470980, now seen corresponding path program 1 times [2022-12-06 01:19:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:54,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812678211] [2022-12-06 01:19:54,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:54,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:54,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812678211] [2022-12-06 01:19:54,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812678211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:54,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:19:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545397012] [2022-12-06 01:19:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:54,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:19:54,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:54,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:19:54,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:19:54,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:54,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 112 transitions, 1186 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:54,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:54,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:54,278 INFO L130 PetriNetUnfolder]: 676/1113 cut-off events. [2022-12-06 01:19:54,278 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 01:19:54,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 1113 events. 676/1113 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5323 event pairs, 18 based on Foata normal form. 72/1185 useless extension candidates. Maximal degree in co-relation 6792. Up to 1105 conditions per place. [2022-12-06 01:19:54,283 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 55 selfloop transitions, 7 changer transitions 62/124 dead transitions. [2022-12-06 01:19:54,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 124 transitions, 1563 flow [2022-12-06 01:19:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:19:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:19:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 01:19:54,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 01:19:54,285 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2022-12-06 01:19:54,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:54,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 124 transitions, 1563 flow [2022-12-06 01:19:54,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 124 transitions, 1563 flow [2022-12-06 01:19:54,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:54,335 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:54,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 01:19:54,336 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 124 transitions, 1563 flow [2022-12-06 01:19:54,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:54,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:54,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:19:54,337 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-06 01:19:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 162207239, now seen corresponding path program 1 times [2022-12-06 01:19:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186578635] [2022-12-06 01:19:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186578635] [2022-12-06 01:19:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186578635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:54,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:54,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:19:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134302837] [2022-12-06 01:19:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:54,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:19:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:19:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:19:54,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:54,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 124 transitions, 1563 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:54,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:54,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:54,563 INFO L130 PetriNetUnfolder]: 705/1200 cut-off events. [2022-12-06 01:19:54,564 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 01:19:54,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8555 conditions, 1200 events. 705/1200 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6202 event pairs, 15 based on Foata normal form. 24/1224 useless extension candidates. Maximal degree in co-relation 8528. Up to 1192 conditions per place. [2022-12-06 01:19:54,569 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 48 selfloop transitions, 3 changer transitions 153/204 dead transitions. [2022-12-06 01:19:54,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 204 transitions, 2979 flow [2022-12-06 01:19:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:19:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:19:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 01:19:54,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5125 [2022-12-06 01:19:54,572 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-06 01:19:54,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:54,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 204 transitions, 2979 flow [2022-12-06 01:19:54,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 204 transitions, 2979 flow [2022-12-06 01:19:54,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:54,584 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:54,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 01:19:54,584 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 204 transitions, 2979 flow [2022-12-06 01:19:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:54,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:19:54,585 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-06 01:19:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash 375777850, now seen corresponding path program 1 times [2022-12-06 01:19:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:54,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197514062] [2022-12-06 01:19:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197514062] [2022-12-06 01:19:54,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197514062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:54,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:54,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:19:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982087622] [2022-12-06 01:19:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:54,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:19:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:19:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:19:54,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:54,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 204 transitions, 2979 flow. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:54,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:54,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:54,834 INFO L130 PetriNetUnfolder]: 700/1193 cut-off events. [2022-12-06 01:19:54,835 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 01:19:54,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 1193 events. 700/1193 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5943 event pairs, 2 based on Foata normal form. 4/1197 useless extension candidates. Maximal degree in co-relation 9670. Up to 1185 conditions per place. [2022-12-06 01:19:54,839 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 49 selfloop transitions, 7 changer transitions 203/259 dead transitions. [2022-12-06 01:19:54,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 259 transitions, 4267 flow [2022-12-06 01:19:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:19:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:19:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 01:19:54,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 01:19:54,841 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2022-12-06 01:19:54,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:54,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 259 transitions, 4267 flow [2022-12-06 01:19:54,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 259 transitions, 4267 flow [2022-12-06 01:19:54,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:54,851 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:54,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 01:19:54,852 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 259 transitions, 4267 flow [2022-12-06 01:19:54,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:54,852 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:54,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:19:54,852 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-06 01:19:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1205099708, now seen corresponding path program 1 times [2022-12-06 01:19:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:54,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995563976] [2022-12-06 01:19:54,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:54,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:54,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995563976] [2022-12-06 01:19:54,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995563976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:54,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:54,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:19:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696833387] [2022-12-06 01:19:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:54,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:19:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:19:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:19:54,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:54,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 259 transitions, 4267 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:54,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:54,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:54,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:55,101 INFO L130 PetriNetUnfolder]: 741/1316 cut-off events. [2022-12-06 01:19:55,101 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 01:19:55,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12001 conditions, 1316 events. 741/1316 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7080 event pairs, 1 based on Foata normal form. 8/1324 useless extension candidates. Maximal degree in co-relation 11968. Up to 1308 conditions per place. [2022-12-06 01:19:55,110 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 40 selfloop transitions, 3 changer transitions 348/391 dead transitions. [2022-12-06 01:19:55,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 391 transitions, 7206 flow [2022-12-06 01:19:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:19:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:19:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 01:19:55,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-06 01:19:55,113 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2022-12-06 01:19:55,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:55,114 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 391 transitions, 7206 flow [2022-12-06 01:19:55,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 391 transitions, 7206 flow [2022-12-06 01:19:55,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:55,128 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:55,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 01:19:55,130 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 391 transitions, 7206 flow [2022-12-06 01:19:55,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:55,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:19:55,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:55,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:19:55,130 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-06 01:19:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:19:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash 345285872, now seen corresponding path program 1 times [2022-12-06 01:19:55,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:19:55,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273985645] [2022-12-06 01:19:55,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:19:55,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:19:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:19:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:19:55,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:19:55,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273985645] [2022-12-06 01:19:55,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273985645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:19:55,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:19:55,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:19:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702160815] [2022-12-06 01:19:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:19:55,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:19:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:19:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:19:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:19:55,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:19:55,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 391 transitions, 7206 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:55,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:19:55,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:19:55,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:19:55,438 INFO L130 PetriNetUnfolder]: 736/1359 cut-off events. [2022-12-06 01:19:55,438 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 01:19:55,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13748 conditions, 1359 events. 736/1359 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7705 event pairs, 0 based on Foata normal form. 4/1363 useless extension candidates. Maximal degree in co-relation 13712. Up to 1351 conditions per place. [2022-12-06 01:19:55,443 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 0 selfloop transitions, 0 changer transitions 514/514 dead transitions. [2022-12-06 01:19:55,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 514 transitions, 10448 flow [2022-12-06 01:19:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:19:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:19:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 01:19:55,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 01:19:55,445 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2022-12-06 01:19:55,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:19:55,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 514 transitions, 10448 flow [2022-12-06 01:19:55,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 514 transitions, 10448 flow [2022-12-06 01:19:55,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:19:55,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:19:55,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 01:19:55,461 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 514 transitions, 10448 flow [2022-12-06 01:19:55,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:19:55,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 01:19:55,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 01:19:55,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 01:19:55,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 01:19:55,464 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 01:19:55,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:19:55,465 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:19:55,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:19:55,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:19:55,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:19:55 BasicIcfg [2022-12-06 01:19:55,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:19:55,471 INFO L158 Benchmark]: Toolchain (without parser) took 6719.37ms. Allocated memory was 207.6MB in the beginning and 311.4MB in the end (delta: 103.8MB). Free memory was 173.2MB in the beginning and 143.3MB in the end (delta: 29.9MB). Peak memory consumption was 135.3MB. Max. memory is 8.0GB. [2022-12-06 01:19:55,472 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 184.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:19:55,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.83ms. Allocated memory is still 207.6MB. Free memory was 172.7MB in the beginning and 148.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 01:19:55,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.95ms. Allocated memory is still 207.6MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:19:55,472 INFO L158 Benchmark]: Boogie Preprocessor took 29.85ms. Allocated memory is still 207.6MB. Free memory was 146.5MB in the beginning and 144.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 01:19:55,472 INFO L158 Benchmark]: RCFGBuilder took 348.75ms. Allocated memory is still 207.6MB. Free memory was 144.9MB in the beginning and 130.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 01:19:55,472 INFO L158 Benchmark]: TraceAbstraction took 5840.78ms. Allocated memory was 207.6MB in the beginning and 311.4MB in the end (delta: 103.8MB). Free memory was 129.7MB in the beginning and 143.3MB in the end (delta: -13.6MB). Peak memory consumption was 91.3MB. Max. memory is 8.0GB. [2022-12-06 01:19:55,473 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.12ms. Allocated memory is still 207.6MB. Free memory is still 184.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.83ms. Allocated memory is still 207.6MB. Free memory was 172.7MB in the beginning and 148.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.95ms. Allocated memory is still 207.6MB. Free memory was 148.6MB in the beginning and 146.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.85ms. Allocated memory is still 207.6MB. Free memory was 146.5MB in the beginning and 144.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 348.75ms. Allocated memory is still 207.6MB. Free memory was 144.9MB in the beginning and 130.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5840.78ms. Allocated memory was 207.6MB in the beginning and 311.4MB in the end (delta: 103.8MB). Free memory was 129.7MB in the beginning and 143.3MB in the end (delta: -13.6MB). Peak memory consumption was 91.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 98 PlacesBefore, 35 PlacesAfterwards, 86 TransitionsBefore, 23 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 23 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 64 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 1204, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1044, independent: 1016, independent conditional: 0, independent unconditional: 1016, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1044, independent: 999, independent conditional: 0, independent unconditional: 999, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1247, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1044, unknown conditional: 0, unknown unconditional: 1044] , Statistics on independence cache: Total cache size (in pairs): 1541, Positive cache size: 1513, Positive conditional cache size: 0, Positive unconditional cache size: 1513, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 33 PlacesAfterwards, 33 TransitionsBefore, 29 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 259 TransitionsBefore, 259 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 391 TransitionsBefore, 391 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 514 TransitionsBefore, 514 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 135 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: 5.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10448occurred in iteration=9, InterpolantAutomatonStates: 33, 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, 0.9s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-06 01:19:55,511 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...