/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-figure3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:41:02,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:41:02,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:41:02,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:41:02,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:41:02,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:41:02,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:41:02,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:41:02,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:41:02,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:41:02,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:41:02,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:41:02,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:41:02,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:41:02,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:41:02,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:41:02,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:41:02,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:41:02,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:41:02,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:41:02,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:41:02,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:41:02,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:41:02,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:41:02,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:41:02,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:41:02,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:41:02,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:41:02,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:41:02,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:41:02,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:41:02,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:41:02,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:41:02,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:41:02,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:41:02,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:41:02,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:41:02,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:41:02,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:41:02,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:41:02,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:41:02,762 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 02:41:02,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:41:02,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:41:02,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:41:02,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:41:02,792 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:41:02,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:41:02,792 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:41:02,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:41:02,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:41:02,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:41:02,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:41:02,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:41:02,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:41:02,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:41:02,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:41:02,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:41:02,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:41:02,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:41:02,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:41:02,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:41:02,795 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 02:41:03,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:41:03,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:41:03,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:41:03,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:41:03,071 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:41:03,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-06 02:41:04,065 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:41:04,273 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:41:04,274 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-06 02:41:04,280 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4d395ae/af86993044434abea4024b4f40689db7/FLAG754a5fcff [2022-12-06 02:41:04,289 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f4d395ae/af86993044434abea4024b4f40689db7 [2022-12-06 02:41:04,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:41:04,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:41:04,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:41:04,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:41:04,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:41:04,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d48a426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04, skipping insertion in model container [2022-12-06 02:41:04,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:41:04,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:41:04,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:04,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:04,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:04,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:04,446 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-figure3.wvr.c[2121,2134] [2022-12-06 02:41:04,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:41:04,457 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:41:04,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:04,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:04,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:41:04,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:41:04,479 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-figure3.wvr.c[2121,2134] [2022-12-06 02:41:04,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:41:04,492 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:41:04,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04 WrapperNode [2022-12-06 02:41:04,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:41:04,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:41:04,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:41:04,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:41:04,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,521 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2022-12-06 02:41:04,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:41:04,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:41:04,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:41:04,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:41:04,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,548 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:41:04,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:41:04,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:41:04,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:41:04,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (1/1) ... [2022-12-06 02:41:04,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:41:04,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:04,572 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 02:41:04,608 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 02:41:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:41:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:41:04,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:41:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:41:04,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:41:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:41:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:41:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:41:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:41:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:41:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:41:04,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:41:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:41:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:41:04,640 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 02:41:04,711 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:41:04,712 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:41:04,883 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:41:04,899 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:41:04,900 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 02:41:04,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:41:04 BoogieIcfgContainer [2022-12-06 02:41:04,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:41:04,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:41:04,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:41:04,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:41:04,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:41:04" (1/3) ... [2022-12-06 02:41:04,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b812f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:41:04, skipping insertion in model container [2022-12-06 02:41:04,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:41:04" (2/3) ... [2022-12-06 02:41:04,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b812f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:41:04, skipping insertion in model container [2022-12-06 02:41:04,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:41:04" (3/3) ... [2022-12-06 02:41:04,906 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure3.wvr.c [2022-12-06 02:41:04,918 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:41:04,918 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:41:04,918 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:41:04,959 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:41:04,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-06 02:41:05,049 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-06 02:41:05,049 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:41:05,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-06 02:41:05,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-06 02:41:05,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-06 02:41:05,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:05,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-06 02:41:05,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-06 02:41:05,086 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-06 02:41:05,087 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:41:05,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-06 02:41:05,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-06 02:41:05,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 02:41:06,935 INFO L203 LiptonReduction]: Total number of compositions: 55 [2022-12-06 02:41:06,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:41:06,951 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;@718fcb3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:41:06,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:41:06,954 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 02:41:06,955 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:41:06,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:06,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:06,956 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 02:41:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1374975466, now seen corresponding path program 1 times [2022-12-06 02:41:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:06,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516274084] [2022-12-06 02:41:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:07,260 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 02:41:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:07,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516274084] [2022-12-06 02:41:07,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516274084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:07,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:41:07,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:41:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388558349] [2022-12-06 02:41:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:07,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:41:07,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:41:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:41:07,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 02:41:07,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 02:41:07,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:07,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 02:41:07,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:07,348 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-06 02:41:07,348 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 02:41:07,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-06 02:41:07,351 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-06 02:41:07,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-06 02:41:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:41:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:41:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 02:41:07,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 02:41:07,361 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-06 02:41:07,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:07,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 24 transitions, 113 flow [2022-12-06 02:41:07,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 24 transitions, 113 flow [2022-12-06 02:41:07,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 30 [2022-12-06 02:41:07,368 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:07,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:41:07,370 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 24 transitions, 113 flow [2022-12-06 02:41:07,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 02:41:07,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:07,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:07,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:41:07,373 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 02:41:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash -867956374, now seen corresponding path program 1 times [2022-12-06 02:41:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461986349] [2022-12-06 02:41:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:07,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461986349] [2022-12-06 02:41:07,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461986349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:41:07,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:41:07,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:41:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019364475] [2022-12-06 02:41:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:07,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:41:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:07,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:41:07,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:41:07,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:07,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 24 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 02:41:07,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:07,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:07,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:07,572 INFO L130 PetriNetUnfolder]: 72/149 cut-off events. [2022-12-06 02:41:07,573 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 02:41:07,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 149 events. 72/149 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 455 event pairs, 14 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 319. Up to 81 conditions per place. [2022-12-06 02:41:07,574 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 32 selfloop transitions, 3 changer transitions 18/53 dead transitions. [2022-12-06 02:41:07,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 53 transitions, 352 flow [2022-12-06 02:41:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:41:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:41:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 02:41:07,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-06 02:41:07,575 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-06 02:41:07,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:07,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 53 transitions, 352 flow [2022-12-06 02:41:07,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 53 transitions, 352 flow [2022-12-06 02:41:07,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:07,578 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:07,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 02:41:07,578 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 53 transitions, 352 flow [2022-12-06 02:41:07,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 02:41:07,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:07,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:07,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:41:07,579 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 02:41:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -839264028, now seen corresponding path program 2 times [2022-12-06 02:41:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:07,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209335422] [2022-12-06 02:41:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:07,641 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 02:41:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209335422] [2022-12-06 02:41:07,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209335422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646813421] [2022-12-06 02:41:07,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:07,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:07,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:07,644 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 02:41:07,673 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 02:41:07,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:07,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:07,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:41:07,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:07,750 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 02:41:07,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646813421] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:07,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:41:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 02:41:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096801264] [2022-12-06 02:41:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:41:07,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:41:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:41:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:41:07,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 02:41:07,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 53 transitions, 352 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 02:41:07,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:07,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 02:41:07,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:07,818 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2022-12-06 02:41:07,818 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-06 02:41:07,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 163 events. 80/163 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 509 event pairs, 14 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 460. Up to 95 conditions per place. [2022-12-06 02:41:07,820 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 36 selfloop transitions, 4 changer transitions 18/60 dead transitions. [2022-12-06 02:41:07,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 60 transitions, 509 flow [2022-12-06 02:41:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:41:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:41:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 02:41:07,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 02:41:07,829 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-06 02:41:07,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:07,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 60 transitions, 509 flow [2022-12-06 02:41:07,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 60 transitions, 509 flow [2022-12-06 02:41:07,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:07,831 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:07,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 02:41:07,832 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 60 transitions, 509 flow [2022-12-06 02:41:07,832 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 02:41:07,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:07,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:07,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:41:08,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:08,038 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 02:41:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1017957770, now seen corresponding path program 3 times [2022-12-06 02:41:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:08,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734435667] [2022-12-06 02:41:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:08,125 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 02:41:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734435667] [2022-12-06 02:41:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734435667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232189303] [2022-12-06 02:41:08,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:08,127 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 02:41:08,129 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 02:41:08,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:41:08,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:08,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:41:08,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:08,209 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 02:41:08,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:08,234 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 02:41:08,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232189303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:08,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:08,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-06 02:41:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927892754] [2022-12-06 02:41:08,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:08,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 02:41:08,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 02:41:08,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:41:08,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:08,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 60 transitions, 509 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 02:41:08,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:08,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:08,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:08,359 INFO L130 PetriNetUnfolder]: 104/212 cut-off events. [2022-12-06 02:41:08,362 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2022-12-06 02:41:08,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 212 events. 104/212 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 763 event pairs, 8 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 903. Up to 125 conditions per place. [2022-12-06 02:41:08,366 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 49 selfloop transitions, 12 changer transitions 29/90 dead transitions. [2022-12-06 02:41:08,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 90 transitions, 945 flow [2022-12-06 02:41:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:41:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:41:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-06 02:41:08,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-06 02:41:08,370 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 15 predicate places. [2022-12-06 02:41:08,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:08,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 90 transitions, 945 flow [2022-12-06 02:41:08,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 90 transitions, 945 flow [2022-12-06 02:41:08,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:08,375 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:08,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:41:08,376 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 90 transitions, 945 flow [2022-12-06 02:41:08,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 02:41:08,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:08,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:08,400 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 02:41:08,582 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,SelfDestructingSolverStorable3 [2022-12-06 02:41:08,583 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 02:41:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1396776176, now seen corresponding path program 4 times [2022-12-06 02:41:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:08,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817332782] [2022-12-06 02:41:08,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:08,646 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 02:41:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817332782] [2022-12-06 02:41:08,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817332782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393692348] [2022-12-06 02:41:08,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:41:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:08,661 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 02:41:08,708 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 02:41:08,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:41:08,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:08,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:41:08,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:08,764 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 02:41:08,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:08,796 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 02:41:08,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393692348] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:08,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:08,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 02:41:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651864346] [2022-12-06 02:41:08,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:08,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:41:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:41:08,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:41:08,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:08,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 90 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 02:41:08,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:08,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:08,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:08,882 INFO L130 PetriNetUnfolder]: 98/198 cut-off events. [2022-12-06 02:41:08,883 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-06 02:41:08,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 198 events. 98/198 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 705 event pairs, 8 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 1013. Up to 111 conditions per place. [2022-12-06 02:41:08,884 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 43 selfloop transitions, 11 changer transitions 29/83 dead transitions. [2022-12-06 02:41:08,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 83 transitions, 1035 flow [2022-12-06 02:41:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:41:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:41:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 02:41:08,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2022-12-06 02:41:08,886 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-06 02:41:08,887 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:08,887 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 83 transitions, 1035 flow [2022-12-06 02:41:08,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 83 transitions, 1035 flow [2022-12-06 02:41:08,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:08,889 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:08,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:41:08,890 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 83 transitions, 1035 flow [2022-12-06 02:41:08,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 02:41:08,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:08,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:08,905 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 02:41:09,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:09,096 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 02:41:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1943410373, now seen corresponding path program 1 times [2022-12-06 02:41:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:09,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346330086] [2022-12-06 02:41:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:09,183 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 02:41:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:09,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346330086] [2022-12-06 02:41:09,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346330086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828268480] [2022-12-06 02:41:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:09,205 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 02:41:09,247 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 02:41:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:09,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 02:41:09,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:09,326 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 02:41:09,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:09,356 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 02:41:09,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828268480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:09,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:09,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 4 [2022-12-06 02:41:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924565334] [2022-12-06 02:41:09,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:41:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:41:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:41:09,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-06 02:41:09,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 83 transitions, 1035 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 02:41:09,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:09,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-06 02:41:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:09,433 INFO L130 PetriNetUnfolder]: 160/315 cut-off events. [2022-12-06 02:41:09,434 INFO L131 PetriNetUnfolder]: For 211/211 co-relation queries the response was YES. [2022-12-06 02:41:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 315 events. 160/315 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1278 event pairs, 8 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 1902. Up to 222 conditions per place. [2022-12-06 02:41:09,437 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 59 selfloop transitions, 13 changer transitions 42/119 dead transitions. [2022-12-06 02:41:09,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 119 transitions, 1717 flow [2022-12-06 02:41:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:41:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:41:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 02:41:09,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2022-12-06 02:41:09,443 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-06 02:41:09,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:09,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 119 transitions, 1717 flow [2022-12-06 02:41:09,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 119 transitions, 1717 flow [2022-12-06 02:41:09,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:09,448 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:09,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:41:09,449 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 119 transitions, 1717 flow [2022-12-06 02:41:09,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 02:41:09,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:09,449 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:09,465 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 02:41:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:09,654 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 02:41:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash 709875323, now seen corresponding path program 2 times [2022-12-06 02:41:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:09,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864813295] [2022-12-06 02:41:09,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:09,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864813295] [2022-12-06 02:41:09,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864813295] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:09,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458948858] [2022-12-06 02:41:09,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:09,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:09,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:09,776 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 02:41:09,783 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 02:41:09,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:09,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:09,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:09,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:09,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458948858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:09,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-06 02:41:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572015326] [2022-12-06 02:41:09,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:09,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:41:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:09,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:41:09,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:41:09,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:09,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 119 transitions, 1717 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:09,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:09,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:09,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:10,715 INFO L130 PetriNetUnfolder]: 368/767 cut-off events. [2022-12-06 02:41:10,715 INFO L131 PetriNetUnfolder]: For 335/335 co-relation queries the response was YES. [2022-12-06 02:41:10,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 767 events. 368/767 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4067 event pairs, 4 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 5550. Up to 668 conditions per place. [2022-12-06 02:41:10,721 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 170 selfloop transitions, 76 changer transitions 122/368 dead transitions. [2022-12-06 02:41:10,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 368 transitions, 6047 flow [2022-12-06 02:41:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:41:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:41:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 200 transitions. [2022-12-06 02:41:10,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2022-12-06 02:41:10,726 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 54 predicate places. [2022-12-06 02:41:10,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:10,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 368 transitions, 6047 flow [2022-12-06 02:41:10,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 368 transitions, 6047 flow [2022-12-06 02:41:10,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:10,736 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:10,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:41:10,737 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 368 transitions, 6047 flow [2022-12-06 02:41:10,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:10,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:10,737 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:10,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 02:41:10,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:10,942 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 02:41:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -489833203, now seen corresponding path program 3 times [2022-12-06 02:41:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:10,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472405975] [2022-12-06 02:41:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:11,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472405975] [2022-12-06 02:41:11,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472405975] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:11,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601381283] [2022-12-06 02:41:11,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:11,023 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 02:41:11,057 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 02:41:11,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:41:11,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:11,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:11,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:11,141 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 02:41:11,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:11,184 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 02:41:11,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601381283] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:11,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:11,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-12-06 02:41:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632782478] [2022-12-06 02:41:11,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:11,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:41:11,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:41:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:41:11,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:11,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 368 transitions, 6047 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:11,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:11,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:11,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:11,605 INFO L130 PetriNetUnfolder]: 400/823 cut-off events. [2022-12-06 02:41:11,605 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2022-12-06 02:41:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7449 conditions, 823 events. 400/823 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4423 event pairs, 2 based on Foata normal form. 0/667 useless extension candidates. Maximal degree in co-relation 6753. Up to 724 conditions per place. [2022-12-06 02:41:11,610 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 240 selfloop transitions, 38 changer transitions 122/400 dead transitions. [2022-12-06 02:41:11,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 400 transitions, 7371 flow [2022-12-06 02:41:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:41:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:41:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-12-06 02:41:11,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2022-12-06 02:41:11,612 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 63 predicate places. [2022-12-06 02:41:11,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:11,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 400 transitions, 7371 flow [2022-12-06 02:41:11,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 400 transitions, 7371 flow [2022-12-06 02:41:11,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:11,621 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:11,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 02:41:11,622 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 400 transitions, 7371 flow [2022-12-06 02:41:11,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:11,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:11,622 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:11,641 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 02:41:11,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:11,836 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 02:41:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1869721497, now seen corresponding path program 4 times [2022-12-06 02:41:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:11,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543064485] [2022-12-06 02:41:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543064485] [2022-12-06 02:41:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543064485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902101783] [2022-12-06 02:41:11,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:41:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:11,926 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 02:41:11,943 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 02:41:11,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:41:11,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:11,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:11,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:12,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:12,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902101783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:12,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:12,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-06 02:41:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558430252] [2022-12-06 02:41:12,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:12,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:41:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:41:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:41:12,094 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:12,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 400 transitions, 7371 flow. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 02:41:12,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:12,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:12,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:12,755 INFO L130 PetriNetUnfolder]: 484/977 cut-off events. [2022-12-06 02:41:12,756 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-12-06 02:41:12,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 977 events. 484/977 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5438 event pairs, 8 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 9057. Up to 878 conditions per place. [2022-12-06 02:41:12,763 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 295 selfloop transitions, 71 changer transitions 122/488 dead transitions. [2022-12-06 02:41:12,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 488 transitions, 9970 flow [2022-12-06 02:41:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:41:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:41:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-12-06 02:41:12,765 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-06 02:41:12,765 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 80 predicate places. [2022-12-06 02:41:12,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:12,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 488 transitions, 9970 flow [2022-12-06 02:41:12,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 488 transitions, 9970 flow [2022-12-06 02:41:12,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:12,776 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:12,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 02:41:12,777 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 488 transitions, 9970 flow [2022-12-06 02:41:12,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 02:41:12,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:12,777 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:12,793 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 02:41:12,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:12,982 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 02:41:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1625350405, now seen corresponding path program 5 times [2022-12-06 02:41:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:12,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289557755] [2022-12-06 02:41:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:12,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:13,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:13,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289557755] [2022-12-06 02:41:13,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289557755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:13,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974998676] [2022-12-06 02:41:13,102 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:41:13,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:13,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:13,104 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 02:41:13,106 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 02:41:13,155 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:13,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:13,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:13,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:13,206 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 02:41:13,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:13,254 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 02:41:13,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974998676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:13,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:13,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-06 02:41:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055734533] [2022-12-06 02:41:13,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:13,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:41:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:13,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:41:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:41:13,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:13,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 488 transitions, 9970 flow. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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 02:41:13,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:13,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:13,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:13,816 INFO L130 PetriNetUnfolder]: 486/981 cut-off events. [2022-12-06 02:41:13,817 INFO L131 PetriNetUnfolder]: For 367/367 co-relation queries the response was YES. [2022-12-06 02:41:13,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10849 conditions, 981 events. 486/981 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5463 event pairs, 2 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 10030. Up to 882 conditions per place. [2022-12-06 02:41:13,824 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 274 selfloop transitions, 91 changer transitions 130/495 dead transitions. [2022-12-06 02:41:13,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 495 transitions, 11106 flow [2022-12-06 02:41:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:41:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:41:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 144 transitions. [2022-12-06 02:41:13,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-06 02:41:13,826 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 99 predicate places. [2022-12-06 02:41:13,826 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:13,826 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 495 transitions, 11106 flow [2022-12-06 02:41:13,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 495 transitions, 11106 flow [2022-12-06 02:41:13,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:13,838 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:13,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:41:13,840 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 495 transitions, 11106 flow [2022-12-06 02:41:13,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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 02:41:13,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:13,840 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:13,879 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 02:41:14,044 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,SelfDestructingSolverStorable9 [2022-12-06 02:41:14,044 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 02:41:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1758003893, now seen corresponding path program 6 times [2022-12-06 02:41:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:14,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151502428] [2022-12-06 02:41:14,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:14,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:14,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151502428] [2022-12-06 02:41:14,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151502428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:14,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565893108] [2022-12-06 02:41:14,144 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:41:14,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:14,169 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 02:41:14,170 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 02:41:14,217 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:41:14,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:14,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:14,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:14,277 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 02:41:14,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:14,345 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 02:41:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565893108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:14,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:14,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-06 02:41:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764875436] [2022-12-06 02:41:14,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:14,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:41:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:14,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:41:14,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:41:14,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:14,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 495 transitions, 11106 flow. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:14,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:14,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:14,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:15,141 INFO L130 PetriNetUnfolder]: 743/1479 cut-off events. [2022-12-06 02:41:15,141 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-12-06 02:41:15,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17857 conditions, 1479 events. 743/1479 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9118 event pairs, 2 based on Foata normal form. 0/1235 useless extension candidates. Maximal degree in co-relation 16804. Up to 1380 conditions per place. [2022-12-06 02:41:15,154 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 488 selfloop transitions, 133 changer transitions 143/764 dead transitions. [2022-12-06 02:41:15,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 764 transitions, 18684 flow [2022-12-06 02:41:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:41:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:41:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2022-12-06 02:41:15,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 02:41:15,156 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 122 predicate places. [2022-12-06 02:41:15,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:15,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 764 transitions, 18684 flow [2022-12-06 02:41:15,173 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 764 transitions, 18684 flow [2022-12-06 02:41:15,173 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:15,175 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:15,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 02:41:15,175 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 764 transitions, 18684 flow [2022-12-06 02:41:15,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:15,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:15,175 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:15,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 02:41:15,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:15,381 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 02:41:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1861733983, now seen corresponding path program 7 times [2022-12-06 02:41:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:15,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488860675] [2022-12-06 02:41:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:15,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488860675] [2022-12-06 02:41:15,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488860675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:15,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922876436] [2022-12-06 02:41:15,468 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:41:15,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:15,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:15,469 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 02:41:15,513 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 02:41:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:15,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:15,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:15,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:15,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922876436] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:15,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:15,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-12-06 02:41:15,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329623924] [2022-12-06 02:41:15,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:15,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:41:15,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:15,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:41:15,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-06 02:41:15,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:15,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 764 transitions, 18684 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:15,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:15,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:15,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:16,794 INFO L130 PetriNetUnfolder]: 869/1780 cut-off events. [2022-12-06 02:41:16,795 INFO L131 PetriNetUnfolder]: For 533/533 co-relation queries the response was YES. [2022-12-06 02:41:16,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23294 conditions, 1780 events. 869/1780 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11739 event pairs, 20 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 21898. Up to 1681 conditions per place. [2022-12-06 02:41:16,811 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 545 selfloop transitions, 198 changer transitions 191/934 dead transitions. [2022-12-06 02:41:16,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 934 transitions, 24728 flow [2022-12-06 02:41:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:41:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:41:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 143 transitions. [2022-12-06 02:41:16,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2022-12-06 02:41:16,813 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 145 predicate places. [2022-12-06 02:41:16,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:16,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 934 transitions, 24728 flow [2022-12-06 02:41:16,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 934 transitions, 24728 flow [2022-12-06 02:41:16,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:16,836 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:16,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 02:41:16,837 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 934 transitions, 24728 flow [2022-12-06 02:41:16,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:16,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:16,837 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:16,856 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 02:41:17,042 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,SelfDestructingSolverStorable11 [2022-12-06 02:41:17,042 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 02:41:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1517758231, now seen corresponding path program 8 times [2022-12-06 02:41:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:17,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511743935] [2022-12-06 02:41:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:17,117 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 02:41:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511743935] [2022-12-06 02:41:17,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511743935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237761683] [2022-12-06 02:41:17,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:17,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:17,133 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 02:41:17,134 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 02:41:17,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:17,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:17,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:41:17,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:17,215 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 02:41:17,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:17,265 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 02:41:17,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237761683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:17,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:17,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2022-12-06 02:41:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308283832] [2022-12-06 02:41:17,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:41:17,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:41:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:41:17,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:17,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 934 transitions, 24728 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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 02:41:17,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:17,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:17,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:18,071 INFO L130 PetriNetUnfolder]: 851/1740 cut-off events. [2022-12-06 02:41:18,071 INFO L131 PetriNetUnfolder]: For 522/522 co-relation queries the response was YES. [2022-12-06 02:41:18,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24510 conditions, 1740 events. 851/1740 cut-off events. For 522/522 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11450 event pairs, 12 based on Foata normal form. 0/1472 useless extension candidates. Maximal degree in co-relation 23098. Up to 1641 conditions per place. [2022-12-06 02:41:18,082 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 563 selfloop transitions, 152 changer transitions 199/914 dead transitions. [2022-12-06 02:41:18,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 914 transitions, 26027 flow [2022-12-06 02:41:18,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:41:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:41:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-12-06 02:41:18,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2022-12-06 02:41:18,084 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 156 predicate places. [2022-12-06 02:41:18,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:18,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 914 transitions, 26027 flow [2022-12-06 02:41:18,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 914 transitions, 26027 flow [2022-12-06 02:41:18,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:18,106 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:18,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 02:41:18,106 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 914 transitions, 26027 flow [2022-12-06 02:41:18,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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 02:41:18,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:18,107 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:18,112 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 02:41:18,312 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,SelfDestructingSolverStorable12 [2022-12-06 02:41:18,312 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 02:41:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1911437604, now seen corresponding path program 9 times [2022-12-06 02:41:18,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:18,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967816371] [2022-12-06 02:41:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:18,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:18,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967816371] [2022-12-06 02:41:18,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967816371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:18,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871513749] [2022-12-06 02:41:18,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:18,445 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 02:41:18,464 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 02:41:18,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:41:18,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:18,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:41:18,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:18,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871513749] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:18,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:18,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 02:41:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145051513] [2022-12-06 02:41:18,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:18,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:41:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:41:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:41:18,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 02:41:18,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 914 transitions, 26027 flow. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 02:41:18,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:18,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 02:41:18,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:19,326 INFO L130 PetriNetUnfolder]: 1013/2105 cut-off events. [2022-12-06 02:41:19,326 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2022-12-06 02:41:19,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31748 conditions, 2105 events. 1013/2105 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14674 event pairs, 16 based on Foata normal form. 13/1812 useless extension candidates. Maximal degree in co-relation 30093. Up to 2006 conditions per place. [2022-12-06 02:41:19,381 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 633 selfloop transitions, 103 changer transitions 365/1107 dead transitions. [2022-12-06 02:41:19,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 1107 transitions, 33741 flow [2022-12-06 02:41:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:41:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:41:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 02:41:19,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-06 02:41:19,393 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 161 predicate places. [2022-12-06 02:41:19,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:19,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 1107 transitions, 33741 flow [2022-12-06 02:41:19,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 1107 transitions, 33741 flow [2022-12-06 02:41:19,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:19,418 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:19,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 02:41:19,420 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 1107 transitions, 33741 flow [2022-12-06 02:41:19,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 02:41:19,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:19,420 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:19,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 02:41:19,625 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,SelfDestructingSolverStorable13 [2022-12-06 02:41:19,625 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 02:41:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1355798280, now seen corresponding path program 10 times [2022-12-06 02:41:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576039792] [2022-12-06 02:41:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:19,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576039792] [2022-12-06 02:41:19,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576039792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:19,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813689420] [2022-12-06 02:41:19,781 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:41:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:19,782 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 02:41:19,791 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 02:41:19,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:41:19,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:19,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:41:19,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:19,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813689420] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:19,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-12-06 02:41:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257587308] [2022-12-06 02:41:19,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:41:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:19,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:41:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:41:19,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:19,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 1107 transitions, 33741 flow. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:19,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:19,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:19,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:21,678 INFO L130 PetriNetUnfolder]: 2015/4173 cut-off events. [2022-12-06 02:41:21,679 INFO L131 PetriNetUnfolder]: For 1282/1282 co-relation queries the response was YES. [2022-12-06 02:41:21,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67153 conditions, 4173 events. 2015/4173 cut-off events. For 1282/1282 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32516 event pairs, 26 based on Foata normal form. 0/3529 useless extension candidates. Maximal degree in co-relation 63831. Up to 4062 conditions per place. [2022-12-06 02:41:21,701 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1443 selfloop transitions, 190 changer transitions 532/2165 dead transitions. [2022-12-06 02:41:21,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 2165 transitions, 70363 flow [2022-12-06 02:41:21,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 02:41:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 02:41:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2022-12-06 02:41:21,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5215686274509804 [2022-12-06 02:41:21,703 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 177 predicate places. [2022-12-06 02:41:21,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:21,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 2165 transitions, 70363 flow [2022-12-06 02:41:21,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 2165 transitions, 70363 flow [2022-12-06 02:41:21,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:21,757 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:21,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 02:41:21,758 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 2165 transitions, 70363 flow [2022-12-06 02:41:21,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:21,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:21,758 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:21,774 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 02:41:21,963 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,SelfDestructingSolverStorable14 [2022-12-06 02:41:21,963 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 02:41:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1332166296, now seen corresponding path program 11 times [2022-12-06 02:41:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:21,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147677918] [2022-12-06 02:41:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:22,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:22,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147677918] [2022-12-06 02:41:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147677918] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067813115] [2022-12-06 02:41:22,100 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:41:22,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:22,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:22,102 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 02:41:22,197 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 02:41:22,236 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:22,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:22,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:41:22,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:22,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:22,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067813115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:22,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:22,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-12-06 02:41:22,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567470745] [2022-12-06 02:41:22,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:22,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:41:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:22,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:41:22,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:41:22,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:22,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 2165 transitions, 70363 flow. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:22,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:22,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:22,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:26,416 INFO L130 PetriNetUnfolder]: 2210/4609 cut-off events. [2022-12-06 02:41:26,417 INFO L131 PetriNetUnfolder]: For 1392/1392 co-relation queries the response was YES. [2022-12-06 02:41:26,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78727 conditions, 4609 events. 2210/4609 cut-off events. For 1392/1392 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 36899 event pairs, 28 based on Foata normal form. 0/3919 useless extension candidates. Maximal degree in co-relation 74292. Up to 4471 conditions per place. [2022-12-06 02:41:26,490 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 1419 selfloop transitions, 406 changer transitions 574/2399 dead transitions. [2022-12-06 02:41:26,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2399 transitions, 82763 flow [2022-12-06 02:41:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 02:41:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 02:41:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 180 transitions. [2022-12-06 02:41:26,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 02:41:26,492 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 204 predicate places. [2022-12-06 02:41:26,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:26,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 2399 transitions, 82763 flow [2022-12-06 02:41:26,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 2399 transitions, 82763 flow [2022-12-06 02:41:26,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:26,558 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:26,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 02:41:26,558 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 2399 transitions, 82763 flow [2022-12-06 02:41:26,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:26,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:26,559 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:26,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 02:41:26,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:26,764 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 02:41:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1127906678, now seen corresponding path program 12 times [2022-12-06 02:41:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513774172] [2022-12-06 02:41:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:26,947 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 02:41:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513774172] [2022-12-06 02:41:26,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513774172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875572118] [2022-12-06 02:41:26,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:41:26,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:26,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:26,961 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 02:41:26,962 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 02:41:27,028 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-06 02:41:27,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:27,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:41:27,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:27,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:27,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875572118] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:27,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:27,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-12-06 02:41:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271010863] [2022-12-06 02:41:27,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:27,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:41:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:41:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:41:27,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:27,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 2399 transitions, 82763 flow. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 02:41:27,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:27,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:27,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:33,233 INFO L130 PetriNetUnfolder]: 2646/5506 cut-off events. [2022-12-06 02:41:33,233 INFO L131 PetriNetUnfolder]: For 1550/1550 co-relation queries the response was YES. [2022-12-06 02:41:33,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99585 conditions, 5506 events. 2646/5506 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 45612 event pairs, 46 based on Foata normal form. 0/4632 useless extension candidates. Maximal degree in co-relation 94020. Up to 5368 conditions per place. [2022-12-06 02:41:33,267 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 1499 selfloop transitions, 733 changer transitions 634/2866 dead transitions. [2022-12-06 02:41:33,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 2866 transitions, 104598 flow [2022-12-06 02:41:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-06 02:41:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-12-06 02:41:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 424 transitions. [2022-12-06 02:41:33,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3872146118721461 [2022-12-06 02:41:33,270 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 276 predicate places. [2022-12-06 02:41:33,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:33,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 296 places, 2866 transitions, 104598 flow [2022-12-06 02:41:33,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 296 places, 2866 transitions, 104598 flow [2022-12-06 02:41:33,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:33,356 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:33,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 02:41:33,357 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 2866 transitions, 104598 flow [2022-12-06 02:41:33,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 02:41:33,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:33,357 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:33,362 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 02:41:33,561 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,SelfDestructingSolverStorable16 [2022-12-06 02:41:33,562 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 02:41:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:33,562 INFO L85 PathProgramCache]: Analyzing trace with hash 587463798, now seen corresponding path program 13 times [2022-12-06 02:41:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:33,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587291165] [2022-12-06 02:41:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:33,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:33,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587291165] [2022-12-06 02:41:33,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587291165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:33,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961872069] [2022-12-06 02:41:33,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:41:33,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:33,692 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 02:41:33,694 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 02:41:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:33,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:41:33,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:33,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:33,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961872069] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:33,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:33,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-06 02:41:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015737409] [2022-12-06 02:41:33,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:33,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:41:33,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:41:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:41:33,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:33,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 2866 transitions, 104598 flow. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 02:41:33,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:33,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:33,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:40,145 INFO L130 PetriNetUnfolder]: 2890/5954 cut-off events. [2022-12-06 02:41:40,145 INFO L131 PetriNetUnfolder]: For 1610/1610 co-relation queries the response was YES. [2022-12-06 02:41:40,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113642 conditions, 5954 events. 2890/5954 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 49523 event pairs, 44 based on Foata normal form. 0/5028 useless extension candidates. Maximal degree in co-relation 107773. Up to 5816 conditions per place. [2022-12-06 02:41:40,183 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 2028 selfloop transitions, 366 changer transitions 728/3122 dead transitions. [2022-12-06 02:41:40,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 3122 transitions, 120172 flow [2022-12-06 02:41:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 02:41:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 02:41:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 243 transitions. [2022-12-06 02:41:40,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-06 02:41:40,189 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 310 predicate places. [2022-12-06 02:41:40,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:40,190 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 3122 transitions, 120172 flow [2022-12-06 02:41:40,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 3122 transitions, 120172 flow [2022-12-06 02:41:40,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:40,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:40,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-06 02:41:40,288 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 3122 transitions, 120172 flow [2022-12-06 02:41:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 02:41:40,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:40,288 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:40,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:40,492 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,SelfDestructingSolverStorable17 [2022-12-06 02:41:40,493 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 02:41:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -212431596, now seen corresponding path program 14 times [2022-12-06 02:41:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:40,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121520798] [2022-12-06 02:41:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:40,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:40,702 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 02:41:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121520798] [2022-12-06 02:41:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121520798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316293896] [2022-12-06 02:41:40,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:41:40,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:40,704 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 02:41:40,706 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 02:41:40,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:40,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:40,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:41:40,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:40,827 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 02:41:40,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:40,917 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 02:41:40,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316293896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:40,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:40,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-12-06 02:41:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548671775] [2022-12-06 02:41:40,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:40,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:41:40,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:40,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:41:40,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:41:40,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:40,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 3122 transitions, 120172 flow. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 02:41:40,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:40,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:40,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:48,515 INFO L130 PetriNetUnfolder]: 2936/6054 cut-off events. [2022-12-06 02:41:48,515 INFO L131 PetriNetUnfolder]: For 1647/1647 co-relation queries the response was YES. [2022-12-06 02:41:48,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121612 conditions, 6054 events. 2936/6054 cut-off events. For 1647/1647 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50636 event pairs, 34 based on Foata normal form. 0/5128 useless extension candidates. Maximal degree in co-relation 115398. Up to 5916 conditions per place. [2022-12-06 02:41:48,556 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 1837 selfloop transitions, 598 changer transitions 741/3176 dead transitions. [2022-12-06 02:41:48,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 3176 transitions, 128618 flow [2022-12-06 02:41:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 02:41:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 02:41:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 320 transitions. [2022-12-06 02:41:48,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 02:41:48,558 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 353 predicate places. [2022-12-06 02:41:48,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:48,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 3176 transitions, 128618 flow [2022-12-06 02:41:48,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 3176 transitions, 128618 flow [2022-12-06 02:41:48,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:48,650 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:48,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 02:41:48,651 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 3176 transitions, 128618 flow [2022-12-06 02:41:48,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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 02:41:48,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:48,651 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:48,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:48,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:48,854 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 02:41:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash 780578572, now seen corresponding path program 15 times [2022-12-06 02:41:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:48,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192641178] [2022-12-06 02:41:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:49,064 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 02:41:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192641178] [2022-12-06 02:41:49,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192641178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267525584] [2022-12-06 02:41:49,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:49,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:49,067 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 02:41:49,076 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 02:41:49,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:41:49,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:49,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:41:49,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:49,204 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 02:41:49,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:49,318 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 02:41:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267525584] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:49,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:49,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-06 02:41:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817427555] [2022-12-06 02:41:49,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:49,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:41:49,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:49,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:41:49,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:41:49,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:49,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 3176 transitions, 128618 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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 02:41:49,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:49,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:49,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:56,872 INFO L130 PetriNetUnfolder]: 3428/6998 cut-off events. [2022-12-06 02:41:56,872 INFO L131 PetriNetUnfolder]: For 1819/1819 co-relation queries the response was YES. [2022-12-06 02:41:56,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147585 conditions, 6998 events. 3428/6998 cut-off events. For 1819/1819 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 59514 event pairs, 42 based on Foata normal form. 0/5926 useless extension candidates. Maximal degree in co-relation 140592. Up to 6860 conditions per place. [2022-12-06 02:41:56,920 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2629 selfloop transitions, 316 changer transitions 741/3686 dead transitions. [2022-12-06 02:41:56,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 3686 transitions, 156639 flow [2022-12-06 02:41:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 02:41:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 02:41:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 256 transitions. [2022-12-06 02:41:56,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4376068376068376 [2022-12-06 02:41:56,927 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 391 predicate places. [2022-12-06 02:41:56,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:56,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 411 places, 3686 transitions, 156639 flow [2022-12-06 02:41:57,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 411 places, 3686 transitions, 156639 flow [2022-12-06 02:41:57,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:57,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:57,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 02:41:57,066 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 3686 transitions, 156639 flow [2022-12-06 02:41:57,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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 02:41:57,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:57,067 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:57,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 02:41:57,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:57,272 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 02:41:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1756068664, now seen corresponding path program 16 times [2022-12-06 02:41:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:57,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174710393] [2022-12-06 02:41:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:57,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174710393] [2022-12-06 02:41:57,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174710393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:57,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116544644] [2022-12-06 02:41:57,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:41:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:57,405 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 02:41:57,447 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 02:41:57,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:41:57,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:57,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:41:57,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:57,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:57,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116544644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:57,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:57,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-06 02:41:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006911489] [2022-12-06 02:41:57,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:57,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:41:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:41:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:41:57,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:41:57,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 3686 transitions, 156639 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 02:41:57,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:57,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:41:57,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:10,026 INFO L130 PetriNetUnfolder]: 3883/7937 cut-off events. [2022-12-06 02:42:10,026 INFO L131 PetriNetUnfolder]: For 2023/2023 co-relation queries the response was YES. [2022-12-06 02:42:10,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175352 conditions, 7937 events. 3883/7937 cut-off events. For 2023/2023 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 69520 event pairs, 48 based on Foata normal form. 0/6739 useless extension candidates. Maximal degree in co-relation 167396. Up to 7799 conditions per place. [2022-12-06 02:42:10,080 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 2861 selfloop transitions, 452 changer transitions 874/4187 dead transitions. [2022-12-06 02:42:10,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 4187 transitions, 186328 flow [2022-12-06 02:42:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 02:42:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 02:42:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 289 transitions. [2022-12-06 02:42:10,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4587301587301587 [2022-12-06 02:42:10,082 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 432 predicate places. [2022-12-06 02:42:10,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:10,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 4187 transitions, 186328 flow [2022-12-06 02:42:10,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 452 places, 4187 transitions, 186328 flow [2022-12-06 02:42:10,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:10,217 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:10,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-06 02:42:10,218 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 4187 transitions, 186328 flow [2022-12-06 02:42:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 02:42:10,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:10,218 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:10,227 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 02:42:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:10,425 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 02:42:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -454921572, now seen corresponding path program 17 times [2022-12-06 02:42:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:10,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853471229] [2022-12-06 02:42:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:10,568 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 02:42:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853471229] [2022-12-06 02:42:10,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853471229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678661402] [2022-12-06 02:42:10,569 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:42:10,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:10,570 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 02:42:10,573 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 02:42:10,631 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:42:10,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:42:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:42:10,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:10,690 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 02:42:10,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:10,769 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 02:42:10,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678661402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:10,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:10,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-06 02:42:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975444229] [2022-12-06 02:42:10,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:10,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:42:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:42:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:42:10,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:42:10,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 4187 transitions, 186328 flow. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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 02:42:10,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:10,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:42:10,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:24,897 INFO L130 PetriNetUnfolder]: 4249/8613 cut-off events. [2022-12-06 02:42:24,898 INFO L131 PetriNetUnfolder]: For 2128/2128 co-relation queries the response was YES. [2022-12-06 02:42:24,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198897 conditions, 8613 events. 4249/8613 cut-off events. For 2128/2128 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 75903 event pairs, 50 based on Foata normal form. 0/7333 useless extension candidates. Maximal degree in co-relation 190538. Up to 8475 conditions per place. [2022-12-06 02:42:24,963 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3422 selfloop transitions, 268 changer transitions 879/4569 dead transitions. [2022-12-06 02:42:24,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 4569 transitions, 212448 flow [2022-12-06 02:42:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 02:42:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 02:42:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 240 transitions. [2022-12-06 02:42:24,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 02:42:24,965 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 467 predicate places. [2022-12-06 02:42:24,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:24,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 487 places, 4569 transitions, 212448 flow [2022-12-06 02:42:25,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 487 places, 4569 transitions, 212448 flow [2022-12-06 02:42:25,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:25,116 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:25,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 02:42:25,116 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 4569 transitions, 212448 flow [2022-12-06 02:42:25,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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 02:42:25,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:25,117 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:25,121 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 02:42:25,321 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,SelfDestructingSolverStorable21 [2022-12-06 02:42:25,321 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 02:42:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1245278262, now seen corresponding path program 18 times [2022-12-06 02:42:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:25,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445972501] [2022-12-06 02:42:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:25,418 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 02:42:25,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:25,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445972501] [2022-12-06 02:42:25,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445972501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:25,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530019378] [2022-12-06 02:42:25,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:42:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:25,425 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 02:42:25,426 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 02:42:25,478 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:42:25,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:42:25,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:42:25,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:25,529 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 02:42:25,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:25,615 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 02:42:25,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530019378] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:25,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:25,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-06 02:42:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081912631] [2022-12-06 02:42:25,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:25,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:42:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:42:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:42:25,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:42:25,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 4569 transitions, 212448 flow. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:25,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:25,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:42:25,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:42,314 INFO L130 PetriNetUnfolder]: 4516/9114 cut-off events. [2022-12-06 02:42:42,315 INFO L131 PetriNetUnfolder]: For 2203/2203 co-relation queries the response was YES. [2022-12-06 02:42:42,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219580 conditions, 9114 events. 4516/9114 cut-off events. For 2203/2203 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 80578 event pairs, 54 based on Foata normal form. 0/7776 useless extension candidates. Maximal degree in co-relation 210813. Up to 8976 conditions per place. [2022-12-06 02:42:42,476 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 3545 selfloop transitions, 325 changer transitions 986/4856 dead transitions. [2022-12-06 02:42:42,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 4856 transitions, 235491 flow [2022-12-06 02:42:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 02:42:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 02:42:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 184 transitions. [2022-12-06 02:42:42,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.454320987654321 [2022-12-06 02:42:42,479 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 493 predicate places. [2022-12-06 02:42:42,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:42,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 513 places, 4856 transitions, 235491 flow [2022-12-06 02:42:42,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 513 places, 4856 transitions, 235491 flow [2022-12-06 02:42:42,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:42,645 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:42,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 02:42:42,647 INFO L495 AbstractCegarLoop]: Abstraction has has 513 places, 4856 transitions, 235491 flow [2022-12-06 02:42:42,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:42,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:42,647 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:42,664 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 02:42:42,852 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,SelfDestructingSolverStorable22 [2022-12-06 02:42:42,853 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 02:42:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash -565815316, now seen corresponding path program 19 times [2022-12-06 02:42:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:42,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960191303] [2022-12-06 02:42:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:42,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:42,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960191303] [2022-12-06 02:42:42,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960191303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087079671] [2022-12-06 02:42:42,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:42:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:42,953 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 02:42:42,954 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 02:42:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:43,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:42:43,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:43,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087079671] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:43,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-06 02:42:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489752496] [2022-12-06 02:42:43,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:43,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:42:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:42:43,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-06 02:42:43,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:42:43,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 4856 transitions, 235491 flow. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:42:43,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:43,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:42:43,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:06,469 INFO L130 PetriNetUnfolder]: 4728/9508 cut-off events. [2022-12-06 02:43:06,470 INFO L131 PetriNetUnfolder]: For 2262/2262 co-relation queries the response was YES. [2022-12-06 02:43:06,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238580 conditions, 9508 events. 4728/9508 cut-off events. For 2262/2262 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 84616 event pairs, 48 based on Foata normal form. 0/8128 useless extension candidates. Maximal degree in co-relation 229453. Up to 9370 conditions per place. [2022-12-06 02:43:06,547 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3895 selfloop transitions, 200 changer transitions 986/5081 dead transitions. [2022-12-06 02:43:06,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 5081 transitions, 256558 flow [2022-12-06 02:43:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 02:43:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 02:43:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 228 transitions. [2022-12-06 02:43:06,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 02:43:06,549 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 528 predicate places. [2022-12-06 02:43:06,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:06,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 548 places, 5081 transitions, 256558 flow [2022-12-06 02:43:06,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 548 places, 5081 transitions, 256558 flow [2022-12-06 02:43:06,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:06,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:06,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 02:43:06,728 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 5081 transitions, 256558 flow [2022-12-06 02:43:06,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:06,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:06,728 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:06,733 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 02:43:06,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:06,933 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 02:43:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1310517814, now seen corresponding path program 20 times [2022-12-06 02:43:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:06,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140839224] [2022-12-06 02:43:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:07,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140839224] [2022-12-06 02:43:07,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140839224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380699425] [2022-12-06 02:43:07,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:43:07,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:07,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:07,041 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 02:43:07,042 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 02:43:07,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:43:07,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:07,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:43:07,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:07,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:07,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380699425] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:07,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:07,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-06 02:43:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157722442] [2022-12-06 02:43:07,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:07,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:43:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:43:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:43:07,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:43:07,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 5081 transitions, 256558 flow. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 02:43:07,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:07,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:43:07,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:33,410 INFO L130 PetriNetUnfolder]: 5187/10385 cut-off events. [2022-12-06 02:43:33,410 INFO L131 PetriNetUnfolder]: For 2379/2379 co-relation queries the response was YES. [2022-12-06 02:43:33,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270976 conditions, 10385 events. 5187/10385 cut-off events. For 2379/2379 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 93201 event pairs, 38 based on Foata normal form. 0/8853 useless extension candidates. Maximal degree in co-relation 260905. Up to 10247 conditions per place. [2022-12-06 02:43:33,494 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 3951 selfloop transitions, 505 changer transitions 1084/5540 dead transitions. [2022-12-06 02:43:33,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 5540 transitions, 290813 flow [2022-12-06 02:43:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:43:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:43:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 206 transitions. [2022-12-06 02:43:33,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2022-12-06 02:43:33,496 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 557 predicate places. [2022-12-06 02:43:33,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:33,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 577 places, 5540 transitions, 290813 flow [2022-12-06 02:43:33,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 577 places, 5540 transitions, 290813 flow [2022-12-06 02:43:33,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:33,693 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:33,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 02:43:33,693 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 5540 transitions, 290813 flow [2022-12-06 02:43:33,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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 02:43:33,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:33,694 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:33,712 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 02:43:33,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:33,898 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 02:43:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1269079006, now seen corresponding path program 21 times [2022-12-06 02:43:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:33,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913994056] [2022-12-06 02:43:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:34,052 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 02:43:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:34,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913994056] [2022-12-06 02:43:34,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913994056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:34,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190786240] [2022-12-06 02:43:34,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:43:34,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:34,054 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 02:43:34,056 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 02:43:34,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 02:43:34,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:34,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:43:34,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:34,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:34,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190786240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:34,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:34,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-12-06 02:43:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654612624] [2022-12-06 02:43:34,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:43:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:43:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:43:34,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:43:34,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 5540 transitions, 290813 flow. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:43:34,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:34,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:43:34,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:07,797 INFO L130 PetriNetUnfolder]: 5510/11076 cut-off events. [2022-12-06 02:44:07,798 INFO L131 PetriNetUnfolder]: For 2505/2505 co-relation queries the response was YES. [2022-12-06 02:44:07,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300099 conditions, 11076 events. 5510/11076 cut-off events. For 2505/2505 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 100838 event pairs, 54 based on Foata normal form. 0/9434 useless extension candidates. Maximal degree in co-relation 288708. Up to 10938 conditions per place. [2022-12-06 02:44:07,892 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 3306 selfloop transitions, 1477 changer transitions 1171/5954 dead transitions. [2022-12-06 02:44:07,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 5954 transitions, 324429 flow [2022-12-06 02:44:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-06 02:44:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-06 02:44:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 306 transitions. [2022-12-06 02:44:07,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2022-12-06 02:44:07,894 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 613 predicate places. [2022-12-06 02:44:07,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:07,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 633 places, 5954 transitions, 324429 flow [2022-12-06 02:44:08,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 633 places, 5954 transitions, 324429 flow [2022-12-06 02:44:08,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:08,120 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:08,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-06 02:44:08,223 INFO L495 AbstractCegarLoop]: Abstraction has has 633 places, 5954 transitions, 324429 flow [2022-12-06 02:44:08,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:08,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:08,224 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:08,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-06 02:44:08,424 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,SelfDestructingSolverStorable25 [2022-12-06 02:44:08,424 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 02:44:08,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2129142828, now seen corresponding path program 22 times [2022-12-06 02:44:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:08,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185833361] [2022-12-06 02:44:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:08,578 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 02:44:08,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:08,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185833361] [2022-12-06 02:44:08,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185833361] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:08,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763513034] [2022-12-06 02:44:08,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:44:08,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:08,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:08,580 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 02:44:08,600 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 02:44:08,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:44:08,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:08,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:44:08,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:08,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:08,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763513034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:08,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:08,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-12-06 02:44:08,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318713350] [2022-12-06 02:44:08,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:08,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:44:08,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:44:08,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:44:08,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:44:08,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 5954 transitions, 324429 flow. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:08,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:08,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:44:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:44,500 INFO L130 PetriNetUnfolder]: 5553/11209 cut-off events. [2022-12-06 02:44:44,500 INFO L131 PetriNetUnfolder]: For 2606/2606 co-relation queries the response was YES. [2022-12-06 02:44:44,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314929 conditions, 11209 events. 5553/11209 cut-off events. For 2606/2606 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 102763 event pairs, 68 based on Foata normal form. 0/9587 useless extension candidates. Maximal degree in co-relation 303062. Up to 11071 conditions per place. [2022-12-06 02:44:44,601 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 3732 selfloop transitions, 1056 changer transitions 1231/6019 dead transitions. [2022-12-06 02:44:44,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 6019 transitions, 340046 flow [2022-12-06 02:44:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 02:44:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 02:44:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 239 transitions. [2022-12-06 02:44:44,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46862745098039216 [2022-12-06 02:44:44,603 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 645 predicate places. [2022-12-06 02:44:44,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:44,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 665 places, 6019 transitions, 340046 flow [2022-12-06 02:44:44,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 665 places, 6019 transitions, 340046 flow [2022-12-06 02:44:44,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:44,991 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:44,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-06 02:44:44,991 INFO L495 AbstractCegarLoop]: Abstraction has has 665 places, 6019 transitions, 340046 flow [2022-12-06 02:44:44,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:44:44,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:44,992 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:45,007 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 02:44:45,207 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,SelfDestructingSolverStorable26 [2022-12-06 02:44:45,207 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 02:44:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1200296397, now seen corresponding path program 23 times [2022-12-06 02:44:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137304308] [2022-12-06 02:44:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:45,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137304308] [2022-12-06 02:44:45,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137304308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:45,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966214185] [2022-12-06 02:44:45,316 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:44:45,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:45,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:45,332 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 02:44:45,333 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 02:44:45,414 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-06 02:44:45,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:45,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 02:44:45,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:45,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:44:45,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966214185] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:45,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:45,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2022-12-06 02:44:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067557658] [2022-12-06 02:44:45,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:45,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:44:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:44:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:44:45,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 02:44:45,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 6019 transitions, 340046 flow. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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 02:44:45,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:45,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 02:44:45,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:45:24,515 INFO L130 PetriNetUnfolder]: 6763/13696 cut-off events. [2022-12-06 02:45:24,516 INFO L131 PetriNetUnfolder]: For 3127/3127 co-relation queries the response was YES. [2022-12-06 02:45:24,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398538 conditions, 13696 events. 6763/13696 cut-off events. For 3127/3127 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 129325 event pairs, 78 based on Foata normal form. 39/11763 useless extension candidates. Maximal degree in co-relation 384200. Up to 13558 conditions per place. [2022-12-06 02:45:24,631 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 4726 selfloop transitions, 857 changer transitions 1754/7339 dead transitions. [2022-12-06 02:45:24,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 7339 transitions, 429331 flow [2022-12-06 02:45:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:45:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:45:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-12-06 02:45:24,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-06 02:45:24,633 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 655 predicate places. [2022-12-06 02:45:24,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:45:24,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 675 places, 7339 transitions, 429331 flow [2022-12-06 02:45:25,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 675 places, 7339 transitions, 429331 flow [2022-12-06 02:45:25,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:45:25,060 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:45:25,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 427 [2022-12-06 02:45:25,061 INFO L495 AbstractCegarLoop]: Abstraction has has 675 places, 7339 transitions, 429331 flow [2022-12-06 02:45:25,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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 02:45:25,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:45:25,061 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:45:25,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-06 02:45:25,265 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,SelfDestructingSolverStorable27 [2022-12-06 02:45:25,265 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 02:45:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:45:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1701225239, now seen corresponding path program 24 times [2022-12-06 02:45:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:45:25,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346560824] [2022-12-06 02:45:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:45:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:45:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:45:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:25,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:45:25,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346560824] [2022-12-06 02:45:25,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346560824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:45:25,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489673831] [2022-12-06 02:45:25,383 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:45:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:45:25,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:45:25,384 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 02:45:25,405 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 02:45:25,468 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-06 02:45:25,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:45:25,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:45:25,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:45:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:25,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:45:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:45:25,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489673831] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:45:25,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:45:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2022-12-06 02:45:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600933706] [2022-12-06 02:45:25,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:45:25,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:45:25,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:45:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:45:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:45:25,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:45:25,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 7339 transitions, 429331 flow. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:45:25,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:45:25,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:45:25,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:55,349 INFO L130 PetriNetUnfolder]: 11569/23328 cut-off events. [2022-12-06 02:46:55,349 INFO L131 PetriNetUnfolder]: For 5139/5139 co-relation queries the response was YES. [2022-12-06 02:46:55,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702197 conditions, 23328 events. 11569/23328 cut-off events. For 5139/5139 co-relation queries the response was YES. Maximal size of possible extension queue 1740. Compared 234604 event pairs, 130 based on Foata normal form. 0/19890 useless extension candidates. Maximal degree in co-relation 677618. Up to 23170 conditions per place. [2022-12-06 02:46:55,567 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 9186 selfloop transitions, 939 changer transitions 2362/12487 dead transitions. [2022-12-06 02:46:55,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 12487 transitions, 755517 flow [2022-12-06 02:46:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 02:46:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 02:46:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 199 transitions. [2022-12-06 02:46:55,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5102564102564102 [2022-12-06 02:46:55,570 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 680 predicate places. [2022-12-06 02:46:55,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:55,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 700 places, 12487 transitions, 755517 flow [2022-12-06 02:46:56,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 700 places, 12487 transitions, 755517 flow [2022-12-06 02:46:56,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:56,357 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:56,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 788 [2022-12-06 02:46:56,358 INFO L495 AbstractCegarLoop]: Abstraction has has 700 places, 12487 transitions, 755517 flow [2022-12-06 02:46:56,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:56,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:56,358 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:56,362 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 02:46:56,562 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,SelfDestructingSolverStorable28 [2022-12-06 02:46:56,563 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 02:46:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 968633735, now seen corresponding path program 25 times [2022-12-06 02:46:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:56,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898672509] [2022-12-06 02:46:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:56,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898672509] [2022-12-06 02:46:56,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898672509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:56,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377853104] [2022-12-06 02:46:56,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:46:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:56,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:56,689 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 02:46:56,690 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 02:46:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:56,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:46:56,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:56,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:56,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377853104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:56,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:56,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-12-06 02:46:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238533824] [2022-12-06 02:46:56,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:56,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:46:56,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:46:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:46:56,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:46:56,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 12487 transitions, 755517 flow. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:46:56,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:56,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:46:56,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:08,608 INFO L130 PetriNetUnfolder]: 12021/24178 cut-off events. [2022-12-06 02:50:08,609 INFO L131 PetriNetUnfolder]: For 5292/5292 co-relation queries the response was YES. [2022-12-06 02:50:08,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751953 conditions, 24178 events. 12021/24178 cut-off events. For 5292/5292 co-relation queries the response was YES. Maximal size of possible extension queue 1769. Compared 243865 event pairs, 132 based on Foata normal form. 0/20662 useless extension candidates. Maximal degree in co-relation 726693. Up to 24020 conditions per place. [2022-12-06 02:50:08,868 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 9531 selfloop transitions, 1084 changer transitions 2362/12977 dead transitions. [2022-12-06 02:50:08,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 12977 transitions, 811108 flow [2022-12-06 02:50:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-06 02:50:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-06 02:50:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 381 transitions. [2022-12-06 02:50:08,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4379310344827586 [2022-12-06 02:50:08,869 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 737 predicate places. [2022-12-06 02:50:08,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:08,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 757 places, 12977 transitions, 811108 flow [2022-12-06 02:50:09,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 757 places, 12977 transitions, 811108 flow [2022-12-06 02:50:09,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:09,542 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:09,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 673 [2022-12-06 02:50:09,543 INFO L495 AbstractCegarLoop]: Abstraction has has 757 places, 12977 transitions, 811108 flow [2022-12-06 02:50:09,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:50:09,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:09,543 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:09,552 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 02:50:09,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:09,748 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 02:50:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -461303443, now seen corresponding path program 26 times [2022-12-06 02:50:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124314959] [2022-12-06 02:50:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:09,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:09,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124314959] [2022-12-06 02:50:09,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124314959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:50:09,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148465688] [2022-12-06 02:50:09,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:50:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:50:09,871 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 02:50:09,874 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 02:50:09,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:50:09,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:50:09,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:50:09,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:50:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:10,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:50:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:10,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148465688] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:50:10,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:50:10,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-12-06 02:50:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329698014] [2022-12-06 02:50:10,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:50:10,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:50:10,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:10,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:50:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:50:10,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:50:10,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 12977 transitions, 811108 flow. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 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 02:50:10,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:10,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:50:10,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:53:30,055 INFO L130 PetriNetUnfolder]: 12559/25132 cut-off events. [2022-12-06 02:53:30,056 INFO L131 PetriNetUnfolder]: For 5380/5380 co-relation queries the response was YES. [2022-12-06 02:53:30,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806730 conditions, 25132 events. 12559/25132 cut-off events. For 5380/5380 co-relation queries the response was YES. Maximal size of possible extension queue 1892. Compared 254167 event pairs, 122 based on Foata normal form. 0/21516 useless extension candidates. Maximal degree in co-relation 781057. Up to 24974 conditions per place. [2022-12-06 02:53:30,408 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 9612 selfloop transitions, 1401 changer transitions 2522/13535 dead transitions. [2022-12-06 02:53:30,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 820 places, 13535 transitions, 873002 flow [2022-12-06 02:53:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-06 02:53:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-12-06 02:53:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 430 transitions. [2022-12-06 02:53:30,410 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-06 02:53:30,410 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 800 predicate places. [2022-12-06 02:53:30,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:53:30,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 820 places, 13535 transitions, 873002 flow [2022-12-06 02:53:31,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 820 places, 13535 transitions, 873002 flow [2022-12-06 02:53:31,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:53:31,156 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:53:31,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 746 [2022-12-06 02:53:31,156 INFO L495 AbstractCegarLoop]: Abstraction has has 820 places, 13535 transitions, 873002 flow [2022-12-06 02:53:31,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 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 02:53:31,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:53:31,157 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:53:31,165 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 02:53:31,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:53:31,366 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 02:53:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:53:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1387009721, now seen corresponding path program 27 times [2022-12-06 02:53:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:53:31,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692405632] [2022-12-06 02:53:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:53:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:53:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:53:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:31,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:53:31,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692405632] [2022-12-06 02:53:31,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692405632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:53:31,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270752092] [2022-12-06 02:53:31,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:53:31,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:53:31,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:53:31,489 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 02:53:31,490 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 02:53:31,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 02:53:31,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:53:31,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 02:53:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:53:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:31,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:53:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:53:31,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270752092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:53:31,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:53:31,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-12-06 02:53:31,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045507400] [2022-12-06 02:53:31,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:53:31,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:53:31,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:53:31,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:53:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:53:31,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 02:53:31,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 13535 transitions, 873002 flow. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:53:31,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:53:31,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 02:53:31,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:55:20,854 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 02:55:20,854 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:55:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-12-06 02:55:20,874 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:55:20,882 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 02:55:21,079 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,SelfDestructingSolverStorable31 [2022-12-06 02:55:21,079 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 452691 conditions, 13695 events (7182/13694 cut-off events. For 2927/2927 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 138082 event pairs, 30 based on Foata normal form. 0/13139 useless extension candidates. Maximal degree in co-relation 447708. Up to 13536 conditions per place.). [2022-12-06 02:55:21,080 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:55:21,081 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:55:21,081 INFO L458 BasicCegarLoop]: Path program histogram: [27, 4, 1] [2022-12-06 02:55:21,083 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:55:21,083 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:55:21,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:55:21 BasicIcfg [2022-12-06 02:55:21,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:55:21,086 INFO L158 Benchmark]: Toolchain (without parser) took 856793.70ms. Allocated memory was 189.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 165.8MB in the beginning and 462.2MB in the end (delta: -296.4MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 02:55:21,086 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:55:21,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.22ms. Allocated memory is still 189.8MB. Free memory was 165.8MB in the beginning and 154.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 02:55:21,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.56ms. Allocated memory is still 189.8MB. Free memory was 154.4MB in the beginning and 152.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:55:21,086 INFO L158 Benchmark]: Boogie Preprocessor took 27.62ms. Allocated memory is still 189.8MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:55:21,086 INFO L158 Benchmark]: RCFGBuilder took 351.18ms. Allocated memory is still 189.8MB. Free memory was 151.3MB in the beginning and 138.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:55:21,087 INFO L158 Benchmark]: TraceAbstraction took 856182.70ms. Allocated memory was 189.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 137.7MB in the beginning and 462.2MB in the end (delta: -324.5MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 02:55:21,087 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.22ms. Allocated memory is still 189.8MB. Free memory was 165.8MB in the beginning and 154.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.56ms. Allocated memory is still 189.8MB. Free memory was 154.4MB in the beginning and 152.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.62ms. Allocated memory is still 189.8MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.18ms. Allocated memory is still 189.8MB. Free memory was 151.3MB in the beginning and 138.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 856182.70ms. Allocated memory was 189.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 137.7MB in the beginning and 462.2MB in the end (delta: -324.5MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 266, unknown conditional: 0, unknown unconditional: 266] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 22 PlacesBefore, 22 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 30 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, 26 PlacesBefore, 26 PlacesAfterwards, 53 TransitionsBefore, 53 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, 29 PlacesBefore, 29 PlacesAfterwards, 60 TransitionsBefore, 60 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, 35 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 83 TransitionsBefore, 83 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, 42 PlacesBefore, 42 PlacesAfterwards, 119 TransitionsBefore, 119 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, 74 PlacesBefore, 74 PlacesAfterwards, 368 TransitionsBefore, 368 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, 400 TransitionsBefore, 400 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, 100 PlacesBefore, 100 PlacesAfterwards, 488 TransitionsBefore, 488 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, 119 PlacesBefore, 119 PlacesAfterwards, 495 TransitionsBefore, 495 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, 142 PlacesBefore, 142 PlacesAfterwards, 764 TransitionsBefore, 764 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, 165 PlacesBefore, 165 PlacesAfterwards, 934 TransitionsBefore, 934 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, 176 PlacesBefore, 176 PlacesAfterwards, 914 TransitionsBefore, 914 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, 181 PlacesBefore, 181 PlacesAfterwards, 1107 TransitionsBefore, 1107 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, 197 PlacesBefore, 197 PlacesAfterwards, 2165 TransitionsBefore, 2165 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, 224 PlacesBefore, 224 PlacesAfterwards, 2399 TransitionsBefore, 2399 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, 296 PlacesBefore, 296 PlacesAfterwards, 2866 TransitionsBefore, 2866 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, 330 PlacesBefore, 330 PlacesAfterwards, 3122 TransitionsBefore, 3122 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, 373 PlacesBefore, 373 PlacesAfterwards, 3176 TransitionsBefore, 3176 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, 411 PlacesBefore, 411 PlacesAfterwards, 3686 TransitionsBefore, 3686 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, 452 PlacesBefore, 452 PlacesAfterwards, 4187 TransitionsBefore, 4187 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, 487 PlacesBefore, 487 PlacesAfterwards, 4569 TransitionsBefore, 4569 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, 513 PlacesBefore, 513 PlacesAfterwards, 4856 TransitionsBefore, 4856 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, 548 PlacesBefore, 548 PlacesAfterwards, 5081 TransitionsBefore, 5081 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, 577 PlacesBefore, 577 PlacesAfterwards, 5540 TransitionsBefore, 5540 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, 633 PlacesBefore, 633 PlacesAfterwards, 5954 TransitionsBefore, 5954 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, 665 PlacesBefore, 665 PlacesAfterwards, 6019 TransitionsBefore, 6019 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, 675 PlacesBefore, 675 PlacesAfterwards, 7339 TransitionsBefore, 7339 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, 700 PlacesBefore, 700 PlacesAfterwards, 12487 TransitionsBefore, 12487 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, 757 PlacesBefore, 757 PlacesAfterwards, 12977 TransitionsBefore, 12977 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, 820 PlacesBefore, 820 PlacesAfterwards, 13535 TransitionsBefore, 13535 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: 76]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (22states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 452691 conditions, 13695 events (7182/13694 cut-off events. For 2927/2927 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 138082 event pairs, 30 based on Foata normal form. 0/13139 useless extension candidates. Maximal degree in co-relation 447708. Up to 13536 conditions per place.). - TimeoutResultAtElement [Line: 70]: 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 (22states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 452691 conditions, 13695 events (7182/13694 cut-off events. For 2927/2927 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 138082 event pairs, 30 based on Foata normal form. 0/13139 useless extension candidates. Maximal degree in co-relation 447708. Up to 13536 conditions per place.). - TimeoutResultAtElement [Line: 71]: 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 (22states, 0/15 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 452691 conditions, 13695 events (7182/13694 cut-off events. For 2927/2927 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 138082 event pairs, 30 based on Foata normal form. 0/13139 useless extension candidates. Maximal degree in co-relation 447708. Up to 13536 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 95 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: 856.1s, OverallIterations: 32, TraceHistogramMax: 4, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.0s, AutomataDifference: 832.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6849 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6849 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 13.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 851 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22200 IncrementalHoareTripleChecker+Invalid, 23051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 851 mSolverCounterUnsat, 140 mSDtfsCounter, 22200 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2526 GetRequests, 1398 SyntacticMatches, 55 SemanticMatches, 1073 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15105 ImplicationChecksByTransitivity, 38.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=873002occurred in iteration=31, InterpolantAutomatonStates: 833, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 8699 SizeOfPredicates, 90 NumberOfNonLiveVariables, 4070 ConjunctsInSsa, 410 ConjunctsInUnsatCore, 92 InterpolantComputations, 3 PerfectInterpolantSequences, 143/697 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