/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-nonblocking-cntr-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:08:57,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:08:57,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:08:57,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:08:57,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:08:57,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:08:57,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:08:57,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:08:57,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:08:57,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:08:57,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:08:57,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:08:57,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:08:57,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:08:57,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:08:57,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:08:57,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:08:57,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:08:57,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:08:57,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:08:57,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:08:57,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:08:57,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:08:57,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:08:57,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:08:57,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:08:57,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:08:57,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:08:57,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:08:57,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:08:57,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:08:57,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:08:57,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:08:57,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:08:57,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:08:57,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:08:57,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:08:57,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:08:57,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:08:57,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:08:57,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:08:57,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 03:08:57,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:08:57,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:08:57,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:08:57,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:08:57,743 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:08:57,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:08:57,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:08:57,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:08:57,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:08:57,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:08:57,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:08:57,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:08:57,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:08:57,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:08:57,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:08:57,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:08:57,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:08:57,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:08:57,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:08:57,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:08:57,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:08:57,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:08:58,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:08:58,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:08:58,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:08:58,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:08:58,082 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:08:58,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-12-06 03:08:59,217 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:08:59,437 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:08:59,438 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-12-06 03:08:59,443 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e822545/e098859f1d11415d87eb70647954157d/FLAGf814d1ad4 [2022-12-06 03:08:59,462 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e822545/e098859f1d11415d87eb70647954157d [2022-12-06 03:08:59,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:08:59,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:08:59,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:08:59,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:08:59,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:08:59,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22959051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59, skipping insertion in model container [2022-12-06 03:08:59,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:08:59,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:08:59,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:08:59,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:08:59,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:08:59,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:08:59,627 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-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-12-06 03:08:59,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:08:59,636 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:08:59,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:08:59,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:08:59,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:08:59,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:08:59,662 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-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-12-06 03:08:59,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:08:59,676 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:08:59,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59 WrapperNode [2022-12-06 03:08:59,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:08:59,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:08:59,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:08:59,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:08:59,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,715 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-12-06 03:08:59,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:08:59,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:08:59,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:08:59,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:08:59,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:08:59,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:08:59,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:08:59,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:08:59,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (1/1) ... [2022-12-06 03:08:59,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:08:59,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:08:59,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:08:59,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:08:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:08:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:08:59,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:08:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:08:59,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:08:59,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:08:59,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:08:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:08:59,820 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:08:59,920 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:08:59,922 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:09:00,109 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:09:00,143 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:09:00,143 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 03:09:00,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:09:00 BoogieIcfgContainer [2022-12-06 03:09:00,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:09:00,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:09:00,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:09:00,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:09:00,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:08:59" (1/3) ... [2022-12-06 03:09:00,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9565c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:09:00, skipping insertion in model container [2022-12-06 03:09:00,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:08:59" (2/3) ... [2022-12-06 03:09:00,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9565c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:09:00, skipping insertion in model container [2022-12-06 03:09:00,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:09:00" (3/3) ... [2022-12-06 03:09:00,152 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2022-12-06 03:09:00,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:09:00,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:09:00,170 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:09:00,229 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:09:00,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 174 flow [2022-12-06 03:09:00,311 INFO L130 PetriNetUnfolder]: 6/77 cut-off events. [2022-12-06 03:09:00,311 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:09:00,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 77 events. 6/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 03:09:00,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 174 flow [2022-12-06 03:09:00,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 69 transitions, 150 flow [2022-12-06 03:09:00,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:00,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 150 flow [2022-12-06 03:09:00,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 69 transitions, 150 flow [2022-12-06 03:09:00,403 INFO L130 PetriNetUnfolder]: 6/69 cut-off events. [2022-12-06 03:09:00,403 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:09:00,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 69 events. 6/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 03:09:00,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 69 transitions, 150 flow [2022-12-06 03:09:00,406 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 03:09:02,659 INFO L203 LiptonReduction]: Total number of compositions: 54 [2022-12-06 03:09:02,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:09:02,679 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;@181b93e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:09:02,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:09:02,687 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 03:09:02,687 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:09:02,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:02,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:02,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:02,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1884038689, now seen corresponding path program 1 times [2022-12-06 03:09:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:02,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024755643] [2022-12-06 03:09:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:03,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:03,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024755643] [2022-12-06 03:09:03,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024755643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:09:03,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:09:03,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:09:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160903720] [2022-12-06 03:09:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:09:03,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:09:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:09:03,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:09:03,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 03:09:03,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:03,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:03,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 03:09:03,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:03,188 INFO L130 PetriNetUnfolder]: 59/100 cut-off events. [2022-12-06 03:09:03,188 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 03:09:03,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 100 events. 59/100 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 232 event pairs, 23 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 165. Up to 78 conditions per place. [2022-12-06 03:09:03,191 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 17 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-06 03:09:03,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 97 flow [2022-12-06 03:09:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:09:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:09:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 03:09:03,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 03:09:03,205 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-06 03:09:03,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:03,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 21 transitions, 97 flow [2022-12-06 03:09:03,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 21 transitions, 97 flow [2022-12-06 03:09:03,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 03:09:03,214 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:03,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 03:09:03,217 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 97 flow [2022-12-06 03:09:03,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:03,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:03,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:09:03,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:03,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash 533414282, now seen corresponding path program 1 times [2022-12-06 03:09:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:03,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933471492] [2022-12-06 03:09:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:03,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933471492] [2022-12-06 03:09:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933471492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:03,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556448787] [2022-12-06 03:09:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:03,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:03,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:03,366 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-06 03:09:03,405 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-06 03:09:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:03,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 03:09:03,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:03,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:03,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556448787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:03,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:03,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-06 03:09:03,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964007588] [2022-12-06 03:09:03,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:03,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:09:03,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:09:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:09:03,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 03:09:03,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:03,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:03,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 03:09:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:03,670 INFO L130 PetriNetUnfolder]: 73/133 cut-off events. [2022-12-06 03:09:03,671 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 03:09:03,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 133 events. 73/133 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 374 event pairs, 11 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 297. Up to 104 conditions per place. [2022-12-06 03:09:03,672 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 31 selfloop transitions, 6 changer transitions 9/47 dead transitions. [2022-12-06 03:09:03,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 47 transitions, 308 flow [2022-12-06 03:09:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:09:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:09:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 03:09:03,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 03:09:03,674 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-06 03:09:03,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:03,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 47 transitions, 308 flow [2022-12-06 03:09:03,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 47 transitions, 308 flow [2022-12-06 03:09:03,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 03:09:03,677 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:03,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 03:09:03,678 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 47 transitions, 308 flow [2022-12-06 03:09:03,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:03,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:03,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:03,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:03,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:03,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -577793868, now seen corresponding path program 1 times [2022-12-06 03:09:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424692011] [2022-12-06 03:09:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:04,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424692011] [2022-12-06 03:09:04,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424692011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:04,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999407] [2022-12-06 03:09:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:04,172 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-06 03:09:04,202 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-06 03:09:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:04,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:04,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:04,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999407] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:04,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:04,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 03:09:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055288463] [2022-12-06 03:09:04,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:04,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:09:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:09:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:09:04,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:04,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 47 transitions, 308 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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-06 03:09:04,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:04,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:05,251 INFO L130 PetriNetUnfolder]: 162/304 cut-off events. [2022-12-06 03:09:05,252 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-06 03:09:05,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 304 events. 162/304 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1148 event pairs, 0 based on Foata normal form. 3/245 useless extension candidates. Maximal degree in co-relation 1077. Up to 245 conditions per place. [2022-12-06 03:09:05,255 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 61 selfloop transitions, 28 changer transitions 56/145 dead transitions. [2022-12-06 03:09:05,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 145 transitions, 1245 flow [2022-12-06 03:09:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:09:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:09:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-12-06 03:09:05,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2022-12-06 03:09:05,263 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-06 03:09:05,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:05,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 145 transitions, 1245 flow [2022-12-06 03:09:05,270 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 145 transitions, 1245 flow [2022-12-06 03:09:05,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:05,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:05,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 03:09:05,273 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 145 transitions, 1245 flow [2022-12-06 03:09:05,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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-06 03:09:05,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:05,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:05,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:05,480 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,SelfDestructingSolverStorable2 [2022-12-06 03:09:05,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:05,483 INFO L85 PathProgramCache]: Analyzing trace with hash 862234576, now seen corresponding path program 2 times [2022-12-06 03:09:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345352610] [2022-12-06 03:09:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:05,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345352610] [2022-12-06 03:09:05,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345352610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:05,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060114947] [2022-12-06 03:09:05,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:09:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:05,684 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-06 03:09:05,713 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-06 03:09:05,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:09:05,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:05,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:05,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:05,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:06,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060114947] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:06,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:06,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 03:09:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922105116] [2022-12-06 03:09:06,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:06,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:09:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:06,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:09:06,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:09:06,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:06,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 145 transitions, 1245 flow. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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-06 03:09:06,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:06,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:06,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:06,747 INFO L130 PetriNetUnfolder]: 225/433 cut-off events. [2022-12-06 03:09:06,747 INFO L131 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2022-12-06 03:09:06,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 433 events. 225/433 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1895 event pairs, 4 based on Foata normal form. 2/339 useless extension candidates. Maximal degree in co-relation 1972. Up to 358 conditions per place. [2022-12-06 03:09:06,753 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 75 selfloop transitions, 31 changer transitions 108/214 dead transitions. [2022-12-06 03:09:06,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 214 transitions, 2276 flow [2022-12-06 03:09:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:09:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:09:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 131 transitions. [2022-12-06 03:09:06,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43666666666666665 [2022-12-06 03:09:06,758 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 42 predicate places. [2022-12-06 03:09:06,759 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:06,759 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 214 transitions, 2276 flow [2022-12-06 03:09:06,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 214 transitions, 2276 flow [2022-12-06 03:09:06,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:06,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:06,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 03:09:06,770 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 214 transitions, 2276 flow [2022-12-06 03:09:06,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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-06 03:09:06,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:06,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:06,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:06,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:06,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:06,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -310551560, now seen corresponding path program 3 times [2022-12-06 03:09:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:06,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38471812] [2022-12-06 03:09:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38471812] [2022-12-06 03:09:07,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38471812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519075487] [2022-12-06 03:09:07,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:09:07,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:07,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:07,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:09:07,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:09:07,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:07,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:07,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:07,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:07,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519075487] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:07,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:07,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 03:09:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198640328] [2022-12-06 03:09:07,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:07,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 03:09:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 03:09:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-06 03:09:07,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:07,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 214 transitions, 2276 flow. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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-06 03:09:07,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:07,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:07,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:08,245 INFO L130 PetriNetUnfolder]: 289/582 cut-off events. [2022-12-06 03:09:08,245 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-06 03:09:08,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3568 conditions, 582 events. 289/582 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2917 event pairs, 4 based on Foata normal form. 2/448 useless extension candidates. Maximal degree in co-relation 3205. Up to 507 conditions per place. [2022-12-06 03:09:08,249 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 101 selfloop transitions, 48 changer transitions 156/305 dead transitions. [2022-12-06 03:09:08,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 305 transitions, 3871 flow [2022-12-06 03:09:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:09:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:09:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 139 transitions. [2022-12-06 03:09:08,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2022-12-06 03:09:08,251 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 63 predicate places. [2022-12-06 03:09:08,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:08,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 305 transitions, 3871 flow [2022-12-06 03:09:08,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 305 transitions, 3871 flow [2022-12-06 03:09:08,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:08,279 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:08,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 03:09:08,281 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 305 transitions, 3871 flow [2022-12-06 03:09:08,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 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-06 03:09:08,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:08,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:08,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:08,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:08,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash -286219040, now seen corresponding path program 4 times [2022-12-06 03:09:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:08,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324896284] [2022-12-06 03:09:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324896284] [2022-12-06 03:09:08,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324896284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:08,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899865052] [2022-12-06 03:09:08,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:09:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:08,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:08,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:09:08,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:09:08,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:08,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:09:08,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:08,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899865052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:09,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:09,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 03:09:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618886171] [2022-12-06 03:09:09,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:09,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:09:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:09:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:09:09,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:09,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 305 transitions, 3871 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:09,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:09,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:09,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:09,959 INFO L130 PetriNetUnfolder]: 291/591 cut-off events. [2022-12-06 03:09:09,959 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 03:09:09,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4216 conditions, 591 events. 291/591 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2980 event pairs, 0 based on Foata normal form. 1/454 useless extension candidates. Maximal degree in co-relation 3790. Up to 516 conditions per place. [2022-12-06 03:09:09,963 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 118 selfloop transitions, 31 changer transitions 169/318 dead transitions. [2022-12-06 03:09:09,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 318 transitions, 4669 flow [2022-12-06 03:09:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 03:09:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 03:09:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-12-06 03:09:09,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45416666666666666 [2022-12-06 03:09:09,968 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 78 predicate places. [2022-12-06 03:09:09,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:09,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 318 transitions, 4669 flow [2022-12-06 03:09:09,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 318 transitions, 4669 flow [2022-12-06 03:09:09,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:09,977 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:09,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 03:09:09,978 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 318 transitions, 4669 flow [2022-12-06 03:09:09,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:09,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:09,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:09,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:10,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:10,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 518364968, now seen corresponding path program 5 times [2022-12-06 03:09:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:10,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756099290] [2022-12-06 03:09:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:10,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756099290] [2022-12-06 03:09:10,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756099290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:10,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964810313] [2022-12-06 03:09:10,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:09:10,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:10,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:10,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:10,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:09:10,417 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:09:10,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:10,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:10,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:10,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:10,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964810313] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:10,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:10,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 03:09:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790050518] [2022-12-06 03:09:10,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:10,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:09:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:09:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:09:10,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:10,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 318 transitions, 4669 flow. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 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-06 03:09:10,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:10,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:10,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:12,008 INFO L130 PetriNetUnfolder]: 445/893 cut-off events. [2022-12-06 03:09:12,008 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-06 03:09:12,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7259 conditions, 893 events. 445/893 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4952 event pairs, 4 based on Foata normal form. 3/678 useless extension candidates. Maximal degree in co-relation 6655. Up to 794 conditions per place. [2022-12-06 03:09:12,014 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 184 selfloop transitions, 35 changer transitions 247/466 dead transitions. [2022-12-06 03:09:12,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 466 transitions, 7762 flow [2022-12-06 03:09:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 03:09:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 03:09:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 174 transitions. [2022-12-06 03:09:12,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2022-12-06 03:09:12,017 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 108 predicate places. [2022-12-06 03:09:12,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:12,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 466 transitions, 7762 flow [2022-12-06 03:09:12,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 466 transitions, 7762 flow [2022-12-06 03:09:12,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:12,037 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:12,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 03:09:12,038 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 466 transitions, 7762 flow [2022-12-06 03:09:12,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 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-06 03:09:12,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:12,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:12,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:12,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:12,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:12,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:12,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1588824572, now seen corresponding path program 6 times [2022-12-06 03:09:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:12,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320809757] [2022-12-06 03:09:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:12,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320809757] [2022-12-06 03:09:12,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320809757] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:12,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995361398] [2022-12-06 03:09:12,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:09:12,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:12,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:12,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:09:12,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 03:09:12,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:12,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:12,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:12,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:12,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995361398] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:12,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:12,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 03:09:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499129027] [2022-12-06 03:09:12,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:12,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:09:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:12,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:09:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:09:12,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:12,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 466 transitions, 7762 flow. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 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-06 03:09:12,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:12,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:12,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:14,065 INFO L130 PetriNetUnfolder]: 578/1167 cut-off events. [2022-12-06 03:09:14,065 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-06 03:09:14,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10656 conditions, 1167 events. 578/1167 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7048 event pairs, 8 based on Foata normal form. 3/870 useless extension candidates. Maximal degree in co-relation 9817. Up to 1060 conditions per place. [2022-12-06 03:09:14,074 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 215 selfloop transitions, 56 changer transitions 344/615 dead transitions. [2022-12-06 03:09:14,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 615 transitions, 11478 flow [2022-12-06 03:09:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 03:09:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 03:09:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 198 transitions. [2022-12-06 03:09:14,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37714285714285717 [2022-12-06 03:09:14,079 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 142 predicate places. [2022-12-06 03:09:14,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:14,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 615 transitions, 11478 flow [2022-12-06 03:09:14,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 615 transitions, 11478 flow [2022-12-06 03:09:14,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:14,096 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:14,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 03:09:14,098 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 615 transitions, 11478 flow [2022-12-06 03:09:14,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 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-06 03:09:14,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:14,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:14,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:14,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:14,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 499155326, now seen corresponding path program 7 times [2022-12-06 03:09:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:14,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638986162] [2022-12-06 03:09:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:14,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638986162] [2022-12-06 03:09:14,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638986162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:14,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950295402] [2022-12-06 03:09:14,495 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:09:14,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:14,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:14,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:14,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:09:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:14,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:14,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:14,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:14,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950295402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:14,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:14,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 03:09:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287822469] [2022-12-06 03:09:14,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:14,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:09:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:09:14,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:09:14,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:14,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 615 transitions, 11478 flow. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:14,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:14,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:14,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:16,050 INFO L130 PetriNetUnfolder]: 593/1210 cut-off events. [2022-12-06 03:09:16,050 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2022-12-06 03:09:16,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12264 conditions, 1210 events. 593/1210 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7498 event pairs, 4 based on Foata normal form. 5/905 useless extension candidates. Maximal degree in co-relation 11314. Up to 1103 conditions per place. [2022-12-06 03:09:16,058 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 197 selfloop transitions, 53 changer transitions 396/646 dead transitions. [2022-12-06 03:09:16,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 646 transitions, 13358 flow [2022-12-06 03:09:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 03:09:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 03:09:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 186 transitions. [2022-12-06 03:09:16,060 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42758620689655175 [2022-12-06 03:09:16,061 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 169 predicate places. [2022-12-06 03:09:16,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:16,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 646 transitions, 13358 flow [2022-12-06 03:09:16,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 646 transitions, 13358 flow [2022-12-06 03:09:16,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:16,079 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:16,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 03:09:16,080 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 646 transitions, 13358 flow [2022-12-06 03:09:16,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:16,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:16,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:16,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:16,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 03:09:16,299 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash 416038436, now seen corresponding path program 8 times [2022-12-06 03:09:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:16,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696088985] [2022-12-06 03:09:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696088985] [2022-12-06 03:09:16,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696088985] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118050129] [2022-12-06 03:09:16,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:09:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:16,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:16,444 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:16,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:09:16,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:09:16,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:16,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:16,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:16,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:16,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118050129] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:16,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:16,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 03:09:16,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509386987] [2022-12-06 03:09:16,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:16,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:09:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:16,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:09:16,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:09:16,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:16,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 646 transitions, 13358 flow. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:16,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:16,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:16,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:17,651 INFO L130 PetriNetUnfolder]: 592/1211 cut-off events. [2022-12-06 03:09:17,651 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2022-12-06 03:09:17,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13488 conditions, 1211 events. 592/1211 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7536 event pairs, 8 based on Foata normal form. 3/904 useless extension candidates. Maximal degree in co-relation 12470. Up to 1104 conditions per place. [2022-12-06 03:09:17,659 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 181 selfloop transitions, 57 changer transitions 427/665 dead transitions. [2022-12-06 03:09:17,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 665 transitions, 15083 flow [2022-12-06 03:09:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 03:09:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 03:09:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 148 transitions. [2022-12-06 03:09:17,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4289855072463768 [2022-12-06 03:09:17,661 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 191 predicate places. [2022-12-06 03:09:17,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:17,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 665 transitions, 15083 flow [2022-12-06 03:09:17,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 665 transitions, 15083 flow [2022-12-06 03:09:17,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:17,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:17,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 03:09:17,681 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 665 transitions, 15083 flow [2022-12-06 03:09:17,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:17,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:17,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:17,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:17,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 03:09:17,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:17,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash -571304278, now seen corresponding path program 9 times [2022-12-06 03:09:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:17,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001744264] [2022-12-06 03:09:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:18,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:18,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001744264] [2022-12-06 03:09:18,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001744264] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:18,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472758308] [2022-12-06 03:09:18,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:09:18,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:18,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:18,055 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:18,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:09:18,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:09:18,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:18,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 03:09:18,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:18,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:18,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472758308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:18,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:18,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 03:09:18,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099605004] [2022-12-06 03:09:18,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:18,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:09:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:18,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:09:18,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:09:18,415 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:18,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 665 transitions, 15083 flow. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:18,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:18,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:18,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:19,391 INFO L130 PetriNetUnfolder]: 607/1256 cut-off events. [2022-12-06 03:09:19,391 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-12-06 03:09:19,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15250 conditions, 1256 events. 607/1256 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7972 event pairs, 4 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 14093. Up to 1149 conditions per place. [2022-12-06 03:09:19,399 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 203 selfloop transitions, 34 changer transitions 461/698 dead transitions. [2022-12-06 03:09:19,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 698 transitions, 17235 flow [2022-12-06 03:09:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:09:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:09:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 162 transitions. [2022-12-06 03:09:19,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.432 [2022-12-06 03:09:19,402 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 214 predicate places. [2022-12-06 03:09:19,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:19,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 698 transitions, 17235 flow [2022-12-06 03:09:19,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 698 transitions, 17235 flow [2022-12-06 03:09:19,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:19,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:19,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 03:09:19,420 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 698 transitions, 17235 flow [2022-12-06 03:09:19,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:19,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:19,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:19,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:19,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 03:09:19,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -654421168, now seen corresponding path program 10 times [2022-12-06 03:09:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:19,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954646746] [2022-12-06 03:09:19,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:19,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954646746] [2022-12-06 03:09:19,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954646746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:19,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600484111] [2022-12-06 03:09:19,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:09:19,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:19,801 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:19,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:09:19,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:09:19,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:19,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 03:09:19,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:20,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:20,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600484111] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:20,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:20,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 03:09:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150860470] [2022-12-06 03:09:20,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:20,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:09:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:09:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:09:20,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:20,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 698 transitions, 17235 flow. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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-06 03:09:20,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:20,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:20,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:20,877 INFO L130 PetriNetUnfolder]: 607/1255 cut-off events. [2022-12-06 03:09:20,877 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-12-06 03:09:20,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16494 conditions, 1255 events. 607/1255 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7959 event pairs, 4 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 15259. Up to 1148 conditions per place. [2022-12-06 03:09:20,885 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 210 selfloop transitions, 23 changer transitions 470/703 dead transitions. [2022-12-06 03:09:20,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 703 transitions, 18764 flow [2022-12-06 03:09:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:09:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:09:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-12-06 03:09:20,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2022-12-06 03:09:20,887 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 224 predicate places. [2022-12-06 03:09:20,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:20,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 703 transitions, 18764 flow [2022-12-06 03:09:20,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 703 transitions, 18764 flow [2022-12-06 03:09:20,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:20,907 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:20,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 03:09:20,909 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 703 transitions, 18764 flow [2022-12-06 03:09:20,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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-06 03:09:20,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:20,911 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:20,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:21,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 03:09:21,117 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash -232750842, now seen corresponding path program 11 times [2022-12-06 03:09:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751861520] [2022-12-06 03:09:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:21,296 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-06 03:09:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751861520] [2022-12-06 03:09:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751861520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989058071] [2022-12-06 03:09:21,297 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:09:21,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:21,298 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:21,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:09:21,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:09:21,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:21,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:09:21,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:21,525 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-06 03:09:21,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:21,748 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-06 03:09:21,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989058071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:21,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:21,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-06 03:09:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237400917] [2022-12-06 03:09:21,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:21,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:09:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:21,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:09:21,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:09:21,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:21,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 703 transitions, 18764 flow. Second operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:21,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:21,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:21,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:23,023 INFO L130 PetriNetUnfolder]: 807/1675 cut-off events. [2022-12-06 03:09:23,023 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-06 03:09:23,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23693 conditions, 1675 events. 807/1675 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11337 event pairs, 4 based on Foata normal form. 4/1253 useless extension candidates. Maximal degree in co-relation 21982. Up to 1527 conditions per place. [2022-12-06 03:09:23,034 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 212 selfloop transitions, 74 changer transitions 668/954 dead transitions. [2022-12-06 03:09:23,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 954 transitions, 27381 flow [2022-12-06 03:09:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 03:09:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 03:09:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 180 transitions. [2022-12-06 03:09:23,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 03:09:23,044 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 248 predicate places. [2022-12-06 03:09:23,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:23,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 954 transitions, 27381 flow [2022-12-06 03:09:23,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 954 transitions, 27381 flow [2022-12-06 03:09:23,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:23,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:23,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 03:09:23,076 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 954 transitions, 27381 flow [2022-12-06 03:09:23,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:23,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:23,076 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:23,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:23,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 03:09:23,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:23,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1090066590, now seen corresponding path program 12 times [2022-12-06 03:09:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:23,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757804012] [2022-12-06 03:09:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:23,462 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-06 03:09:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:23,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757804012] [2022-12-06 03:09:23,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757804012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:23,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128319053] [2022-12-06 03:09:23,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:09:23,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:23,464 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:23,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:09:23,532 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:09:23,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:23,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:09:23,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:23,711 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-06 03:09:23,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:23,927 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-06 03:09:23,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128319053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:23,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:23,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 03:09:23,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922606507] [2022-12-06 03:09:23,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:23,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 03:09:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 03:09:23,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-12-06 03:09:23,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:23,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 954 transitions, 27381 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:23,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:23,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:23,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:25,174 INFO L130 PetriNetUnfolder]: 944/1968 cut-off events. [2022-12-06 03:09:25,174 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-06 03:09:25,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29802 conditions, 1968 events. 944/1968 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13820 event pairs, 0 based on Foata normal form. 7/1467 useless extension candidates. Maximal degree in co-relation 27691. Up to 1820 conditions per place. [2022-12-06 03:09:25,186 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 244 selfloop transitions, 81 changer transitions 806/1131 dead transitions. [2022-12-06 03:09:25,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1131 transitions, 34713 flow [2022-12-06 03:09:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:09:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:09:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 173 transitions. [2022-12-06 03:09:25,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2022-12-06 03:09:25,188 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 275 predicate places. [2022-12-06 03:09:25,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:25,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 295 places, 1131 transitions, 34713 flow [2022-12-06 03:09:25,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 295 places, 1131 transitions, 34713 flow [2022-12-06 03:09:25,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:25,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:25,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 03:09:25,222 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 1131 transitions, 34713 flow [2022-12-06 03:09:25,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:25,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:25,223 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:25,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 03:09:25,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1924608600, now seen corresponding path program 13 times [2022-12-06 03:09:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:25,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472717386] [2022-12-06 03:09:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:25,624 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-06 03:09:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472717386] [2022-12-06 03:09:25,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472717386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:25,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086994571] [2022-12-06 03:09:25,624 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:09:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:25,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:25,626 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:25,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:09:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:25,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:09:25,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:25,851 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-06 03:09:25,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:26,034 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-06 03:09:26,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086994571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:26,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:26,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-06 03:09:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375539718] [2022-12-06 03:09:26,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:26,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:09:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:09:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:09:26,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:26,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 1131 transitions, 34713 flow. Second operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:26,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:26,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:26,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:27,793 INFO L130 PetriNetUnfolder]: 1037/2154 cut-off events. [2022-12-06 03:09:27,793 INFO L131 PetriNetUnfolder]: For 534/534 co-relation queries the response was YES. [2022-12-06 03:09:27,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34769 conditions, 2154 events. 1037/2154 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 15385 event pairs, 0 based on Foata normal form. 6/1592 useless extension candidates. Maximal degree in co-relation 32371. Up to 2006 conditions per place. [2022-12-06 03:09:27,806 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 242 selfloop transitions, 97 changer transitions 894/1233 dead transitions. [2022-12-06 03:09:27,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1233 transitions, 40296 flow [2022-12-06 03:09:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 03:09:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 03:09:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 248 transitions. [2022-12-06 03:09:27,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44684684684684683 [2022-12-06 03:09:27,809 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 311 predicate places. [2022-12-06 03:09:27,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:27,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 1233 transitions, 40296 flow [2022-12-06 03:09:27,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 1233 transitions, 40296 flow [2022-12-06 03:09:27,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:27,853 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:27,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 03:09:27,854 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 1233 transitions, 40296 flow [2022-12-06 03:09:27,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:27,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:27,854 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:27,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:28,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:28,059 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1948941120, now seen corresponding path program 14 times [2022-12-06 03:09:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:28,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426402004] [2022-12-06 03:09:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:28,241 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-06 03:09:28,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:28,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426402004] [2022-12-06 03:09:28,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426402004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:28,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517267221] [2022-12-06 03:09:28,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:09:28,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:28,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:28,244 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:28,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:09:28,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:09:28,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:28,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:09:28,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:28,493 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-06 03:09:28,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:28,662 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-06 03:09:28,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517267221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:28,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:28,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-06 03:09:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726375457] [2022-12-06 03:09:28,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:28,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:09:28,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:09:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:09:28,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:28,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1233 transitions, 40296 flow. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:28,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:28,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:28,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:30,212 INFO L130 PetriNetUnfolder]: 1031/2175 cut-off events. [2022-12-06 03:09:30,212 INFO L131 PetriNetUnfolder]: For 546/546 co-relation queries the response was YES. [2022-12-06 03:09:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37293 conditions, 2175 events. 1031/2175 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 15815 event pairs, 0 based on Foata normal form. 3/1610 useless extension candidates. Maximal degree in co-relation 34695. Up to 2027 conditions per place. [2022-12-06 03:09:30,223 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 238 selfloop transitions, 86 changer transitions 938/1262 dead transitions. [2022-12-06 03:09:30,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1262 transitions, 43790 flow [2022-12-06 03:09:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 03:09:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 03:09:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 220 transitions. [2022-12-06 03:09:30,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 03:09:30,235 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 343 predicate places. [2022-12-06 03:09:30,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:30,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 363 places, 1262 transitions, 43790 flow [2022-12-06 03:09:30,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 1262 transitions, 43790 flow [2022-12-06 03:09:30,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:30,279 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:30,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 03:09:30,280 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 1262 transitions, 43790 flow [2022-12-06 03:09:30,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:30,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:30,280 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:30,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:30,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 03:09:30,485 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1134877450, now seen corresponding path program 15 times [2022-12-06 03:09:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:30,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160505642] [2022-12-06 03:09:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:30,656 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-06 03:09:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:30,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160505642] [2022-12-06 03:09:30,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160505642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:30,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141581737] [2022-12-06 03:09:30,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:09:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:30,660 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:30,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:09:30,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:09:30,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:30,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:09:30,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:30,882 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-06 03:09:30,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:31,048 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-06 03:09:31,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141581737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:31,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:31,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-06 03:09:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956057300] [2022-12-06 03:09:31,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:31,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:09:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:31,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:09:31,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:09:31,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:31,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1262 transitions, 43790 flow. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06 03:09:31,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:31,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:31,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:32,437 INFO L130 PetriNetUnfolder]: 1076/2301 cut-off events. [2022-12-06 03:09:32,438 INFO L131 PetriNetUnfolder]: For 572/572 co-relation queries the response was YES. [2022-12-06 03:09:32,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41759 conditions, 2301 events. 1076/2301 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17053 event pairs, 4 based on Foata normal form. 5/1704 useless extension candidates. Maximal degree in co-relation 38807. Up to 2153 conditions per place. [2022-12-06 03:09:32,451 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 303 selfloop transitions, 44 changer transitions 1013/1360 dead transitions. [2022-12-06 03:09:32,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1360 transitions, 49917 flow [2022-12-06 03:09:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 03:09:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 03:09:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 152 transitions. [2022-12-06 03:09:32,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38974358974358975 [2022-12-06 03:09:32,453 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 368 predicate places. [2022-12-06 03:09:32,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:32,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 388 places, 1360 transitions, 49917 flow [2022-12-06 03:09:32,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 388 places, 1360 transitions, 49917 flow [2022-12-06 03:09:32,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:32,500 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:32,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 03:09:32,501 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 1360 transitions, 49917 flow [2022-12-06 03:09:32,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 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-06 03:09:32,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:32,501 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:32,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 03:09:32,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 03:09:32,707 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash 276002920, now seen corresponding path program 16 times [2022-12-06 03:09:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:32,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176834508] [2022-12-06 03:09:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:32,904 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-06 03:09:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176834508] [2022-12-06 03:09:32,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176834508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:32,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309591338] [2022-12-06 03:09:32,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:09:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:32,907 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:32,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:09:32,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:09:32,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:32,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:09:32,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:33,175 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-06 03:09:33,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:33,363 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-06 03:09:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309591338] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:33,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:33,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 03:09:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200147501] [2022-12-06 03:09:33,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:33,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 03:09:33,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 03:09:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-12-06 03:09:33,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:33,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1360 transitions, 49917 flow. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:33,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:33,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:33,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:35,275 INFO L130 PetriNetUnfolder]: 1202/2585 cut-off events. [2022-12-06 03:09:35,276 INFO L131 PetriNetUnfolder]: For 643/643 co-relation queries the response was YES. [2022-12-06 03:09:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49502 conditions, 2585 events. 1202/2585 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 19725 event pairs, 0 based on Foata normal form. 5/1904 useless extension candidates. Maximal degree in co-relation 46034. Up to 2437 conditions per place. [2022-12-06 03:09:35,289 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 323 selfloop transitions, 48 changer transitions 1163/1534 dead transitions. [2022-12-06 03:09:35,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1534 transitions, 59384 flow [2022-12-06 03:09:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 03:09:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 03:09:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 185 transitions. [2022-12-06 03:09:35,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-06 03:09:35,290 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 395 predicate places. [2022-12-06 03:09:35,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:35,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 1534 transitions, 59384 flow [2022-12-06 03:09:35,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 1534 transitions, 59384 flow [2022-12-06 03:09:35,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:35,343 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:35,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 03:09:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 1534 transitions, 59384 flow [2022-12-06 03:09:35,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:35,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:35,344 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:35,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 03:09:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 03:09:35,549 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1600516622, now seen corresponding path program 17 times [2022-12-06 03:09:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:35,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640870404] [2022-12-06 03:09:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:35,780 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-06 03:09:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:35,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640870404] [2022-12-06 03:09:35,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640870404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:35,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618916169] [2022-12-06 03:09:35,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:09:35,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:35,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:35,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:35,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:09:35,852 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:09:35,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:35,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:09:35,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:36,018 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-06 03:09:36,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:36,222 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-06 03:09:36,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618916169] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:36,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:36,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-06 03:09:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554650235] [2022-12-06 03:09:36,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:36,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 03:09:36,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 03:09:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-12-06 03:09:36,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:36,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1534 transitions, 59384 flow. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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-06 03:09:36,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:36,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:36,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:38,379 INFO L130 PetriNetUnfolder]: 1481/3237 cut-off events. [2022-12-06 03:09:38,380 INFO L131 PetriNetUnfolder]: For 800/800 co-relation queries the response was YES. [2022-12-06 03:09:38,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65231 conditions, 3237 events. 1481/3237 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 26032 event pairs, 8 based on Foata normal form. 7/2368 useless extension candidates. Maximal degree in co-relation 60607. Up to 3089 conditions per place. [2022-12-06 03:09:38,395 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 403 selfloop transitions, 71 changer transitions 1443/1917 dead transitions. [2022-12-06 03:09:38,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1917 transitions, 78078 flow [2022-12-06 03:09:38,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 03:09:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 03:09:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 179 transitions. [2022-12-06 03:09:38,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4419753086419753 [2022-12-06 03:09:38,397 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 421 predicate places. [2022-12-06 03:09:38,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:38,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 441 places, 1917 transitions, 78078 flow [2022-12-06 03:09:38,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 441 places, 1917 transitions, 78078 flow [2022-12-06 03:09:38,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:38,472 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:38,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 03:09:38,473 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 1917 transitions, 78078 flow [2022-12-06 03:09:38,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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-06 03:09:38,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:38,473 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:38,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:38,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:38,678 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1094160608, now seen corresponding path program 18 times [2022-12-06 03:09:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:38,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110727368] [2022-12-06 03:09:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:38,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110727368] [2022-12-06 03:09:38,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110727368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:38,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523139746] [2022-12-06 03:09:38,871 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:09:38,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:38,872 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:38,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:09:38,944 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:09:38,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:38,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 03:09:38,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:39,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:39,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523139746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:39,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:39,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-12-06 03:09:39,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889806010] [2022-12-06 03:09:39,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:39,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:09:39,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:39,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:09:39,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:09:39,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:39,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 1917 transitions, 78078 flow. Second operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:39,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:39,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:39,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:43,327 INFO L130 PetriNetUnfolder]: 1910/4201 cut-off events. [2022-12-06 03:09:43,327 INFO L131 PetriNetUnfolder]: For 1026/1026 co-relation queries the response was YES. [2022-12-06 03:09:43,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88859 conditions, 4201 events. 1910/4201 cut-off events. For 1026/1026 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 35848 event pairs, 0 based on Foata normal form. 7/3060 useless extension candidates. Maximal degree in co-relation 82635. Up to 4021 conditions per place. [2022-12-06 03:09:43,347 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 472 selfloop transitions, 150 changer transitions 1833/2455 dead transitions. [2022-12-06 03:09:43,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 2455 transitions, 104916 flow [2022-12-06 03:09:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 03:09:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 03:09:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 336 transitions. [2022-12-06 03:09:43,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4392156862745098 [2022-12-06 03:09:43,349 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 469 predicate places. [2022-12-06 03:09:43,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:43,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 489 places, 2455 transitions, 104916 flow [2022-12-06 03:09:43,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 489 places, 2455 transitions, 104916 flow [2022-12-06 03:09:43,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:43,423 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:43,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 03:09:43,424 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 2455 transitions, 104916 flow [2022-12-06 03:09:43,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:43,425 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:43,425 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:43,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:43,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:43,630 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1068656678, now seen corresponding path program 19 times [2022-12-06 03:09:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:43,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385797286] [2022-12-06 03:09:43,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:43,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385797286] [2022-12-06 03:09:43,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385797286] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:43,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515737423] [2022-12-06 03:09:43,812 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:09:43,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:43,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:43,816 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:43,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:09:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:43,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 03:09:43,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:44,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515737423] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:44,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:44,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-06 03:09:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051773447] [2022-12-06 03:09:44,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 03:09:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 03:09:44,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-12-06 03:09:44,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:44,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 2455 transitions, 104916 flow. Second operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:44,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:44,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:44,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:49,674 INFO L130 PetriNetUnfolder]: 2578/5678 cut-off events. [2022-12-06 03:09:49,674 INFO L131 PetriNetUnfolder]: For 1362/1362 co-relation queries the response was YES. [2022-12-06 03:09:49,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125771 conditions, 5678 events. 2578/5678 cut-off events. For 1362/1362 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 51388 event pairs, 4 based on Foata normal form. 10/4098 useless extension candidates. Maximal degree in co-relation 116827. Up to 5498 conditions per place. [2022-12-06 03:09:49,710 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 776 selfloop transitions, 187 changer transitions 2284/3247 dead transitions. [2022-12-06 03:09:49,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 3247 transitions, 145280 flow [2022-12-06 03:09:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-06 03:09:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-12-06 03:09:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 348 transitions. [2022-12-06 03:09:49,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2022-12-06 03:09:49,712 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 520 predicate places. [2022-12-06 03:09:49,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:49,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 540 places, 3247 transitions, 145280 flow [2022-12-06 03:09:49,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 540 places, 3247 transitions, 145280 flow [2022-12-06 03:09:49,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:49,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:49,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 03:09:49,825 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 3247 transitions, 145280 flow [2022-12-06 03:09:49,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:49,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:49,826 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:49,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-06 03:09:50,032 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1293206796, now seen corresponding path program 20 times [2022-12-06 03:09:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:50,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942500278] [2022-12-06 03:09:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:09:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:50,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942500278] [2022-12-06 03:09:50,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942500278] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:50,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653121102] [2022-12-06 03:09:50,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:09:50,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:50,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:50,206 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:50,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:09:50,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:09:50,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:50,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 03:09:50,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:50,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:09:50,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653121102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:50,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:50,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2022-12-06 03:09:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559024426] [2022-12-06 03:09:50,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:50,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:09:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:09:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2022-12-06 03:09:50,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:50,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 3247 transitions, 145280 flow. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:50,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:50,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:50,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:09:58,318 INFO L130 PetriNetUnfolder]: 2996/6595 cut-off events. [2022-12-06 03:09:58,318 INFO L131 PetriNetUnfolder]: For 1535/1535 co-relation queries the response was YES. [2022-12-06 03:09:58,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152668 conditions, 6595 events. 2996/6595 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 60855 event pairs, 0 based on Foata normal form. 7/4734 useless extension candidates. Maximal degree in co-relation 141787. Up to 6415 conditions per place. [2022-12-06 03:09:58,356 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 1002 selfloop transitions, 244 changer transitions 2529/3775 dead transitions. [2022-12-06 03:09:58,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 3775 transitions, 176413 flow [2022-12-06 03:09:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-06 03:09:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-12-06 03:09:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 368 transitions. [2022-12-06 03:09:58,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4021857923497268 [2022-12-06 03:09:58,359 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 580 predicate places. [2022-12-06 03:09:58,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:09:58,359 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 600 places, 3775 transitions, 176413 flow [2022-12-06 03:09:58,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 600 places, 3775 transitions, 176413 flow [2022-12-06 03:09:58,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:09:58,478 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:09:58,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 03:09:58,478 INFO L495 AbstractCegarLoop]: Abstraction has has 600 places, 3775 transitions, 176413 flow [2022-12-06 03:09:58,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:58,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:09:58,479 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:09:58,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:09:58,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 03:09:58,680 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:09:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:09:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2127748806, now seen corresponding path program 21 times [2022-12-06 03:09:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:09:58,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843786662] [2022-12-06 03:09:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:09:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:09:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:09:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:09:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843786662] [2022-12-06 03:09:58,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843786662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:09:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171525083] [2022-12-06 03:09:58,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:09:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:09:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:09:58,854 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:09:58,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:09:58,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:09:58,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:09:58,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:09:58,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:09:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:59,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:09:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:09:59,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171525083] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:09:59,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:09:59,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-12-06 03:09:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779974448] [2022-12-06 03:09:59,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:09:59,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 03:09:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:09:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 03:09:59,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2022-12-06 03:09:59,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:09:59,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 3775 transitions, 176413 flow. Second operand has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:09:59,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:09:59,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:09:59,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:10,164 INFO L130 PetriNetUnfolder]: 3471/7710 cut-off events. [2022-12-06 03:10:10,164 INFO L131 PetriNetUnfolder]: For 1923/1923 co-relation queries the response was YES. [2022-12-06 03:10:10,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186219 conditions, 7710 events. 3471/7710 cut-off events. For 1923/1923 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 73897 event pairs, 0 based on Foata normal form. 20/5548 useless extension candidates. Maximal degree in co-relation 172628. Up to 7584 conditions per place. [2022-12-06 03:10:10,207 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 1190 selfloop transitions, 262 changer transitions 3119/4571 dead transitions. [2022-12-06 03:10:10,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 4571 transitions, 222771 flow [2022-12-06 03:10:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-06 03:10:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-12-06 03:10:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 250 transitions. [2022-12-06 03:10:10,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32051282051282054 [2022-12-06 03:10:10,209 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 631 predicate places. [2022-12-06 03:10:10,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:10,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 651 places, 4571 transitions, 222771 flow [2022-12-06 03:10:10,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 651 places, 4571 transitions, 222771 flow [2022-12-06 03:10:10,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:10,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:10,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 03:10:10,358 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 4571 transitions, 222771 flow [2022-12-06 03:10:10,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:10,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:10,358 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:10,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 03:10:10,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:10,559 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:10:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1036147438, now seen corresponding path program 22 times [2022-12-06 03:10:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:10,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734323587] [2022-12-06 03:10:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734323587] [2022-12-06 03:10:10,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734323587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497916026] [2022-12-06 03:10:10,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:10:10,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:10,740 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:10:10,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:10:10,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:10:10,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:10:10,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 03:10:10,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:10,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:11,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497916026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:11,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:11,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-06 03:10:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138375822] [2022-12-06 03:10:11,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:11,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 03:10:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:11,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 03:10:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-12-06 03:10:11,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:10:11,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 4571 transitions, 222771 flow. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:11,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:11,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:10:11,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:26,539 INFO L130 PetriNetUnfolder]: 3959/8700 cut-off events. [2022-12-06 03:10:26,539 INFO L131 PetriNetUnfolder]: For 2155/2155 co-relation queries the response was YES. [2022-12-06 03:10:26,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218814 conditions, 8700 events. 3959/8700 cut-off events. For 2155/2155 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 84315 event pairs, 0 based on Foata normal form. 13/6217 useless extension candidates. Maximal degree in co-relation 203479. Up to 8574 conditions per place. [2022-12-06 03:10:26,588 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 1401 selfloop transitions, 166 changer transitions 3574/5141 dead transitions. [2022-12-06 03:10:26,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 5141 transitions, 260809 flow [2022-12-06 03:10:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-06 03:10:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-06 03:10:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 268 transitions. [2022-12-06 03:10:26,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.397037037037037 [2022-12-06 03:10:26,589 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 675 predicate places. [2022-12-06 03:10:26,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:26,590 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 695 places, 5141 transitions, 260809 flow [2022-12-06 03:10:26,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 695 places, 5141 transitions, 260809 flow [2022-12-06 03:10:26,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:26,763 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:26,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 03:10:26,763 INFO L495 AbstractCegarLoop]: Abstraction has has 695 places, 5141 transitions, 260809 flow [2022-12-06 03:10:26,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:26,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:26,764 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:26,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:10:26,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:26,964 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:10:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash 308754315, now seen corresponding path program 23 times [2022-12-06 03:10:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:26,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97056736] [2022-12-06 03:10:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97056736] [2022-12-06 03:10:27,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97056736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:27,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559256820] [2022-12-06 03:10:27,175 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:10:27,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:27,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:27,176 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:10:27,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:10:27,235 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:10:27,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:10:27,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:10:27,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:27,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:27,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559256820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:27,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:27,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-06 03:10:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408586893] [2022-12-06 03:10:27,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:27,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:10:27,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:27,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:10:27,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2022-12-06 03:10:27,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:10:27,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 5141 transitions, 260809 flow. Second operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:27,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:27,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:10:27,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:10:55,621 INFO L130 PetriNetUnfolder]: 6113/13326 cut-off events. [2022-12-06 03:10:55,621 INFO L131 PetriNetUnfolder]: For 3300/3300 co-relation queries the response was YES. [2022-12-06 03:10:55,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348472 conditions, 13326 events. 6113/13326 cut-off events. For 3300/3300 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 136215 event pairs, 0 based on Foata normal form. 54/9496 useless extension candidates. Maximal degree in co-relation 324973. Up to 13200 conditions per place. [2022-12-06 03:10:55,700 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 1735 selfloop transitions, 408 changer transitions 5688/7831 dead transitions. [2022-12-06 03:10:55,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 7831 transitions, 412939 flow [2022-12-06 03:10:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-06 03:10:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-06 03:10:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 352 transitions. [2022-12-06 03:10:55,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3724867724867725 [2022-12-06 03:10:55,702 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 736 predicate places. [2022-12-06 03:10:55,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:10:55,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 756 places, 7831 transitions, 412939 flow [2022-12-06 03:10:55,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 756 places, 7831 transitions, 412939 flow [2022-12-06 03:10:55,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:10:55,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:10:55,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 03:10:55,981 INFO L495 AbstractCegarLoop]: Abstraction has has 756 places, 7831 transitions, 412939 flow [2022-12-06 03:10:55,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:55,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:10:55,981 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:55,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 03:10:56,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 03:10:56,184 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:10:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:10:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -864031821, now seen corresponding path program 24 times [2022-12-06 03:10:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:10:56,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747510878] [2022-12-06 03:10:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:10:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:10:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:10:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:56,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:10:56,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747510878] [2022-12-06 03:10:56,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747510878] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:10:56,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149135479] [2022-12-06 03:10:56,401 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:10:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:10:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:10:56,402 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:10:56,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:10:56,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:10:56,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:10:56,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:10:56,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:10:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:56,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:10:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:10:56,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149135479] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:10:56,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:10:56,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-06 03:10:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139278860] [2022-12-06 03:10:56,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:10:56,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 03:10:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:10:56,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 03:10:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2022-12-06 03:10:56,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:10:56,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 7831 transitions, 412939 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:10:56,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:10:56,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:10:56,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:11:50,786 INFO L130 PetriNetUnfolder]: 6793/14998 cut-off events. [2022-12-06 03:11:50,786 INFO L131 PetriNetUnfolder]: For 3747/3747 co-relation queries the response was YES. [2022-12-06 03:11:50,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407226 conditions, 14998 events. 6793/14998 cut-off events. For 3747/3747 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 157001 event pairs, 0 based on Foata normal form. 32/10678 useless extension candidates. Maximal degree in co-relation 379013. Up to 14872 conditions per place. [2022-12-06 03:11:50,870 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 2006 selfloop transitions, 602 changer transitions 6335/8943 dead transitions. [2022-12-06 03:11:50,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 8943 transitions, 489519 flow [2022-12-06 03:11:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 03:11:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 03:11:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 347 transitions. [2022-12-06 03:11:50,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43647798742138366 [2022-12-06 03:11:50,871 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 788 predicate places. [2022-12-06 03:11:50,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:11:50,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 808 places, 8943 transitions, 489519 flow [2022-12-06 03:11:51,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 808 places, 8943 transitions, 489519 flow [2022-12-06 03:11:51,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:11:51,342 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:11:51,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 471 [2022-12-06 03:11:51,342 INFO L495 AbstractCegarLoop]: Abstraction has has 808 places, 8943 transitions, 489519 flow [2022-12-06 03:11:51,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:51,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:11:51,343 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:11:51,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 03:11:51,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 03:11:51,547 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:11:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:11:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1298906303, now seen corresponding path program 25 times [2022-12-06 03:11:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:11:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167348543] [2022-12-06 03:11:51,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:11:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:11:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:51,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:11:51,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167348543] [2022-12-06 03:11:51,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167348543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:11:51,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613328438] [2022-12-06 03:11:51,759 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:11:51,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:11:51,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:11:51,761 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:11:51,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 03:11:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:11:51,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:11:51,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:11:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:52,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:11:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:11:52,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613328438] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:11:52,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:11:52,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-06 03:11:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399941922] [2022-12-06 03:11:52,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:11:52,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 03:11:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:11:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 03:11:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-12-06 03:11:52,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:11:52,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 8943 transitions, 489519 flow. Second operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:11:52,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:11:52,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:11:52,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:12:57,910 INFO L130 PetriNetUnfolder]: 7204/15879 cut-off events. [2022-12-06 03:12:57,910 INFO L131 PetriNetUnfolder]: For 4011/4011 co-relation queries the response was YES. [2022-12-06 03:12:57,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447041 conditions, 15879 events. 7204/15879 cut-off events. For 4011/4011 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 166818 event pairs, 0 based on Foata normal form. 66/11321 useless extension candidates. Maximal degree in co-relation 417312. Up to 15753 conditions per place. [2022-12-06 03:12:57,998 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 1947 selfloop transitions, 337 changer transitions 7376/9660 dead transitions. [2022-12-06 03:12:57,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 854 places, 9660 transitions, 548109 flow [2022-12-06 03:12:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-06 03:12:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-06 03:12:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 260 transitions. [2022-12-06 03:12:58,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36879432624113473 [2022-12-06 03:12:58,000 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 834 predicate places. [2022-12-06 03:12:58,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:12:58,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 854 places, 9660 transitions, 548109 flow [2022-12-06 03:12:58,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 854 places, 9660 transitions, 548109 flow [2022-12-06 03:12:58,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:12:58,529 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:12:58,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 530 [2022-12-06 03:12:58,530 INFO L495 AbstractCegarLoop]: Abstraction has has 854 places, 9660 transitions, 548109 flow [2022-12-06 03:12:58,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:58,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:12:58,530 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:12:58,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 03:12:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 03:12:58,735 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:12:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:12:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1902627507, now seen corresponding path program 26 times [2022-12-06 03:12:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:12:58,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543566556] [2022-12-06 03:12:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:12:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:12:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:12:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:58,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:12:58,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543566556] [2022-12-06 03:12:58,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543566556] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:12:58,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533117895] [2022-12-06 03:12:58,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:12:58,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:12:58,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:12:58,976 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:12:58,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 03:12:59,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:12:59,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:12:59,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 03:12:59,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:12:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:59,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:12:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:12:59,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533117895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:12:59,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:12:59,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2022-12-06 03:12:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501587991] [2022-12-06 03:12:59,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:12:59,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 03:12:59,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:12:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 03:12:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2022-12-06 03:12:59,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:12:59,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 9660 transitions, 548109 flow. Second operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:12:59,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:12:59,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:12:59,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:14:30,498 INFO L130 PetriNetUnfolder]: 7475/16579 cut-off events. [2022-12-06 03:14:30,498 INFO L131 PetriNetUnfolder]: For 4198/4198 co-relation queries the response was YES. [2022-12-06 03:14:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483350 conditions, 16579 events. 7475/16579 cut-off events. For 4198/4198 co-relation queries the response was YES. Maximal size of possible extension queue 1381. Compared 176313 event pairs, 0 based on Foata normal form. 50/11805 useless extension candidates. Maximal degree in co-relation 451692. Up to 16453 conditions per place. [2022-12-06 03:14:30,586 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 1529 selfloop transitions, 566 changer transitions 8033/10128 dead transitions. [2022-12-06 03:14:30,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 10128 transitions, 594957 flow [2022-12-06 03:14:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-06 03:14:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-12-06 03:14:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 397 transitions. [2022-12-06 03:14:30,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41354166666666664 [2022-12-06 03:14:30,587 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 897 predicate places. [2022-12-06 03:14:30,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:14:30,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 917 places, 10128 transitions, 594957 flow [2022-12-06 03:14:31,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 917 places, 10128 transitions, 594957 flow [2022-12-06 03:14:31,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:14:31,177 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:14:31,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 590 [2022-12-06 03:14:31,178 INFO L495 AbstractCegarLoop]: Abstraction has has 917 places, 10128 transitions, 594957 flow [2022-12-06 03:14:31,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:31,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:14:31,178 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:14:31,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 03:14:31,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 03:14:31,383 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:14:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:14:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash 48640317, now seen corresponding path program 27 times [2022-12-06 03:14:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:14:31,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871892159] [2022-12-06 03:14:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:14:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:14:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:14:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:14:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871892159] [2022-12-06 03:14:31,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871892159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:14:31,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370342411] [2022-12-06 03:14:31,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:14:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:14:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:14:31,613 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:14:31,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 03:14:31,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:14:31,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:14:31,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 03:14:31,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:14:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:31,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:14:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:14:32,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370342411] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:14:32,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:14:32,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-12-06 03:14:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348244042] [2022-12-06 03:14:32,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:14:32,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 03:14:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:14:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 03:14:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-12-06 03:14:32,121 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:14:32,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 10128 transitions, 594957 flow. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:14:32,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:14:32,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:14:32,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:16:24,860 INFO L130 PetriNetUnfolder]: 8449/18675 cut-off events. [2022-12-06 03:16:24,860 INFO L131 PetriNetUnfolder]: For 4738/4738 co-relation queries the response was YES. [2022-12-06 03:16:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563124 conditions, 18675 events. 8449/18675 cut-off events. For 4738/4738 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 202024 event pairs, 0 based on Foata normal form. 21/13244 useless extension candidates. Maximal degree in co-relation 526637. Up to 18549 conditions per place. [2022-12-06 03:16:24,968 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 2017 selfloop transitions, 214 changer transitions 9146/11377 dead transitions. [2022-12-06 03:16:24,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 11377 transitions, 691074 flow [2022-12-06 03:16:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-06 03:16:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-06 03:16:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 349 transitions. [2022-12-06 03:16:24,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3472636815920398 [2022-12-06 03:16:24,971 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 958 predicate places. [2022-12-06 03:16:24,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:16:24,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 978 places, 11377 transitions, 691074 flow [2022-12-06 03:16:25,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 978 places, 11377 transitions, 691074 flow [2022-12-06 03:16:25,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:16:25,611 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:16:25,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 641 [2022-12-06 03:16:25,612 INFO L495 AbstractCegarLoop]: Abstraction has has 978 places, 11377 transitions, 691074 flow [2022-12-06 03:16:25,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:16:25,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:16:25,612 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:16:25,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 03:16:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 03:16:25,813 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:16:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:16:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 752373723, now seen corresponding path program 28 times [2022-12-06 03:16:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:16:25,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705553531] [2022-12-06 03:16:25,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:16:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:16:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:16:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:26,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:16:26,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705553531] [2022-12-06 03:16:26,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705553531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:16:26,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171359156] [2022-12-06 03:16:26,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:16:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:16:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:16:26,047 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:16:26,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 03:16:26,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:16:26,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:16:26,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 03:16:26,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:16:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:26,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:16:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:16:26,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171359156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:16:26,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:16:26,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-12-06 03:16:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240949967] [2022-12-06 03:16:26,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:16:26,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 03:16:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:16:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 03:16:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2022-12-06 03:16:26,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:16:26,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 11377 transitions, 691074 flow. Second operand has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:16:26,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:16:26,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:16:26,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:18:35,058 INFO L130 PetriNetUnfolder]: 8663/19225 cut-off events. [2022-12-06 03:18:35,058 INFO L131 PetriNetUnfolder]: For 4900/4900 co-relation queries the response was YES. [2022-12-06 03:18:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598952 conditions, 19225 events. 8663/19225 cut-off events. For 4900/4900 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 209496 event pairs, 0 based on Foata normal form. 25/13646 useless extension candidates. Maximal degree in co-relation 560126. Up to 19099 conditions per place. [2022-12-06 03:18:35,185 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 2012 selfloop transitions, 235 changer transitions 9492/11739 dead transitions. [2022-12-06 03:18:35,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 11739 transitions, 736578 flow [2022-12-06 03:18:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 03:18:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 03:18:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 262 transitions. [2022-12-06 03:18:35,186 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4062015503875969 [2022-12-06 03:18:35,187 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 1000 predicate places. [2022-12-06 03:18:35,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:18:35,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1020 places, 11739 transitions, 736578 flow [2022-12-06 03:18:35,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1020 places, 11739 transitions, 736578 flow [2022-12-06 03:18:35,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:18:35,826 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:18:35,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 640 [2022-12-06 03:18:35,827 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 11739 transitions, 736578 flow [2022-12-06 03:18:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:18:35,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:18:35,828 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:18:35,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 03:18:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:18:36,034 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:18:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:18:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1303402451, now seen corresponding path program 29 times [2022-12-06 03:18:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:18:36,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716567024] [2022-12-06 03:18:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:18:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:18:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:18:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:18:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:18:36,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716567024] [2022-12-06 03:18:36,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716567024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:18:36,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327965573] [2022-12-06 03:18:36,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:18:36,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:18:36,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:18:36,426 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:18:36,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 03:18:36,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-06 03:18:36,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:18:36,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 03:18:36,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:18:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:18:36,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:18:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:18:37,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327965573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:18:37,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:18:37,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2022-12-06 03:18:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963574826] [2022-12-06 03:18:37,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:18:37,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 03:18:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:18:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 03:18:37,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2022-12-06 03:18:37,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:18:37,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 11739 transitions, 736578 flow. Second operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:18:37,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:18:37,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:18:37,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:21:19,098 INFO L130 PetriNetUnfolder]: 9482/21249 cut-off events. [2022-12-06 03:21:19,098 INFO L131 PetriNetUnfolder]: For 5430/5430 co-relation queries the response was YES. [2022-12-06 03:21:19,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683296 conditions, 21249 events. 9482/21249 cut-off events. For 5430/5430 co-relation queries the response was YES. Maximal size of possible extension queue 1762. Compared 236549 event pairs, 0 based on Foata normal form. 16/15111 useless extension candidates. Maximal degree in co-relation 638310. Up to 21107 conditions per place. [2022-12-06 03:21:19,235 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 1967 selfloop transitions, 366 changer transitions 10760/13093 dead transitions. [2022-12-06 03:21:19,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1074 places, 13093 transitions, 847774 flow [2022-12-06 03:21:19,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-06 03:21:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-06 03:21:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 323 transitions. [2022-12-06 03:21:19,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39151515151515154 [2022-12-06 03:21:19,237 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 1054 predicate places. [2022-12-06 03:21:19,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:21:19,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1074 places, 13093 transitions, 847774 flow [2022-12-06 03:21:19,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1074 places, 13093 transitions, 847774 flow [2022-12-06 03:21:19,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:21:19,908 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:21:19,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 672 [2022-12-06 03:21:19,909 INFO L495 AbstractCegarLoop]: Abstraction has has 1074 places, 13093 transitions, 847774 flow [2022-12-06 03:21:19,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:21:19,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:21:19,910 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:21:19,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 03:21:20,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 03:21:20,115 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:21:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:21:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1996652469, now seen corresponding path program 30 times [2022-12-06 03:21:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:21:20,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521130754] [2022-12-06 03:21:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:21:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:21:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:21:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:21:20,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:21:20,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521130754] [2022-12-06 03:21:20,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521130754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:21:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432243438] [2022-12-06 03:21:20,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:21:20,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:21:20,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:21:20,696 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:21:20,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 03:21:20,784 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-06 03:21:20,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:21:20,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 03:21:20,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:21:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:21:21,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:21:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:21:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432243438] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:21:21,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:21:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 31 [2022-12-06 03:21:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771634380] [2022-12-06 03:21:21,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:21:21,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 03:21:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:21:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 03:21:21,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-12-06 03:21:21,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:21:21,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1074 places, 13093 transitions, 847774 flow. Second operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:21:21,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:21:21,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:21:21,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 03:22:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-06 03:22:49,819 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:22:49,823 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:22:49,823 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:22:49,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 03:22:50,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:22:50,020 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (33states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 395805 conditions, 11962 events (5970/11961 cut-off events. For 2642/2642 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 128062 event pairs, 0 based on Foata normal form. 0/9638 useless extension candidates. Maximal degree in co-relation 391228. Up to 11819 conditions per place.). [2022-12-06 03:22:50,021 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:22:50,021 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:22:50,021 INFO L458 BasicCegarLoop]: Path program histogram: [30, 1, 1] [2022-12-06 03:22:50,024 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:22:50,025 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:22:50,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:22:50 BasicIcfg [2022-12-06 03:22:50,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:22:50,027 INFO L158 Benchmark]: Toolchain (without parser) took 830562.54ms. Allocated memory was 192.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 169.7MB in the beginning and 632.1MB in the end (delta: -462.3MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 03:22:50,028 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 169.5MB in the beginning and 169.4MB in the end (delta: 169.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:22:50,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.02ms. Allocated memory is still 192.9MB. Free memory was 169.3MB in the beginning and 158.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 03:22:50,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 192.9MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:22:50,028 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 192.9MB. Free memory was 156.7MB in the beginning and 155.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:22:50,028 INFO L158 Benchmark]: RCFGBuilder took 398.05ms. Allocated memory is still 192.9MB. Free memory was 155.2MB in the beginning and 141.4MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 03:22:50,029 INFO L158 Benchmark]: TraceAbstraction took 829880.09ms. Allocated memory was 192.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 140.5MB in the beginning and 632.1MB in the end (delta: -491.5MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 03:22:50,030 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 169.5MB in the beginning and 169.4MB in the end (delta: 169.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.02ms. Allocated memory is still 192.9MB. Free memory was 169.3MB in the beginning and 158.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 192.9MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 192.9MB. Free memory was 156.7MB in the beginning and 155.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 398.05ms. Allocated memory is still 192.9MB. Free memory was 155.2MB in the beginning and 141.4MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 829880.09ms. Allocated memory was 192.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 140.5MB in the beginning and 632.1MB in the end (delta: -491.5MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 70 PlacesBefore, 20 PlacesAfterwards, 69 TransitionsBefore, 15 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 54 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 201, unknown conditional: 0, unknown unconditional: 201] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 305, Positive conditional cache size: 0, Positive unconditional cache size: 305, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 23 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 16 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, 27 PlacesBefore, 27 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 16 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, 43 PlacesBefore, 43 PlacesAfterwards, 145 TransitionsBefore, 145 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, 62 PlacesBefore, 62 PlacesAfterwards, 214 TransitionsBefore, 214 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, 83 PlacesBefore, 83 PlacesAfterwards, 305 TransitionsBefore, 305 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, 98 PlacesBefore, 98 PlacesAfterwards, 318 TransitionsBefore, 318 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, 128 PlacesBefore, 128 PlacesAfterwards, 466 TransitionsBefore, 466 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, 162 PlacesBefore, 162 PlacesAfterwards, 615 TransitionsBefore, 615 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, 189 PlacesBefore, 189 PlacesAfterwards, 646 TransitionsBefore, 646 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, 211 PlacesBefore, 211 PlacesAfterwards, 665 TransitionsBefore, 665 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, 234 PlacesBefore, 234 PlacesAfterwards, 698 TransitionsBefore, 698 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, 244 PlacesBefore, 244 PlacesAfterwards, 703 TransitionsBefore, 703 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, 268 PlacesBefore, 268 PlacesAfterwards, 954 TransitionsBefore, 954 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, 295 PlacesBefore, 295 PlacesAfterwards, 1131 TransitionsBefore, 1131 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, 331 PlacesBefore, 331 PlacesAfterwards, 1233 TransitionsBefore, 1233 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, 363 PlacesBefore, 363 PlacesAfterwards, 1262 TransitionsBefore, 1262 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, 388 PlacesBefore, 388 PlacesAfterwards, 1360 TransitionsBefore, 1360 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, 415 PlacesBefore, 415 PlacesAfterwards, 1534 TransitionsBefore, 1534 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, 441 PlacesBefore, 441 PlacesAfterwards, 1917 TransitionsBefore, 1917 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, 489 PlacesBefore, 489 PlacesAfterwards, 2455 TransitionsBefore, 2455 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, 540 PlacesBefore, 540 PlacesAfterwards, 3247 TransitionsBefore, 3247 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, 600 PlacesBefore, 600 PlacesAfterwards, 3775 TransitionsBefore, 3775 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, 651 PlacesBefore, 651 PlacesAfterwards, 4571 TransitionsBefore, 4571 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, 695 PlacesBefore, 695 PlacesAfterwards, 5141 TransitionsBefore, 5141 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, 756 PlacesBefore, 756 PlacesAfterwards, 7831 TransitionsBefore, 7831 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, 808 PlacesBefore, 808 PlacesAfterwards, 8943 TransitionsBefore, 8943 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, 854 PlacesBefore, 854 PlacesAfterwards, 9660 TransitionsBefore, 9660 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, 917 PlacesBefore, 917 PlacesAfterwards, 10128 TransitionsBefore, 10128 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, 978 PlacesBefore, 978 PlacesAfterwards, 11377 TransitionsBefore, 11377 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, 1020 PlacesBefore, 1020 PlacesAfterwards, 11739 TransitionsBefore, 11739 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, 1074 PlacesBefore, 1074 PlacesAfterwards, 13093 TransitionsBefore, 13093 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 - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (33states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 395805 conditions, 11962 events (5970/11961 cut-off events. For 2642/2642 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 128062 event pairs, 0 based on Foata normal form. 0/9638 useless extension candidates. Maximal degree in co-relation 391228. Up to 11819 conditions per place.). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (33states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 395805 conditions, 11962 events (5970/11961 cut-off events. For 2642/2642 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 128062 event pairs, 0 based on Foata normal form. 0/9638 useless extension candidates. Maximal degree in co-relation 391228. Up to 11819 conditions per place.). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (33states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 395805 conditions, 11962 events (5970/11961 cut-off events. For 2642/2642 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 128062 event pairs, 0 based on Foata normal form. 0/9638 useless extension candidates. Maximal degree in co-relation 391228. Up to 11819 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 829.8s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 30, EmptinessCheckTime: 0.0s, AutomataDifference: 794.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7338 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7338 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 13.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 401 mSDsCounter, 1610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33513 IncrementalHoareTripleChecker+Invalid, 35123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1610 mSolverCounterUnsat, 145 mSDtfsCounter, 33513 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2113 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 1551 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28445 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=847774occurred in iteration=31, InterpolantAutomatonStates: 1095, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1037 NumberOfCodeBlocks, 1037 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 1455 ConstructedInterpolants, 0 QuantifiedInterpolants, 17935 SizeOfPredicates, 191 NumberOfNonLiveVariables, 3869 ConjunctsInSsa, 739 ConjunctsInUnsatCore, 94 InterpolantComputations, 1 PerfectInterpolantSequences, 9/558 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown