/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/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:39:29,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:39:29,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:39:29,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:39:29,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:39:29,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:39:29,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:39:29,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:39:29,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:39:29,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:39:29,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:39:29,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:39:29,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:39:29,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:39:29,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:39:29,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:39:29,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:39:29,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:39:29,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:39:29,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:39:29,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:39:29,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:39:29,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:39:29,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:39:29,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:39:29,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:39:29,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:39:29,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:39:29,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:39:29,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:39:29,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:39:29,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:39:29,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:39:29,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:39:29,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:39:29,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:39:29,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:39:29,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:39:29,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:39:29,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:39:29,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:39:29,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 04:39:29,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:39:29,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:39:29,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:39:29,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:39:29,732 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:39:29,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:39:29,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:39:29,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:39:29,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:39:29,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:39:29,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:39:29,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:39:29,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:39:29,735 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:39:29,735 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-13 04:39:29,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:39:29,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:39:29,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:39:29,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:39:29,985 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:39:29,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-13 04:39:30,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:39:31,138 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:39:31,138 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-13 04:39:31,148 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0300a7a/2af8b2507c5e4e8391efffb4f8ae8cc7/FLAGf2f59563a [2022-12-13 04:39:31,163 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0300a7a/2af8b2507c5e4e8391efffb4f8ae8cc7 [2022-12-13 04:39:31,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:39:31,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:39:31,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:39:31,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:39:31,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:39:31,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6a4e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31, skipping insertion in model container [2022-12-13 04:39:31,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:39:31,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:39:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,304 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-12-13 04:39:31,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:39:31,318 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:39:31,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:39:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:39:31,343 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-12-13 04:39:31,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:39:31,369 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:39:31,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31 WrapperNode [2022-12-13 04:39:31,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:39:31,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:39:31,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:39:31,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:39:31,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,423 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-12-13 04:39:31,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:39:31,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:39:31,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:39:31,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:39:31,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,445 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:39:31,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:39:31,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:39:31,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:39:31,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (1/1) ... [2022-12-13 04:39:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:39:31,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:39:31,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:39:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:39:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:39:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:39:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:39:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:39:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:39:31,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:39:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:39:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:39:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 04:39:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:39:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:39:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:39:31,529 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:39:31,618 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:39:31,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:39:32,016 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:39:32,208 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:39:32,208 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 04:39:32,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:39:32 BoogieIcfgContainer [2022-12-13 04:39:32,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:39:32,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:39:32,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:39:32,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:39:32,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:39:31" (1/3) ... [2022-12-13 04:39:32,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d9f7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:39:32, skipping insertion in model container [2022-12-13 04:39:32,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:39:31" (2/3) ... [2022-12-13 04:39:32,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d9f7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:39:32, skipping insertion in model container [2022-12-13 04:39:32,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:39:32" (3/3) ... [2022-12-13 04:39:32,219 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-12-13 04:39:32,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:39:32,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:39:32,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:39:32,302 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 04:39:32,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 303 transitions, 638 flow [2022-12-13 04:39:32,458 INFO L130 PetriNetUnfolder]: 25/299 cut-off events. [2022-12-13 04:39:32,459 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 04:39:32,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 299 events. 25/299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-13 04:39:32,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 303 transitions, 638 flow [2022-12-13 04:39:32,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 287 transitions, 598 flow [2022-12-13 04:39:32,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:32,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-13 04:39:32,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 287 transitions, 598 flow [2022-12-13 04:39:32,560 INFO L130 PetriNetUnfolder]: 25/287 cut-off events. [2022-12-13 04:39:32,561 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 04:39:32,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 287 events. 25/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 179 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-13 04:39:32,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-13 04:39:32,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 2544 [2022-12-13 04:39:42,568 INFO L241 LiptonReduction]: Total number of compositions: 246 [2022-12-13 04:39:42,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:39:42,586 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;@2248a326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:39:42,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 04:39:42,591 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-13 04:39:42,591 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 04:39:42,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:42,592 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:42,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash 13481392, now seen corresponding path program 1 times [2022-12-13 04:39:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:42,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487645357] [2022-12-13 04:39:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:42,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:43,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487645357] [2022-12-13 04:39:43,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487645357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:43,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:43,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 04:39:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254262159] [2022-12-13 04:39:43,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:43,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:39:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:43,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:39:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:39:43,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 04:39:43,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 106 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:43,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:43,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 04:39:43,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:43,407 INFO L130 PetriNetUnfolder]: 2346/3110 cut-off events. [2022-12-13 04:39:43,407 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 04:39:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 3110 events. 2346/3110 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11907 event pairs, 381 based on Foata normal form. 1/2317 useless extension candidates. Maximal degree in co-relation 5552. Up to 2810 conditions per place. [2022-12-13 04:39:43,422 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2022-12-13 04:39:43,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 301 flow [2022-12-13 04:39:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:39:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:39:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 04:39:43,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2022-12-13 04:39:43,433 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-13 04:39:43,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 64 transitions, 301 flow [2022-12-13 04:39:43,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 63 transitions, 294 flow [2022-12-13 04:39:43,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:43,452 INFO L89 Accepts]: Start accepts. Operand has 48 places, 63 transitions, 294 flow [2022-12-13 04:39:43,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:43,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:43,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 63 transitions, 294 flow [2022-12-13 04:39:43,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 63 transitions, 294 flow [2022-12-13 04:39:43,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:43,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:43,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-13 04:39:43,839 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 63 transitions, 294 flow [2022-12-13 04:39:43,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:43,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:43,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:43,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:39:43,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1846233153, now seen corresponding path program 1 times [2022-12-13 04:39:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:43,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701576394] [2022-12-13 04:39:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:43,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:43,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701576394] [2022-12-13 04:39:43,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701576394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:43,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:43,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:39:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808266342] [2022-12-13 04:39:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:43,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:39:43,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:43,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:39:43,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:39:43,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:39:43,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 63 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:43,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:43,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:39:43,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:44,476 INFO L130 PetriNetUnfolder]: 2945/4069 cut-off events. [2022-12-13 04:39:44,476 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2022-12-13 04:39:44,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12647 conditions, 4069 events. 2945/4069 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17725 event pairs, 447 based on Foata normal form. 208/3268 useless extension candidates. Maximal degree in co-relation 8223. Up to 3346 conditions per place. [2022-12-13 04:39:44,544 INFO L137 encePairwiseOnDemand]: 29/42 looper letters, 62 selfloop transitions, 2 changer transitions 83/147 dead transitions. [2022-12-13 04:39:44,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 147 transitions, 990 flow [2022-12-13 04:39:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:39:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:39:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 04:39:44,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-13 04:39:44,548 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-13 04:39:44,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 147 transitions, 990 flow [2022-12-13 04:39:44,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 64 transitions, 426 flow [2022-12-13 04:39:44,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:44,576 INFO L89 Accepts]: Start accepts. Operand has 50 places, 64 transitions, 426 flow [2022-12-13 04:39:44,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:44,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:44,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 64 transitions, 426 flow [2022-12-13 04:39:44,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 64 transitions, 426 flow [2022-12-13 04:39:44,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:46,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:46,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1819 [2022-12-13 04:39:46,396 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 63 transitions, 420 flow [2022-12-13 04:39:46,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:46,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:46,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:46,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:39:46,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash -557203363, now seen corresponding path program 1 times [2022-12-13 04:39:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382431019] [2022-12-13 04:39:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:46,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382431019] [2022-12-13 04:39:46,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382431019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:46,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:46,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:39:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017398086] [2022-12-13 04:39:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:46,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:39:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:46,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:39:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:39:46,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 04:39:46,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 63 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:46,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:46,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 04:39:46,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:46,956 INFO L130 PetriNetUnfolder]: 2595/3490 cut-off events. [2022-12-13 04:39:46,956 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 04:39:46,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14288 conditions, 3490 events. 2595/3490 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13363 event pairs, 321 based on Foata normal form. 0/2642 useless extension candidates. Maximal degree in co-relation 11706. Up to 3491 conditions per place. [2022-12-13 04:39:46,980 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 83 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2022-12-13 04:39:46,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:39:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:39:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 04:39:46,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2022-12-13 04:39:46,982 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2022-12-13 04:39:46,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:46,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:47,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:47,006 INFO L89 Accepts]: Start accepts. Operand has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:47,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:47,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:47,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:47,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:47,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:47,390 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:47,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-13 04:39:47,391 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 86 transitions, 751 flow [2022-12-13 04:39:47,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:47,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:47,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:47,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:39:47,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash 237914969, now seen corresponding path program 1 times [2022-12-13 04:39:47,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235031324] [2022-12-13 04:39:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:47,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235031324] [2022-12-13 04:39:47,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235031324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:47,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:47,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:39:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266124026] [2022-12-13 04:39:47,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:39:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:39:47,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:39:47,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:47,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 86 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:47,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:47,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:47,899 INFO L130 PetriNetUnfolder]: 2162/2951 cut-off events. [2022-12-13 04:39:47,899 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-13 04:39:47,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15041 conditions, 2951 events. 2162/2951 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11151 event pairs, 293 based on Foata normal form. 0/2299 useless extension candidates. Maximal degree in co-relation 12514. Up to 2952 conditions per place. [2022-12-13 04:39:47,911 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 95 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2022-12-13 04:39:47,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:39:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:39:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 04:39:47,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2022-12-13 04:39:47,915 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-13 04:39:47,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:47,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:47,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:47,933 INFO L89 Accepts]: Start accepts. Operand has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:47,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:47,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:47,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:47,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:47,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:48,957 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:39:48,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1025 [2022-12-13 04:39:48,958 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 97 transitions, 1042 flow [2022-12-13 04:39:48,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:48,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:48,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:48,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:39:48,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1158882052, now seen corresponding path program 1 times [2022-12-13 04:39:48,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:48,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7925926] [2022-12-13 04:39:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:49,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7925926] [2022-12-13 04:39:49,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7925926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:49,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:49,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:39:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336627026] [2022-12-13 04:39:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:39:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:39:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:39:49,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:49,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 97 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:49,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:49,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:49,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:49,411 INFO L130 PetriNetUnfolder]: 2380/3237 cut-off events. [2022-12-13 04:39:49,411 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-13 04:39:49,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19739 conditions, 3237 events. 2380/3237 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12482 event pairs, 221 based on Foata normal form. 104/2607 useless extension candidates. Maximal degree in co-relation 17883. Up to 3238 conditions per place. [2022-12-13 04:39:49,423 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 92 selfloop transitions, 2 changer transitions 7/101 dead transitions. [2022-12-13 04:39:49,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 1281 flow [2022-12-13 04:39:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:39:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:39:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 04:39:49,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2022-12-13 04:39:49,425 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2022-12-13 04:39:49,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 101 transitions, 1281 flow [2022-12-13 04:39:49,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 94 transitions, 1188 flow [2022-12-13 04:39:49,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:49,443 INFO L89 Accepts]: Start accepts. Operand has 55 places, 94 transitions, 1188 flow [2022-12-13 04:39:49,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:49,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:49,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 94 transitions, 1188 flow [2022-12-13 04:39:49,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 94 transitions, 1188 flow [2022-12-13 04:39:49,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:50,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:50,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1052 [2022-12-13 04:39:50,495 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 94 transitions, 1200 flow [2022-12-13 04:39:50,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:50,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:50,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:50,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:39:50,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash -222873217, now seen corresponding path program 1 times [2022-12-13 04:39:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:50,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992398565] [2022-12-13 04:39:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:50,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992398565] [2022-12-13 04:39:50,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992398565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:50,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:50,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:39:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589292320] [2022-12-13 04:39:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:50,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:39:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:50,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:39:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:39:50,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 04:39:50,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 94 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:50,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:50,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 04:39:50,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:51,322 INFO L130 PetriNetUnfolder]: 3887/5415 cut-off events. [2022-12-13 04:39:51,322 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-12-13 04:39:51,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38444 conditions, 5415 events. 3887/5415 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24529 event pairs, 261 based on Foata normal form. 160/4618 useless extension candidates. Maximal degree in co-relation 20054. Up to 5416 conditions per place. [2022-12-13 04:39:51,339 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 89 selfloop transitions, 3 changer transitions 115/207 dead transitions. [2022-12-13 04:39:51,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 207 transitions, 3036 flow [2022-12-13 04:39:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:39:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:39:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 04:39:51,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4217391304347826 [2022-12-13 04:39:51,342 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2022-12-13 04:39:51,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 207 transitions, 3036 flow [2022-12-13 04:39:51,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 92 transitions, 1348 flow [2022-12-13 04:39:51,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:51,374 INFO L89 Accepts]: Start accepts. Operand has 58 places, 92 transitions, 1348 flow [2022-12-13 04:39:51,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:51,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:51,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 92 transitions, 1348 flow [2022-12-13 04:39:51,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 92 transitions, 1348 flow [2022-12-13 04:39:51,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:51,722 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:51,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 349 [2022-12-13 04:39:51,723 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 91 transitions, 1334 flow [2022-12-13 04:39:51,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:51,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:51,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:51,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:39:51,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -434244893, now seen corresponding path program 1 times [2022-12-13 04:39:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:51,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340537342] [2022-12-13 04:39:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:51,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340537342] [2022-12-13 04:39:51,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340537342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:51,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:51,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:39:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386555352] [2022-12-13 04:39:51,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:51,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:39:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:51,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:39:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:39:51,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:51,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 91 transitions, 1334 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:51,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:51,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:51,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:52,293 INFO L130 PetriNetUnfolder]: 2387/3321 cut-off events. [2022-12-13 04:39:52,293 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 04:39:52,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26912 conditions, 3321 events. 2387/3321 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13121 event pairs, 165 based on Foata normal form. 76/2778 useless extension candidates. Maximal degree in co-relation 22885. Up to 3322 conditions per place. [2022-12-13 04:39:52,306 INFO L137 encePairwiseOnDemand]: 37/43 looper letters, 89 selfloop transitions, 3 changer transitions 51/143 dead transitions. [2022-12-13 04:39:52,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 143 transitions, 2390 flow [2022-12-13 04:39:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:39:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:39:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 04:39:52,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3581395348837209 [2022-12-13 04:39:52,307 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2022-12-13 04:39:52,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 143 transitions, 2390 flow [2022-12-13 04:39:52,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 92 transitions, 1532 flow [2022-12-13 04:39:52,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:52,326 INFO L89 Accepts]: Start accepts. Operand has 60 places, 92 transitions, 1532 flow [2022-12-13 04:39:52,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:52,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:52,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 92 transitions, 1532 flow [2022-12-13 04:39:52,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 92 transitions, 1532 flow [2022-12-13 04:39:52,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:52,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:52,660 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-13 04:39:52,660 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 91 transitions, 1516 flow [2022-12-13 04:39:52,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:52,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:52,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:52,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:39:52,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1321736077, now seen corresponding path program 1 times [2022-12-13 04:39:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:52,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904376123] [2022-12-13 04:39:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:52,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:52,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904376123] [2022-12-13 04:39:52,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904376123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:52,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:52,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:39:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275932986] [2022-12-13 04:39:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:52,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:39:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:39:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:39:52,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:52,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 91 transitions, 1516 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:52,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:52,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:52,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:53,194 INFO L130 PetriNetUnfolder]: 2389/3300 cut-off events. [2022-12-13 04:39:53,194 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 04:39:53,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30035 conditions, 3300 events. 2389/3300 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12917 event pairs, 126 based on Foata normal form. 56/2729 useless extension candidates. Maximal degree in co-relation 25716. Up to 3301 conditions per place. [2022-12-13 04:39:53,208 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 89 selfloop transitions, 3 changer transitions 37/129 dead transitions. [2022-12-13 04:39:53,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 2412 flow [2022-12-13 04:39:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:39:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:39:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 04:39:53,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28837209302325584 [2022-12-13 04:39:53,210 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-13 04:39:53,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 129 transitions, 2412 flow [2022-12-13 04:39:53,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 92 transitions, 1716 flow [2022-12-13 04:39:53,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:53,233 INFO L89 Accepts]: Start accepts. Operand has 62 places, 92 transitions, 1716 flow [2022-12-13 04:39:53,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:53,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:53,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 92 transitions, 1716 flow [2022-12-13 04:39:53,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 92 transitions, 1716 flow [2022-12-13 04:39:53,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:53,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:53,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-13 04:39:53,552 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 91 transitions, 1698 flow [2022-12-13 04:39:53,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:53,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:53,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:53,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:39:53,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 552124666, now seen corresponding path program 1 times [2022-12-13 04:39:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996876391] [2022-12-13 04:39:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:53,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996876391] [2022-12-13 04:39:53,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996876391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:53,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:53,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:39:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877077633] [2022-12-13 04:39:53,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:53,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:39:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:39:53,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:39:53,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:53,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 91 transitions, 1698 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:53,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:53,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:53,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:53,997 INFO L130 PetriNetUnfolder]: 1182/1595 cut-off events. [2022-12-13 04:39:53,997 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 04:39:53,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16020 conditions, 1595 events. 1182/1595 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4725 event pairs, 199 based on Foata normal form. 30/1235 useless extension candidates. Maximal degree in co-relation 15189. Up to 1596 conditions per place. [2022-12-13 04:39:54,009 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 64 selfloop transitions, 2 changer transitions 1/67 dead transitions. [2022-12-13 04:39:54,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 1364 flow [2022-12-13 04:39:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:39:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:39:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 04:39:54,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37209302325581395 [2022-12-13 04:39:54,011 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-13 04:39:54,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 67 transitions, 1364 flow [2022-12-13 04:39:54,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 66 transitions, 1344 flow [2022-12-13 04:39:54,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:54,031 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 1344 flow [2022-12-13 04:39:54,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:54,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:54,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 1344 flow [2022-12-13 04:39:54,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 66 transitions, 1344 flow [2022-12-13 04:39:54,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:54,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:54,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 04:39:54,039 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 1344 flow [2022-12-13 04:39:54,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:54,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:54,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:54,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:39:54,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 131338130, now seen corresponding path program 1 times [2022-12-13 04:39:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:54,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67727467] [2022-12-13 04:39:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67727467] [2022-12-13 04:39:54,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67727467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:54,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:54,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:39:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688745968] [2022-12-13 04:39:54,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:39:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:39:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:39:54,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:54,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 1344 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:54,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:54,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:54,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:54,698 INFO L130 PetriNetUnfolder]: 2508/3421 cut-off events. [2022-12-13 04:39:54,699 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-12-13 04:39:54,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37782 conditions, 3421 events. 2508/3421 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12351 event pairs, 287 based on Foata normal form. 36/2643 useless extension candidates. Maximal degree in co-relation 35348. Up to 3422 conditions per place. [2022-12-13 04:39:54,716 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 117 selfloop transitions, 17 changer transitions 0/134 dead transitions. [2022-12-13 04:39:54,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:39:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:39:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 04:39:54,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2022-12-13 04:39:54,717 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2022-12-13 04:39:54,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:54,743 INFO L89 Accepts]: Start accepts. Operand has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:54,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:54,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:54,748 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:39:54,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 04:39:54,749 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 134 transitions, 2996 flow [2022-12-13 04:39:54,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:54,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:54,749 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:54,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 04:39:54,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1016582752, now seen corresponding path program 1 times [2022-12-13 04:39:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:54,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83883033] [2022-12-13 04:39:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83883033] [2022-12-13 04:39:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83883033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:39:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264628893] [2022-12-13 04:39:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:39:54,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:39:54,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:39:54,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 04:39:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:55,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 04:39:55,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:39:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:39:55,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:39:55,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264628893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:55,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:39:55,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 04:39:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235672919] [2022-12-13 04:39:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:39:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:39:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:39:55,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:55,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 134 transitions, 2996 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:55,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:55,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:55,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:55,783 INFO L130 PetriNetUnfolder]: 2677/3735 cut-off events. [2022-12-13 04:39:55,783 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 04:39:55,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45004 conditions, 3735 events. 2677/3735 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13834 event pairs, 317 based on Foata normal form. 32/2914 useless extension candidates. Maximal degree in co-relation 38553. Up to 3736 conditions per place. [2022-12-13 04:39:55,803 INFO L137 encePairwiseOnDemand]: 32/43 looper letters, 133 selfloop transitions, 2 changer transitions 71/206 dead transitions. [2022-12-13 04:39:55,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 206 transitions, 5016 flow [2022-12-13 04:39:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:39:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:39:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-12-13 04:39:55,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3289036544850498 [2022-12-13 04:39:55,804 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2022-12-13 04:39:55,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 206 transitions, 5016 flow [2022-12-13 04:39:55,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 135 transitions, 3288 flow [2022-12-13 04:39:55,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:55,835 INFO L89 Accepts]: Start accepts. Operand has 68 places, 135 transitions, 3288 flow [2022-12-13 04:39:55,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:55,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:55,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 135 transitions, 3288 flow [2022-12-13 04:39:55,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 135 transitions, 3288 flow [2022-12-13 04:39:55,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:39:58,048 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:39:58,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2214 [2022-12-13 04:39:58,049 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 134 transitions, 3264 flow [2022-12-13 04:39:58,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:58,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:39:58,049 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:39:58,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 04:39:58,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 04:39:58,256 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:39:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:39:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1483800995, now seen corresponding path program 1 times [2022-12-13 04:39:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:39:58,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853258833] [2022-12-13 04:39:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:39:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:39:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:39:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:39:58,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:39:58,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853258833] [2022-12-13 04:39:58,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853258833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:39:58,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:39:58,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:39:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67113296] [2022-12-13 04:39:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:39:58,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:39:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:39:58,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:39:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:39:58,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:39:58,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 134 transitions, 3264 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:39:58,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:39:58,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:39:58,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:39:59,025 INFO L130 PetriNetUnfolder]: 2677/3711 cut-off events. [2022-12-13 04:39:59,025 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 04:39:59,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48412 conditions, 3711 events. 2677/3711 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13661 event pairs, 302 based on Foata normal form. 28/2877 useless extension candidates. Maximal degree in co-relation 41758. Up to 3712 conditions per place. [2022-12-13 04:39:59,050 INFO L137 encePairwiseOnDemand]: 37/43 looper letters, 133 selfloop transitions, 2 changer transitions 55/190 dead transitions. [2022-12-13 04:39:59,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 190 transitions, 5000 flow [2022-12-13 04:39:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:39:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:39:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 04:39:59,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.313953488372093 [2022-12-13 04:39:59,052 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2022-12-13 04:39:59,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 190 transitions, 5000 flow [2022-12-13 04:39:59,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 135 transitions, 3558 flow [2022-12-13 04:39:59,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:39:59,090 INFO L89 Accepts]: Start accepts. Operand has 69 places, 135 transitions, 3558 flow [2022-12-13 04:39:59,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:39:59,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:39:59,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 135 transitions, 3558 flow [2022-12-13 04:39:59,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 135 transitions, 3558 flow [2022-12-13 04:39:59,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:40:01,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:40:01,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2303 [2022-12-13 04:40:01,393 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 134 transitions, 3532 flow [2022-12-13 04:40:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:01,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:40:01,393 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:40:01,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 04:40:01,393 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:40:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:40:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1116799260, now seen corresponding path program 1 times [2022-12-13 04:40:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:40:01,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435797971] [2022-12-13 04:40:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:40:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:40:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:40:01,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435797971] [2022-12-13 04:40:01,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435797971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:40:01,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027698798] [2022-12-13 04:40:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:40:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:40:01,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:40:01,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 04:40:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:01,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 04:40:01,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:40:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 04:40:01,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:40:01,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027698798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:40:01,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:40:01,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-13 04:40:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139302558] [2022-12-13 04:40:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:40:01,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:40:01,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:40:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:40:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:40:01,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:40:01,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 134 transitions, 3532 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:01,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:40:01,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:40:01,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:40:02,849 INFO L130 PetriNetUnfolder]: 4351/6187 cut-off events. [2022-12-13 04:40:02,849 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-12-13 04:40:02,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86882 conditions, 6187 events. 4351/6187 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 27120 event pairs, 365 based on Foata normal form. 480/5296 useless extension candidates. Maximal degree in co-relation 44963. Up to 6188 conditions per place. [2022-12-13 04:40:02,874 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 132 selfloop transitions, 3 changer transitions 227/362 dead transitions. [2022-12-13 04:40:02,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 362 transitions, 10262 flow [2022-12-13 04:40:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:40:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:40:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-13 04:40:02,876 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2022-12-13 04:40:02,876 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2022-12-13 04:40:02,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 362 transitions, 10262 flow [2022-12-13 04:40:02,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 135 transitions, 3828 flow [2022-12-13 04:40:02,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:40:02,926 INFO L89 Accepts]: Start accepts. Operand has 71 places, 135 transitions, 3828 flow [2022-12-13 04:40:02,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:40:02,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:40:02,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 135 transitions, 3828 flow [2022-12-13 04:40:02,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 135 transitions, 3828 flow [2022-12-13 04:40:02,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:40:03,348 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:40:03,349 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 423 [2022-12-13 04:40:03,349 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 134 transitions, 3800 flow [2022-12-13 04:40:03,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:03,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:40:03,349 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:40:03,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 04:40:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 04:40:03,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:40:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:40:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1319833857, now seen corresponding path program 1 times [2022-12-13 04:40:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:40:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981268641] [2022-12-13 04:40:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:40:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:40:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:40:04,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981268641] [2022-12-13 04:40:04,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981268641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:40:04,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:40:04,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:40:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257149056] [2022-12-13 04:40:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:40:04,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:40:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:40:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:40:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:40:04,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 04:40:04,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 134 transitions, 3800 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:04,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:40:04,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 04:40:04,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:40:05,331 INFO L130 PetriNetUnfolder]: 6327/8703 cut-off events. [2022-12-13 04:40:05,331 INFO L131 PetriNetUnfolder]: For 566/566 co-relation queries the response was YES. [2022-12-13 04:40:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130920 conditions, 8703 events. 6327/8703 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 38658 event pairs, 758 based on Foata normal form. 0/6727 useless extension candidates. Maximal degree in co-relation 77074. Up to 8704 conditions per place. [2022-12-13 04:40:05,387 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 319 selfloop transitions, 16 changer transitions 4/339 dead transitions. [2022-12-13 04:40:05,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 339 transitions, 10302 flow [2022-12-13 04:40:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:40:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:40:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-13 04:40:05,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-13 04:40:05,389 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2022-12-13 04:40:05,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 339 transitions, 10302 flow [2022-12-13 04:40:05,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 335 transitions, 10182 flow [2022-12-13 04:40:05,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:40:05,490 INFO L89 Accepts]: Start accepts. Operand has 78 places, 335 transitions, 10182 flow [2022-12-13 04:40:05,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:40:05,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:40:05,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 335 transitions, 10182 flow [2022-12-13 04:40:05,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 335 transitions, 10182 flow [2022-12-13 04:40:05,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:40:06,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:40:06,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1394 [2022-12-13 04:40:06,884 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 334 transitions, 10152 flow [2022-12-13 04:40:06,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:06,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:40:06,885 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:40:06,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 04:40:06,885 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:40:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:40:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash 628506860, now seen corresponding path program 1 times [2022-12-13 04:40:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:40:06,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040631292] [2022-12-13 04:40:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:40:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:40:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:40:07,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040631292] [2022-12-13 04:40:07,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040631292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:40:07,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:40:07,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:40:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458792370] [2022-12-13 04:40:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:40:07,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:40:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:40:07,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:40:07,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:40:07,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:40:07,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 334 transitions, 10152 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:07,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:40:07,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:40:07,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:40:09,941 INFO L130 PetriNetUnfolder]: 10917/15172 cut-off events. [2022-12-13 04:40:09,942 INFO L131 PetriNetUnfolder]: For 1130/1130 co-relation queries the response was YES. [2022-12-13 04:40:09,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243420 conditions, 15172 events. 10917/15172 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 75407 event pairs, 1356 based on Foata normal form. 0/11864 useless extension candidates. Maximal degree in co-relation 82216. Up to 15173 conditions per place. [2022-12-13 04:40:10,202 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 619 selfloop transitions, 16 changer transitions 18/653 dead transitions. [2022-12-13 04:40:10,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 653 transitions, 21160 flow [2022-12-13 04:40:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:40:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:40:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 04:40:10,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2022-12-13 04:40:10,204 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places. [2022-12-13 04:40:10,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 653 transitions, 21160 flow [2022-12-13 04:40:10,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 635 transitions, 20584 flow [2022-12-13 04:40:10,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:40:10,382 INFO L89 Accepts]: Start accepts. Operand has 82 places, 635 transitions, 20584 flow [2022-12-13 04:40:10,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:40:10,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:40:10,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 635 transitions, 20584 flow [2022-12-13 04:40:10,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 635 transitions, 20584 flow [2022-12-13 04:40:10,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:40:10,406 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:40:10,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 04:40:10,406 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 635 transitions, 20584 flow [2022-12-13 04:40:10,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:10,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:40:10,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:40:10,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 04:40:10,407 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 04:40:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:40:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849758, now seen corresponding path program 1 times [2022-12-13 04:40:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:40:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476631011] [2022-12-13 04:40:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:40:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:40:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:40:14,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476631011] [2022-12-13 04:40:14,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476631011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:40:14,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953153931] [2022-12-13 04:40:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:40:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:40:14,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:40:14,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 04:40:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:14,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 149 conjunts are in the unsatisfiable core [2022-12-13 04:40:15,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:40:15,048 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-12-13 04:40:15,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 43 [2022-12-13 04:40:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:40:15,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:40:15,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:40:15,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:40:15,100 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-13 04:40:15,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2022-12-13 04:40:15,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:40:15,198 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 04:40:15,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 04:40:15,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 04:40:15,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:40:15,362 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-12-13 04:40:15,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2022-12-13 04:40:15,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:40:15,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:40:15,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:40:15,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:40:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:40:17,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:41:00,364 WARN L233 SmtUtils]: Spent 16.28s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:41:17,564 WARN L233 SmtUtils]: Spent 14.14s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:41:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:41:17,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953153931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:41:17,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:41:17,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 53 [2022-12-13 04:41:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160106966] [2022-12-13 04:41:17,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:41:17,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-13 04:41:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:41:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 04:41:17,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=2521, Unknown=12, NotChecked=0, Total=2970 [2022-12-13 04:41:17,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 04:41:17,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 635 transitions, 20584 flow. Second operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:41:17,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:41:17,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 04:41:17,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:41:39,348 WARN L233 SmtUtils]: Spent 20.87s on a formula simplification. DAG size of input: 618 DAG size of output: 375 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:42:26,179 WARN L233 SmtUtils]: Spent 42.93s on a formula simplification. DAG size of input: 320 DAG size of output: 313 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:42:33,332 WARN L233 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 446 DAG size of output: 297 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:42:35,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:37,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:39,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:41,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:43,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:45,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:47,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:51,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:42:53,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:43:16,992 WARN L233 SmtUtils]: Spent 19.48s on a formula simplification. DAG size of input: 324 DAG size of output: 254 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:43:19,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:43:26,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:43:28,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:43:30,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:45:24,119 WARN L233 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 676 DAG size of output: 598 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:45:28,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:45:30,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:45:32,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:45:34,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:45:36,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 04:46:12,865 WARN L233 SmtUtils]: Spent 29.19s on a formula simplification. DAG size of input: 442 DAG size of output: 335 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 04:46:19,745 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 04:46:19,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-13 04:46:19,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 04:46:19,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:46:19,947 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:499) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 37 more [2022-12-13 04:46:19,950 INFO L158 Benchmark]: Toolchain (without parser) took 408784.96ms. Allocated memory was 212.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 188.5MB in the beginning and 743.5MB in the end (delta: -555.0MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 04:46:19,950 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 212.9MB. Free memory is still 189.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:46:19,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.94ms. Allocated memory is still 212.9MB. Free memory was 188.0MB in the beginning and 172.0MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 04:46:19,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.51ms. Allocated memory is still 212.9MB. Free memory was 172.0MB in the beginning and 168.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 04:46:19,951 INFO L158 Benchmark]: Boogie Preprocessor took 25.29ms. Allocated memory is still 212.9MB. Free memory was 168.8MB in the beginning and 166.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 04:46:19,951 INFO L158 Benchmark]: RCFGBuilder took 763.22ms. Allocated memory is still 212.9MB. Free memory was 166.2MB in the beginning and 95.9MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2022-12-13 04:46:19,951 INFO L158 Benchmark]: TraceAbstraction took 407735.62ms. Allocated memory was 212.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 94.9MB in the beginning and 743.5MB in the end (delta: -648.6MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-13 04:46:19,952 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.08ms. Allocated memory is still 212.9MB. Free memory is still 189.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.94ms. Allocated memory is still 212.9MB. Free memory was 188.0MB in the beginning and 172.0MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.51ms. Allocated memory is still 212.9MB. Free memory was 172.0MB in the beginning and 168.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.29ms. Allocated memory is still 212.9MB. Free memory was 168.8MB in the beginning and 166.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 763.22ms. Allocated memory is still 212.9MB. Free memory was 166.2MB in the beginning and 95.9MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 407735.62ms. Allocated memory was 212.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 94.9MB in the beginning and 743.5MB in the end (delta: -648.6MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 275 PlacesBefore, 46 PlacesAfterwards, 287 TransitionsBefore, 41 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 192 TrivialYvCompositions, 37 ConcurrentYvCompositions, 17 ChoiceCompositions, 246 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 1300, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1268, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1268, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1348, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1268, unknown conditional: 0, unknown unconditional: 1268] , Statistics on independence cache: Total cache size (in pairs): 1891, Positive cache size: 1871, Positive conditional cache size: 0, Positive unconditional cache size: 1871, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 48 PlacesBefore, 48 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 1.8s, 50 PlacesBefore, 49 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.4s, 51 PlacesBefore, 51 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 1.0s, 53 PlacesBefore, 53 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 1.0s, 55 PlacesBefore, 55 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.3s, 58 PlacesBefore, 57 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.3s, 60 PlacesBefore, 59 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.3s, 62 PlacesBefore, 61 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 63 PlacesBefore, 63 PlacesAfterwards, 66 TransitionsBefore, 66 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, 66 PlacesBefore, 66 PlacesAfterwards, 134 TransitionsBefore, 134 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: 2.2s, 68 PlacesBefore, 67 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 2.3s, 69 PlacesBefore, 68 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.4s, 71 PlacesBefore, 70 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 1.4s, 78 PlacesBefore, 77 PlacesAfterwards, 335 TransitionsBefore, 334 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 82 PlacesBefore, 82 PlacesAfterwards, 635 TransitionsBefore, 635 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 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...