/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-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 03:19:10,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 03:19:10,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 03:19:10,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 03:19:10,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 03:19:10,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 03:19:10,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 03:19:10,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 03:19:10,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 03:19:10,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 03:19:10,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 03:19:10,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 03:19:10,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 03:19:10,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 03:19:10,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 03:19:10,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 03:19:10,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 03:19:10,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 03:19:10,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 03:19:10,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 03:19:10,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 03:19:10,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 03:19:10,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 03:19:10,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 03:19:10,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 03:19:10,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 03:19:10,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 03:19:10,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 03:19:10,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 03:19:10,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 03:19:10,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 03:19:10,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 03:19:10,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 03:19:10,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 03:19:10,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 03:19:10,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 03:19:10,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 03:19:10,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 03:19:10,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 03:19:10,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 03:19:10,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 03:19:10,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 03:19:10,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 03:19:10,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 03:19:10,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 03:19:10,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 03:19:10,818 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 03:19:10,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 03:19:10,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 03:19:10,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 03:19:10,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 03:19:10,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 03:19:10,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 03:19:10,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:19:10,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 03:19:10,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 03:19:10,822 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 03:19:10,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 03:19:11,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 03:19:11,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 03:19:11,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 03:19:11,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 03:19:11,109 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 03:19:11,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-06 03:19:12,130 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 03:19:12,320 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 03:19:12,321 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-06 03:19:12,325 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839ea93d/3eddabf55a4443958461482a1d69ff94/FLAG2ba3c634d [2022-12-06 03:19:12,338 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8839ea93d/3eddabf55a4443958461482a1d69ff94 [2022-12-06 03:19:12,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 03:19:12,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 03:19:12,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 03:19:12,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 03:19:12,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 03:19:12,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378193bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12, skipping insertion in model container [2022-12-06 03:19:12,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 03:19:12,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 03:19:12,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:19:12,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:19:12,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:19:12,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:19:12,493 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-simple-queue.wvr.c[2438,2451] [2022-12-06 03:19:12,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:19:12,512 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 03:19:12,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:19:12,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:19:12,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 03:19:12,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 03:19:12,542 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-simple-queue.wvr.c[2438,2451] [2022-12-06 03:19:12,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 03:19:12,556 INFO L208 MainTranslator]: Completed translation [2022-12-06 03:19:12,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12 WrapperNode [2022-12-06 03:19:12,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 03:19:12,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 03:19:12,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 03:19:12,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 03:19:12,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,607 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 128 [2022-12-06 03:19:12,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 03:19:12,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 03:19:12,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 03:19:12,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 03:19:12,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,639 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 03:19:12,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 03:19:12,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 03:19:12,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 03:19:12,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (1/1) ... [2022-12-06 03:19:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 03:19:12,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:12,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 03:19:12,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 03:19:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 03:19:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 03:19:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 03:19:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 03:19:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 03:19:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 03:19:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 03:19:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 03:19:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 03:19:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 03:19:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 03:19:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 03:19:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 03:19:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 03:19:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 03:19:12,703 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 03:19:12,820 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 03:19:12,822 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 03:19:12,985 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 03:19:13,050 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 03:19:13,051 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 03:19:13,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:19:13 BoogieIcfgContainer [2022-12-06 03:19:13,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 03:19:13,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 03:19:13,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 03:19:13,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 03:19:13,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 03:19:12" (1/3) ... [2022-12-06 03:19:13,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b955018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:19:13, skipping insertion in model container [2022-12-06 03:19:13,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:19:12" (2/3) ... [2022-12-06 03:19:13,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b955018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 03:19:13, skipping insertion in model container [2022-12-06 03:19:13,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:19:13" (3/3) ... [2022-12-06 03:19:13,062 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2022-12-06 03:19:13,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 03:19:13,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 03:19:13,075 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 03:19:13,116 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 03:19:13,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 236 flow [2022-12-06 03:19:13,185 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2022-12-06 03:19:13,185 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:19:13,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 03:19:13,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 110 transitions, 236 flow [2022-12-06 03:19:13,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 100 transitions, 212 flow [2022-12-06 03:19:13,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:13,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-06 03:19:13,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 100 transitions, 212 flow [2022-12-06 03:19:13,234 INFO L130 PetriNetUnfolder]: 9/100 cut-off events. [2022-12-06 03:19:13,234 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:19:13,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 03:19:13,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-06 03:19:13,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 03:19:16,866 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-06 03:19:16,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 03:19:16,882 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;@4429fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 03:19:16,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 03:19:16,885 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 03:19:16,886 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 03:19:16,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:16,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:16,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:16,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1143381871, now seen corresponding path program 1 times [2022-12-06 03:19:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:16,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275915148] [2022-12-06 03:19:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:17,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275915148] [2022-12-06 03:19:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275915148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:19:17,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:19:17,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 03:19:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148432209] [2022-12-06 03:19:17,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:19:17,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:19:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:19:17,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:19:17,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:19:17,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:17,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:17,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:19:17,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:17,203 INFO L130 PetriNetUnfolder]: 38/71 cut-off events. [2022-12-06 03:19:17,203 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 03:19:17,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 71 events. 38/71 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 9 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 100. Up to 37 conditions per place. [2022-12-06 03:19:17,205 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2022-12-06 03:19:17,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 110 flow [2022-12-06 03:19:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:19:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:19:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 03:19:17,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 03:19:17,215 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 2 predicate places. [2022-12-06 03:19:17,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:17,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 23 transitions, 110 flow [2022-12-06 03:19:17,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 23 transitions, 110 flow [2022-12-06 03:19:17,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:17,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:17,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 03:19:17,220 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 23 transitions, 110 flow [2022-12-06 03:19:17,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:17,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:17,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:17,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 03:19:17,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1742405358, now seen corresponding path program 1 times [2022-12-06 03:19:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436627915] [2022-12-06 03:19:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:17,397 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 03:19:17,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:17,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436627915] [2022-12-06 03:19:17,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436627915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:19:17,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:19:17,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 03:19:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833941609] [2022-12-06 03:19:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:19:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 03:19:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 03:19:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 03:19:17,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:19:17,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 23 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:17,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:17,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:19:17,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:17,449 INFO L130 PetriNetUnfolder]: 52/102 cut-off events. [2022-12-06 03:19:17,449 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 03:19:17,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 102 events. 52/102 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 259 event pairs, 9 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 224. Up to 74 conditions per place. [2022-12-06 03:19:17,450 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 23 selfloop transitions, 2 changer transitions 7/32 dead transitions. [2022-12-06 03:19:17,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 32 transitions, 219 flow [2022-12-06 03:19:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 03:19:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 03:19:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 03:19:17,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 03:19:17,451 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 4 predicate places. [2022-12-06 03:19:17,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:17,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 32 transitions, 219 flow [2022-12-06 03:19:17,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 32 transitions, 219 flow [2022-12-06 03:19:17,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:17,453 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:17,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 03:19:17,454 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 32 transitions, 219 flow [2022-12-06 03:19:17,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:17,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:17,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:17,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 03:19:17,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:17,455 INFO L85 PathProgramCache]: Analyzing trace with hash -433595135, now seen corresponding path program 1 times [2022-12-06 03:19:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:17,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435451247] [2022-12-06 03:19:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:19:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:17,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435451247] [2022-12-06 03:19:17,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435451247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:19:17,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:19:17,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 03:19:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271471112] [2022-12-06 03:19:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:19:17,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 03:19:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 03:19:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 03:19:17,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 03:19:17,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 32 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 03:19:17,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:17,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 03:19:17,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:17,588 INFO L130 PetriNetUnfolder]: 61/130 cut-off events. [2022-12-06 03:19:17,588 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 03:19:17,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 130 events. 61/130 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 368 event pairs, 18 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 296. Up to 103 conditions per place. [2022-12-06 03:19:17,590 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 24 selfloop transitions, 2 changer transitions 17/43 dead transitions. [2022-12-06 03:19:17,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 43 transitions, 383 flow [2022-12-06 03:19:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 03:19:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 03:19:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 03:19:17,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 03:19:17,591 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 7 predicate places. [2022-12-06 03:19:17,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:17,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 43 transitions, 383 flow [2022-12-06 03:19:17,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 43 transitions, 383 flow [2022-12-06 03:19:17,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:19,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:19:19,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1506 [2022-12-06 03:19:19,097 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 42 transitions, 375 flow [2022-12-06 03:19:19,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 03:19:19,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:19,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:19,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 03:19:19,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1444712385, now seen corresponding path program 1 times [2022-12-06 03:19:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:19,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251120710] [2022-12-06 03:19:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:19,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251120710] [2022-12-06 03:19:19,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251120710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862363026] [2022-12-06 03:19:19,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:19,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:19,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:19,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 03:19:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:19,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 03:19:19,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:19,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:19,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:19,667 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 03:19:19,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-12-06 03:19:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:19,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862363026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:19,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:19,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 03:19:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25750717] [2022-12-06 03:19:19,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:19,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:19:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:19:19,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:19:19,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 03:19:19,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 42 transitions, 375 flow. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:19,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:19,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 03:19:19,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:20,080 INFO L130 PetriNetUnfolder]: 232/450 cut-off events. [2022-12-06 03:19:20,081 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 03:19:20,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 450 events. 232/450 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1971 event pairs, 35 based on Foata normal form. 3/320 useless extension candidates. Maximal degree in co-relation 1260. Up to 424 conditions per place. [2022-12-06 03:19:20,085 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 77 selfloop transitions, 21 changer transitions 36/134 dead transitions. [2022-12-06 03:19:20,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 134 transitions, 1457 flow [2022-12-06 03:19:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 03:19:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 03:19:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-12-06 03:19:20,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5432692307692307 [2022-12-06 03:19:20,089 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 18 predicate places. [2022-12-06 03:19:20,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:20,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 134 transitions, 1457 flow [2022-12-06 03:19:20,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 134 transitions, 1457 flow [2022-12-06 03:19:20,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:21,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:19:21,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1831 [2022-12-06 03:19:21,922 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 133 transitions, 1447 flow [2022-12-06 03:19:21,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:21,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:21,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:21,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:22,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:22,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1345891685, now seen corresponding path program 1 times [2022-12-06 03:19:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:22,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954216692] [2022-12-06 03:19:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954216692] [2022-12-06 03:19:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954216692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621736324] [2022-12-06 03:19:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:22,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:22,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 03:19:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:22,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 03:19:22,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:22,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 03:19:22,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:22,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:22,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:19:22,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:22,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:22,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621736324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:22,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:22,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 03:19:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232330079] [2022-12-06 03:19:22,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:22,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:19:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:22,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:19:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=93, Unknown=2, NotChecked=0, Total=132 [2022-12-06 03:19:22,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 03:19:22,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 133 transitions, 1447 flow. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 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 03:19:22,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:22,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 03:19:22,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:23,085 INFO L130 PetriNetUnfolder]: 315/600 cut-off events. [2022-12-06 03:19:23,085 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 03:19:23,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 600 events. 315/600 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2853 event pairs, 39 based on Foata normal form. 3/418 useless extension candidates. Maximal degree in co-relation 1748. Up to 574 conditions per place. [2022-12-06 03:19:23,088 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 107 selfloop transitions, 23 changer transitions 46/176 dead transitions. [2022-12-06 03:19:23,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 176 transitions, 2262 flow [2022-12-06 03:19:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:19:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:19:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2022-12-06 03:19:23,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5026737967914439 [2022-12-06 03:19:23,090 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 27 predicate places. [2022-12-06 03:19:23,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:23,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 176 transitions, 2262 flow [2022-12-06 03:19:23,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 176 transitions, 2262 flow [2022-12-06 03:19:23,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:25,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:19:25,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1924 [2022-12-06 03:19:25,014 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 175 transitions, 2250 flow [2022-12-06 03:19:25,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 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 03:19:25,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:25,014 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:25,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 03:19:25,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:25,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1376621692, now seen corresponding path program 2 times [2022-12-06 03:19:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:25,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084708739] [2022-12-06 03:19:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:25,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:25,367 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 03:19:25,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084708739] [2022-12-06 03:19:25,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084708739] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314207410] [2022-12-06 03:19:25,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:19:25,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:25,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:25,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:25,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 03:19:25,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:19:25,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:25,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:19:25,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:25,452 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 03:19:25,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:25,502 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 03:19:25,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314207410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:25,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:25,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-12-06 03:19:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113448938] [2022-12-06 03:19:25,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 03:19:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 03:19:25,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 03:19:25,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:19:25,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 175 transitions, 2250 flow. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:25,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:25,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:19:25,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:25,681 INFO L130 PetriNetUnfolder]: 337/679 cut-off events. [2022-12-06 03:19:25,681 INFO L131 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2022-12-06 03:19:25,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4881 conditions, 679 events. 337/679 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3554 event pairs, 43 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1700. Up to 653 conditions per place. [2022-12-06 03:19:25,684 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 64 selfloop transitions, 13 changer transitions 125/202 dead transitions. [2022-12-06 03:19:25,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 202 transitions, 3008 flow [2022-12-06 03:19:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:19:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:19:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-12-06 03:19:25,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-06 03:19:25,685 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 30 predicate places. [2022-12-06 03:19:25,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:25,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 202 transitions, 3008 flow [2022-12-06 03:19:25,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 202 transitions, 3008 flow [2022-12-06 03:19:25,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:25,692 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:25,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 03:19:25,693 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 202 transitions, 3008 flow [2022-12-06 03:19:25,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:25,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:25,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:25,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:25,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:25,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:25,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1932697699, now seen corresponding path program 1 times [2022-12-06 03:19:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:25,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921395231] [2022-12-06 03:19:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921395231] [2022-12-06 03:19:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921395231] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051289332] [2022-12-06 03:19:26,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:26,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:26,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 03:19:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:26,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 03:19:26,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:26,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:19:26,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:26,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:26,429 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_181 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))) is different from false [2022-12-06 03:19:26,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:19:26,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-12-06 03:19:26,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-06 03:19:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 03:19:26,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051289332] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:26,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:26,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 03:19:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267627994] [2022-12-06 03:19:26,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:26,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:19:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:19:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2022-12-06 03:19:26,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:19:26,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 202 transitions, 3008 flow. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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 03:19:26,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:26,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:19:26,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:26,747 INFO L130 PetriNetUnfolder]: 540/1059 cut-off events. [2022-12-06 03:19:26,747 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-06 03:19:26,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8660 conditions, 1059 events. 540/1059 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6003 event pairs, 56 based on Foata normal form. 3/765 useless extension candidates. Maximal degree in co-relation 2260. Up to 1033 conditions per place. [2022-12-06 03:19:26,752 INFO L137 encePairwiseOnDemand]: 4/18 looper letters, 116 selfloop transitions, 23 changer transitions 171/310 dead transitions. [2022-12-06 03:19:26,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 310 transitions, 5230 flow [2022-12-06 03:19:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:19:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:19:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 03:19:26,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 03:19:26,754 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 36 predicate places. [2022-12-06 03:19:26,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:26,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 310 transitions, 5230 flow [2022-12-06 03:19:26,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 310 transitions, 5230 flow [2022-12-06 03:19:26,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:26,762 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:26,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 03:19:26,763 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 310 transitions, 5230 flow [2022-12-06 03:19:26,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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 03:19:26,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:26,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:26,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:26,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:26,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 911938125, now seen corresponding path program 1 times [2022-12-06 03:19:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:26,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798048137] [2022-12-06 03:19:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:27,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798048137] [2022-12-06 03:19:27,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798048137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:27,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294241242] [2022-12-06 03:19:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:27,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:27,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:27,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:27,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 03:19:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:27,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 03:19:27,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:27,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:27,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:19:27,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:27,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:27,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))) is different from false [2022-12-06 03:19:27,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:19:27,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-12-06 03:19:27,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-06 03:19:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 03:19:27,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294241242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:27,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:27,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 03:19:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333419545] [2022-12-06 03:19:27,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:19:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:19:27,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=128, Unknown=1, NotChecked=22, Total=182 [2022-12-06 03:19:27,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:19:27,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 310 transitions, 5230 flow. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 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 03:19:27,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:27,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:19:27,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:27,988 INFO L130 PetriNetUnfolder]: 672/1312 cut-off events. [2022-12-06 03:19:27,988 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-06 03:19:27,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12043 conditions, 1312 events. 672/1312 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7832 event pairs, 69 based on Foata normal form. 3/942 useless extension candidates. Maximal degree in co-relation 2864. Up to 1286 conditions per place. [2022-12-06 03:19:27,994 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 150 selfloop transitions, 28 changer transitions 203/381 dead transitions. [2022-12-06 03:19:27,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 381 transitions, 7194 flow [2022-12-06 03:19:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 03:19:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 03:19:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-12-06 03:19:27,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 03:19:27,997 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 43 predicate places. [2022-12-06 03:19:27,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:27,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 381 transitions, 7194 flow [2022-12-06 03:19:28,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 381 transitions, 7194 flow [2022-12-06 03:19:28,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:28,011 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:28,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 03:19:28,012 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 381 transitions, 7194 flow [2022-12-06 03:19:28,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 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 03:19:28,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:28,012 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:28,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:28,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:28,217 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1213180205, now seen corresponding path program 2 times [2022-12-06 03:19:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:28,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134947972] [2022-12-06 03:19:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:28,527 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 03:19:28,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:28,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134947972] [2022-12-06 03:19:28,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134947972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:28,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981321132] [2022-12-06 03:19:28,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:19:28,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:28,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:28,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 03:19:28,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:19:28,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:28,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 03:19:28,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:28,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 03:19:28,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:28,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:28,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 03:19:28,731 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 03:19:28,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:28,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981321132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:28,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:28,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2022-12-06 03:19:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603973841] [2022-12-06 03:19:28,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:28,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:19:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:19:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=162, Unknown=1, NotChecked=0, Total=210 [2022-12-06 03:19:28,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 03:19:28,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 381 transitions, 7194 flow. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:28,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:28,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 03:19:28,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:29,571 INFO L130 PetriNetUnfolder]: 922/1791 cut-off events. [2022-12-06 03:19:29,571 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-06 03:19:29,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18213 conditions, 1791 events. 922/1791 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11376 event pairs, 77 based on Foata normal form. 5/1279 useless extension candidates. Maximal degree in co-relation 5068. Up to 1765 conditions per place. [2022-12-06 03:19:29,580 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 190 selfloop transitions, 43 changer transitions 283/516 dead transitions. [2022-12-06 03:19:29,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 516 transitions, 10770 flow [2022-12-06 03:19:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:19:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:19:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 162 transitions. [2022-12-06 03:19:29,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 03:19:29,582 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 61 predicate places. [2022-12-06 03:19:29,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:29,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 516 transitions, 10770 flow [2022-12-06 03:19:29,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 516 transitions, 10770 flow [2022-12-06 03:19:29,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:31,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:19:31,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2395 [2022-12-06 03:19:31,977 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 515 transitions, 10750 flow [2022-12-06 03:19:31,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:31,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:31,977 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:32,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 03:19:32,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:32,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash -792183677, now seen corresponding path program 3 times [2022-12-06 03:19:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:32,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415727026] [2022-12-06 03:19:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:32,521 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 03:19:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:32,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415727026] [2022-12-06 03:19:32,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415727026] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:32,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100040178] [2022-12-06 03:19:32,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:19:32,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:32,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:32,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:32,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 03:19:32,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:19:32,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:32,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 03:19:32,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:32,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:32,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:19:32,761 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 03:19:32,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-06 03:19:32,764 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 03:19:32,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:32,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:19:32,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2022-12-06 03:19:32,873 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 03:19:32,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100040178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:32,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:32,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 03:19:32,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904660603] [2022-12-06 03:19:32,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:32,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 03:19:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:32,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 03:19:32,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-12-06 03:19:32,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:19:32,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 515 transitions, 10750 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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 03:19:32,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:32,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:19:32,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:33,950 INFO L130 PetriNetUnfolder]: 1434/2763 cut-off events. [2022-12-06 03:19:33,951 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-06 03:19:33,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30802 conditions, 2763 events. 1434/2763 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18523 event pairs, 81 based on Foata normal form. 6/1950 useless extension candidates. Maximal degree in co-relation 11292. Up to 2737 conditions per place. [2022-12-06 03:19:33,963 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 324 selfloop transitions, 88 changer transitions 381/793 dead transitions. [2022-12-06 03:19:33,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 793 transitions, 18106 flow [2022-12-06 03:19:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 03:19:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 03:19:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 198 transitions. [2022-12-06 03:19:33,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 03:19:33,965 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 81 predicate places. [2022-12-06 03:19:33,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:33,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 793 transitions, 18106 flow [2022-12-06 03:19:33,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 793 transitions, 18106 flow [2022-12-06 03:19:33,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:33,989 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:33,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 03:19:33,989 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 793 transitions, 18106 flow [2022-12-06 03:19:33,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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 03:19:33,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:33,989 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:33,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:34,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:34,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -66683473, now seen corresponding path program 1 times [2022-12-06 03:19:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:34,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540046694] [2022-12-06 03:19:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:34,529 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 03:19:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540046694] [2022-12-06 03:19:34,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540046694] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673195124] [2022-12-06 03:19:34,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:34,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:34,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:34,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 03:19:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:34,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 03:19:34,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:34,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:34,650 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 03:19:34,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:34,665 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 03:19:34,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-12-06 03:19:34,677 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 03:19:34,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673195124] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:34,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:34,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 03:19:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587872040] [2022-12-06 03:19:34,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 03:19:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 03:19:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-06 03:19:34,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:19:34,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 793 transitions, 18106 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 03:19:34,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:34,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:19:34,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:35,584 INFO L130 PetriNetUnfolder]: 1694/3233 cut-off events. [2022-12-06 03:19:35,584 INFO L131 PetriNetUnfolder]: For 510/510 co-relation queries the response was YES. [2022-12-06 03:19:35,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39262 conditions, 3233 events. 1694/3233 cut-off events. For 510/510 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22119 event pairs, 81 based on Foata normal form. 5/2257 useless extension candidates. Maximal degree in co-relation 13756. Up to 3207 conditions per place. [2022-12-06 03:19:35,599 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 411 selfloop transitions, 81 changer transitions 429/921 dead transitions. [2022-12-06 03:19:35,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 921 transitions, 22866 flow [2022-12-06 03:19:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:19:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:19:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-12-06 03:19:35,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4763157894736842 [2022-12-06 03:19:35,602 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 100 predicate places. [2022-12-06 03:19:35,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:35,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 921 transitions, 22866 flow [2022-12-06 03:19:35,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 921 transitions, 22866 flow [2022-12-06 03:19:35,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:35,628 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:35,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 03:19:35,629 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 921 transitions, 22866 flow [2022-12-06 03:19:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 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 03:19:35,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:35,630 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:35,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:35,835 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,SelfDestructingSolverStorable10 [2022-12-06 03:19:35,835 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2072047355, now seen corresponding path program 2 times [2022-12-06 03:19:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:35,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311634862] [2022-12-06 03:19:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:36,209 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 03:19:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311634862] [2022-12-06 03:19:36,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311634862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679399396] [2022-12-06 03:19:36,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:19:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:36,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:36,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:36,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 03:19:36,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:19:36,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:36,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 03:19:36,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:36,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:36,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:19:36,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:36,365 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 03:19:36,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:36,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:19:36,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-06 03:19:36,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 03:19:36,452 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 03:19:36,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679399396] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:36,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:36,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 03:19:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116170340] [2022-12-06 03:19:36,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:19:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:19:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=198, Unknown=2, NotChecked=0, Total=240 [2022-12-06 03:19:36,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:19:36,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 921 transitions, 22866 flow. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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 03:19:36,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:36,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:19:36,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:37,517 INFO L130 PetriNetUnfolder]: 1980/3766 cut-off events. [2022-12-06 03:19:37,518 INFO L131 PetriNetUnfolder]: For 603/603 co-relation queries the response was YES. [2022-12-06 03:19:37,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49482 conditions, 3766 events. 1980/3766 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26328 event pairs, 81 based on Foata normal form. 1/2614 useless extension candidates. Maximal degree in co-relation 16460. Up to 3740 conditions per place. [2022-12-06 03:19:37,533 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 494 selfloop transitions, 91 changer transitions 485/1070 dead transitions. [2022-12-06 03:19:37,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1070 transitions, 28696 flow [2022-12-06 03:19:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 03:19:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 03:19:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-12-06 03:19:37,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46411483253588515 [2022-12-06 03:19:37,536 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 110 predicate places. [2022-12-06 03:19:37,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:37,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 1070 transitions, 28696 flow [2022-12-06 03:19:37,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 1070 transitions, 28696 flow [2022-12-06 03:19:37,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:37,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:37,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 03:19:37,566 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 1070 transitions, 28696 flow [2022-12-06 03:19:37,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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 03:19:37,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:37,566 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:37,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:37,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:37,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1048322592, now seen corresponding path program 4 times [2022-12-06 03:19:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:37,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256644297] [2022-12-06 03:19:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:37,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256644297] [2022-12-06 03:19:37,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256644297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:37,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185449856] [2022-12-06 03:19:37,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:19:37,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:37,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:37,843 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:37,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 03:19:37,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:19:37,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:37,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 03:19:37,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:19:37,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:19:38,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185449856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:38,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:38,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 03:19:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016725012] [2022-12-06 03:19:38,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:38,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:19:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:19:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:19:38,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:19:38,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 1070 transitions, 28696 flow. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:38,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:38,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:19:38,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:39,223 INFO L130 PetriNetUnfolder]: 2282/4445 cut-off events. [2022-12-06 03:19:39,224 INFO L131 PetriNetUnfolder]: For 724/724 co-relation queries the response was YES. [2022-12-06 03:19:39,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62863 conditions, 4445 events. 2282/4445 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33360 event pairs, 85 based on Foata normal form. 0/3166 useless extension candidates. Maximal degree in co-relation 13076. Up to 4419 conditions per place. [2022-12-06 03:19:39,241 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 302 selfloop transitions, 106 changer transitions 864/1272 dead transitions. [2022-12-06 03:19:39,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 1272 transitions, 36678 flow [2022-12-06 03:19:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:19:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:19:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2022-12-06 03:19:39,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 03:19:39,242 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 121 predicate places. [2022-12-06 03:19:39,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:39,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 1272 transitions, 36678 flow [2022-12-06 03:19:39,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 1272 transitions, 36678 flow [2022-12-06 03:19:39,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:39,339 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:39,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 03:19:39,339 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 1272 transitions, 36678 flow [2022-12-06 03:19:39,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:39,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:39,341 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:39,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:39,547 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,SelfDestructingSolverStorable12 [2022-12-06 03:19:39,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash 282574577, now seen corresponding path program 1 times [2022-12-06 03:19:39,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:39,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116855371] [2022-12-06 03:19:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:39,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:40,135 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 03:19:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116855371] [2022-12-06 03:19:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116855371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583109868] [2022-12-06 03:19:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:40,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:40,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:40,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 03:19:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:40,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 03:19:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:19:40,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:19:40,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:40,349 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 03:19:40,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:40,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_461) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)))) is different from false [2022-12-06 03:19:40,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:19:40,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-06 03:19:40,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 03:19:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 03:19:40,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583109868] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:40,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:40,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 03:19:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89262190] [2022-12-06 03:19:40,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:40,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:19:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:40,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:19:40,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=266, Unknown=1, NotChecked=32, Total=342 [2022-12-06 03:19:40,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 03:19:40,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 1272 transitions, 36678 flow. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:40,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:40,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 03:19:40,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:42,297 INFO L130 PetriNetUnfolder]: 2649/5126 cut-off events. [2022-12-06 03:19:42,297 INFO L131 PetriNetUnfolder]: For 844/844 co-relation queries the response was YES. [2022-12-06 03:19:42,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77628 conditions, 5126 events. 2649/5126 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 39349 event pairs, 102 based on Foata normal form. 4/3629 useless extension candidates. Maximal degree in co-relation 14008. Up to 5100 conditions per place. [2022-12-06 03:19:42,316 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 405 selfloop transitions, 112 changer transitions 945/1462 dead transitions. [2022-12-06 03:19:42,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1462 transitions, 45084 flow [2022-12-06 03:19:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 03:19:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 03:19:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 120 transitions. [2022-12-06 03:19:42,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45112781954887216 [2022-12-06 03:19:42,317 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 134 predicate places. [2022-12-06 03:19:42,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:42,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 1462 transitions, 45084 flow [2022-12-06 03:19:42,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 1462 transitions, 45084 flow [2022-12-06 03:19:42,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:45,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:19:45,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3146 [2022-12-06 03:19:45,463 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 1461 transitions, 45054 flow [2022-12-06 03:19:45,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:45,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:45,464 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:45,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:45,669 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,SelfDestructingSolverStorable13 [2022-12-06 03:19:45,669 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:45,670 INFO L85 PathProgramCache]: Analyzing trace with hash 397956493, now seen corresponding path program 3 times [2022-12-06 03:19:45,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:45,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078321060] [2022-12-06 03:19:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:45,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078321060] [2022-12-06 03:19:45,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078321060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:45,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887529999] [2022-12-06 03:19:45,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:19:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:45,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:45,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 03:19:46,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:19:46,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:46,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 03:19:46,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:46,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 03:19:46,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:46,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:46,344 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-06 03:19:46,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2022-12-06 03:19:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:46,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:46,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887529999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:46,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:46,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-12-06 03:19:46,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824409936] [2022-12-06 03:19:46,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:46,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:19:46,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:19:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=423, Unknown=1, NotChecked=0, Total=506 [2022-12-06 03:19:46,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:19:46,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1461 transitions, 45054 flow. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:46,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:46,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:19:46,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:52,666 INFO L130 PetriNetUnfolder]: 4853/9321 cut-off events. [2022-12-06 03:19:52,666 INFO L131 PetriNetUnfolder]: For 1485/1485 co-relation queries the response was YES. [2022-12-06 03:19:52,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150345 conditions, 9321 events. 4853/9321 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 76689 event pairs, 106 based on Foata normal form. 22/6545 useless extension candidates. Maximal degree in co-relation 48360. Up to 9295 conditions per place. [2022-12-06 03:19:52,701 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 982 selfloop transitions, 244 changer transitions 1435/2661 dead transitions. [2022-12-06 03:19:52,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 2661 transitions, 87291 flow [2022-12-06 03:19:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-06 03:19:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-06 03:19:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 629 transitions. [2022-12-06 03:19:52,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44295774647887326 [2022-12-06 03:19:52,703 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 203 predicate places. [2022-12-06 03:19:52,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:52,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 2661 transitions, 87291 flow [2022-12-06 03:19:52,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 2661 transitions, 87291 flow [2022-12-06 03:19:52,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:52,793 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:52,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 03:19:52,794 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 2661 transitions, 87291 flow [2022-12-06 03:19:52,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:52,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:52,794 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:52,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 03:19:52,997 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,SelfDestructingSolverStorable14 [2022-12-06 03:19:52,998 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 711033933, now seen corresponding path program 4 times [2022-12-06 03:19:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:52,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415296448] [2022-12-06 03:19:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:53,252 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 03:19:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415296448] [2022-12-06 03:19:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415296448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8593791] [2022-12-06 03:19:53,253 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:19:53,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:53,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:53,260 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:53,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 03:19:53,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:19:53,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:53,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 03:19:53,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:53,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:19:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:53,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:53,482 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 03:19:53,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-12-06 03:19:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:53,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8593791] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:53,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:53,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-06 03:19:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101538064] [2022-12-06 03:19:53,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:19:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:19:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-06 03:19:53,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:19:53,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 2661 transitions, 87291 flow. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:53,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:53,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:19:53,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:19:57,883 INFO L130 PetriNetUnfolder]: 2958/5926 cut-off events. [2022-12-06 03:19:57,883 INFO L131 PetriNetUnfolder]: For 1083/1083 co-relation queries the response was YES. [2022-12-06 03:19:57,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101618 conditions, 5926 events. 2958/5926 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 48383 event pairs, 110 based on Foata normal form. 8/4349 useless extension candidates. Maximal degree in co-relation 22408. Up to 5900 conditions per place. [2022-12-06 03:19:57,904 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 471 selfloop transitions, 190 changer transitions 1035/1696 dead transitions. [2022-12-06 03:19:57,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1696 transitions, 59125 flow [2022-12-06 03:19:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 03:19:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 03:19:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 371 transitions. [2022-12-06 03:19:57,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4524390243902439 [2022-12-06 03:19:57,906 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 195 predicate places. [2022-12-06 03:19:57,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:19:57,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 1696 transitions, 59125 flow [2022-12-06 03:19:57,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 1696 transitions, 59125 flow [2022-12-06 03:19:57,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:19:57,964 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:19:57,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 03:19:57,965 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 1696 transitions, 59125 flow [2022-12-06 03:19:57,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:57,965 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:19:57,965 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:19:57,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 03:19:58,166 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,SelfDestructingSolverStorable15 [2022-12-06 03:19:58,166 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:19:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:19:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash -104056105, now seen corresponding path program 5 times [2022-12-06 03:19:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:19:58,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407010279] [2022-12-06 03:19:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:19:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:19:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:19:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:19:58,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407010279] [2022-12-06 03:19:58,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407010279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:19:58,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10539262] [2022-12-06 03:19:58,520 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:19:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:19:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:19:58,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:19:58,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:19:58,627 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:19:58,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:19:58,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 03:19:58,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:19:58,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 03:19:58,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:58,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:19:58,785 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 03:19:58,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-06 03:19:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:58,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:19:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:19:59,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10539262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:19:59,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:19:59,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-12-06 03:19:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636637207] [2022-12-06 03:19:59,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:19:59,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 03:19:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:19:59,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 03:19:59,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=1, NotChecked=0, Total=506 [2022-12-06 03:19:59,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:19:59,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1696 transitions, 59125 flow. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:19:59,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:19:59,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:19:59,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:02,834 INFO L130 PetriNetUnfolder]: 3001/6022 cut-off events. [2022-12-06 03:20:02,835 INFO L131 PetriNetUnfolder]: For 1112/1112 co-relation queries the response was YES. [2022-12-06 03:20:02,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109285 conditions, 6022 events. 3001/6022 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 49196 event pairs, 105 based on Foata normal form. 2/4420 useless extension candidates. Maximal degree in co-relation 23724. Up to 5996 conditions per place. [2022-12-06 03:20:02,860 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 562 selfloop transitions, 60 changer transitions 1105/1727 dead transitions. [2022-12-06 03:20:02,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1727 transitions, 63657 flow [2022-12-06 03:20:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 03:20:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 03:20:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 259 transitions. [2022-12-06 03:20:02,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4046875 [2022-12-06 03:20:02,862 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 226 predicate places. [2022-12-06 03:20:02,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:02,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 1727 transitions, 63657 flow [2022-12-06 03:20:02,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 1727 transitions, 63657 flow [2022-12-06 03:20:02,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:02,926 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:20:02,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 03:20:02,926 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1727 transitions, 63657 flow [2022-12-06 03:20:02,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:02,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:02,927 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:02,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 03:20:03,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:03,132 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:20:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash -674807905, now seen corresponding path program 6 times [2022-12-06 03:20:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:03,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650484942] [2022-12-06 03:20:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650484942] [2022-12-06 03:20:03,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650484942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:03,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194036766] [2022-12-06 03:20:03,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:20:03,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:03,466 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:20:03,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:20:03,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:20:03,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:20:03,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 03:20:03,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:03,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 03:20:03,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:20:03,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:20:03,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 03:20:03,772 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-06 03:20:03,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-06 03:20:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:03,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:03,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194036766] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:03,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:03,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 03:20:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522800450] [2022-12-06 03:20:03,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:03,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 03:20:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 03:20:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=469, Unknown=1, NotChecked=0, Total=552 [2022-12-06 03:20:03,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:20:03,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1727 transitions, 63657 flow. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:03,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:03,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:20:03,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:07,329 INFO L130 PetriNetUnfolder]: 3013/6047 cut-off events. [2022-12-06 03:20:07,330 INFO L131 PetriNetUnfolder]: For 1114/1114 co-relation queries the response was YES. [2022-12-06 03:20:07,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115786 conditions, 6047 events. 3013/6047 cut-off events. For 1114/1114 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 49455 event pairs, 113 based on Foata normal form. 1/4438 useless extension candidates. Maximal degree in co-relation 25040. Up to 6021 conditions per place. [2022-12-06 03:20:07,351 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 574 selfloop transitions, 53 changer transitions 1107/1734 dead transitions. [2022-12-06 03:20:07,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1734 transitions, 67383 flow [2022-12-06 03:20:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 03:20:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 03:20:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 171 transitions. [2022-12-06 03:20:07,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 03:20:07,353 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 246 predicate places. [2022-12-06 03:20:07,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:07,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 1734 transitions, 67383 flow [2022-12-06 03:20:07,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 1734 transitions, 67383 flow [2022-12-06 03:20:07,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:07,415 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:20:07,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 03:20:07,416 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 1734 transitions, 67383 flow [2022-12-06 03:20:07,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:07,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:07,416 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:07,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 03:20:07,620 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,SelfDestructingSolverStorable17 [2022-12-06 03:20:07,620 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:20:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2031811489, now seen corresponding path program 1 times [2022-12-06 03:20:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612232775] [2022-12-06 03:20:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:08,096 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 03:20:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:08,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612232775] [2022-12-06 03:20:08,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612232775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:08,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949062677] [2022-12-06 03:20:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:08,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:08,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:08,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:20:08,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:20:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:08,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 03:20:08,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:08,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:20:08,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:20:08,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:20:08,315 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 03:20:08,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:08,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:20:08,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-06 03:20:08,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 03:20:08,416 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 03:20:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949062677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:08,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:08,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-06 03:20:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903434854] [2022-12-06 03:20:08,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:20:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:20:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2022-12-06 03:20:08,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:20:08,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 1734 transitions, 67383 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:08,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:08,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:20:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:12,083 INFO L130 PetriNetUnfolder]: 3873/7634 cut-off events. [2022-12-06 03:20:12,083 INFO L131 PetriNetUnfolder]: For 1367/1367 co-relation queries the response was YES. [2022-12-06 03:20:12,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153742 conditions, 7634 events. 3873/7634 cut-off events. For 1367/1367 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 62903 event pairs, 113 based on Foata normal form. 16/5516 useless extension candidates. Maximal degree in co-relation 33556. Up to 7608 conditions per place. [2022-12-06 03:20:12,113 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 678 selfloop transitions, 177 changer transitions 1320/2175 dead transitions. [2022-12-06 03:20:12,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 2175 transitions, 88827 flow [2022-12-06 03:20:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 03:20:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 03:20:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-12-06 03:20:12,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4676470588235294 [2022-12-06 03:20:12,114 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 262 predicate places. [2022-12-06 03:20:12,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:12,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 2175 transitions, 88827 flow [2022-12-06 03:20:12,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 2175 transitions, 88827 flow [2022-12-06 03:20:12,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:12,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:20:12,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 03:20:12,194 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 2175 transitions, 88827 flow [2022-12-06 03:20:12,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:12,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:12,195 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:12,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 03:20:12,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:12,402 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:20:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -550453888, now seen corresponding path program 7 times [2022-12-06 03:20:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865050817] [2022-12-06 03:20:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865050817] [2022-12-06 03:20:12,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865050817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496346783] [2022-12-06 03:20:12,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:20:12,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:12,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:12,497 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:20:12,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:20:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:12,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 03:20:12,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:12,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:20:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496346783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:12,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:12,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 13 [2022-12-06 03:20:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131362009] [2022-12-06 03:20:12,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:12,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:20:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:20:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:20:12,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:20:12,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 2175 transitions, 88827 flow. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:12,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:12,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:20:12,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:17,724 INFO L130 PetriNetUnfolder]: 5173/10019 cut-off events. [2022-12-06 03:20:17,725 INFO L131 PetriNetUnfolder]: For 1740/1740 co-relation queries the response was YES. [2022-12-06 03:20:17,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211732 conditions, 10019 events. 5173/10019 cut-off events. For 1740/1740 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 83827 event pairs, 109 based on Foata normal form. 0/7085 useless extension candidates. Maximal degree in co-relation 58176. Up to 9993 conditions per place. [2022-12-06 03:20:17,880 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 767 selfloop transitions, 334 changer transitions 1737/2838 dead transitions. [2022-12-06 03:20:17,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 2838 transitions, 121533 flow [2022-12-06 03:20:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:20:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:20:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 03:20:17,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 03:20:17,881 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 267 predicate places. [2022-12-06 03:20:17,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:17,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 2838 transitions, 121533 flow [2022-12-06 03:20:17,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 2838 transitions, 121533 flow [2022-12-06 03:20:17,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:17,988 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:20:17,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 03:20:17,988 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 2838 transitions, 121533 flow [2022-12-06 03:20:17,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:17,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:17,989 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:17,994 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 03:20:18,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:18,194 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:20:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2042690743, now seen corresponding path program 1 times [2022-12-06 03:20:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:18,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351492552] [2022-12-06 03:20:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:18,628 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 03:20:18,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:18,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351492552] [2022-12-06 03:20:18,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351492552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:18,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231512847] [2022-12-06 03:20:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:18,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:18,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:18,630 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:20:18,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:20:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:18,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 03:20:18,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:18,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:20:18,806 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 03:20:18,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:18,823 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 03:20:18,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-12-06 03:20:18,841 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 03:20:18,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231512847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:18,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:18,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-12-06 03:20:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481314662] [2022-12-06 03:20:18,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:18,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:20:18,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:18,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:20:18,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-06 03:20:18,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 03:20:18,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 2838 transitions, 121533 flow. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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 03:20:18,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:18,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 03:20:18,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:29,532 INFO L130 PetriNetUnfolder]: 7907/15025 cut-off events. [2022-12-06 03:20:29,532 INFO L131 PetriNetUnfolder]: For 2539/2539 co-relation queries the response was YES. [2022-12-06 03:20:29,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332466 conditions, 15025 events. 7907/15025 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 131151 event pairs, 134 based on Foata normal form. 37/10447 useless extension candidates. Maximal degree in co-relation 67200. Up to 14999 conditions per place. [2022-12-06 03:20:29,596 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 1255 selfloop transitions, 499 changer transitions 2465/4219 dead transitions. [2022-12-06 03:20:29,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 4219 transitions, 189056 flow [2022-12-06 03:20:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-06 03:20:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-06 03:20:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 408 transitions. [2022-12-06 03:20:29,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4340425531914894 [2022-12-06 03:20:29,598 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 313 predicate places. [2022-12-06 03:20:29,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:29,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 4219 transitions, 189056 flow [2022-12-06 03:20:29,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 4219 transitions, 189056 flow [2022-12-06 03:20:29,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:33,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:20:33,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3738 [2022-12-06 03:20:33,336 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 4218 transitions, 189012 flow [2022-12-06 03:20:33,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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 03:20:33,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:33,336 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:33,341 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 03:20:33,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:33,538 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:20:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash 443463587, now seen corresponding path program 1 times [2022-12-06 03:20:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:33,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790130450] [2022-12-06 03:20:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:34,017 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 03:20:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:34,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790130450] [2022-12-06 03:20:34,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790130450] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:34,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124581201] [2022-12-06 03:20:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:34,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:34,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:34,019 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:20:34,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:20:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:34,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 03:20:34,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:34,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:20:34,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:20:34,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:20:34,237 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 03:20:34,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:34,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:20:34,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-06 03:20:34,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 03:20:34,338 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 03:20:34,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124581201] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:34,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:34,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-06 03:20:34,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769305563] [2022-12-06 03:20:34,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:34,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 03:20:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:34,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 03:20:34,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=366, Unknown=3, NotChecked=0, Total=420 [2022-12-06 03:20:34,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:20:34,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 4218 transitions, 189012 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:34,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:34,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:20:34,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:20:53,507 INFO L130 PetriNetUnfolder]: 8907/16847 cut-off events. [2022-12-06 03:20:53,508 INFO L131 PetriNetUnfolder]: For 2871/2871 co-relation queries the response was YES. [2022-12-06 03:20:53,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389595 conditions, 16847 events. 8907/16847 cut-off events. For 2871/2871 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 149217 event pairs, 134 based on Foata normal form. 5/11617 useless extension candidates. Maximal degree in co-relation 80372. Up to 16821 conditions per place. [2022-12-06 03:20:53,584 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 1631 selfloop transitions, 424 changer transitions 2667/4722 dead transitions. [2022-12-06 03:20:53,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 4722 transitions, 221016 flow [2022-12-06 03:20:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 03:20:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 03:20:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 133 transitions. [2022-12-06 03:20:53,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 03:20:53,585 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 326 predicate places. [2022-12-06 03:20:53,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:20:53,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 4722 transitions, 221016 flow [2022-12-06 03:20:53,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 4722 transitions, 221016 flow [2022-12-06 03:20:53,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:20:53,822 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:20:53,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 03:20:53,823 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 4722 transitions, 221016 flow [2022-12-06 03:20:53,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:53,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:20:53,824 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:20:53,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 03:20:54,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:54,024 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:20:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:20:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1024218361, now seen corresponding path program 1 times [2022-12-06 03:20:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:20:54,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306952584] [2022-12-06 03:20:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:20:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:54,787 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 03:20:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:20:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306952584] [2022-12-06 03:20:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306952584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:20:54,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442524169] [2022-12-06 03:20:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:20:54,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:20:54,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:20:54,789 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:20:54,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:20:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:20:54,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 03:20:54,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:20:54,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:20:54,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:20:55,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:20:55,055 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 03:20:55,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:20:55,072 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_874) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 8)))) is different from false [2022-12-06 03:20:55,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 03:20:55,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-12-06 03:20:55,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 03:20:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-06 03:20:55,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442524169] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:20:55,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:20:55,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-06 03:20:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339183446] [2022-12-06 03:20:55,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:20:55,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 03:20:55,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:20:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 03:20:55,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=454, Unknown=1, NotChecked=42, Total=552 [2022-12-06 03:20:55,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 03:20:55,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 4722 transitions, 221016 flow. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:20:55,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:20:55,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 03:20:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:21:24,655 INFO L130 PetriNetUnfolder]: 10962/20540 cut-off events. [2022-12-06 03:21:24,655 INFO L131 PetriNetUnfolder]: For 3589/3589 co-relation queries the response was YES. [2022-12-06 03:21:24,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495545 conditions, 20540 events. 10962/20540 cut-off events. For 3589/3589 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 185169 event pairs, 253 based on Foata normal form. 5/14075 useless extension candidates. Maximal degree in co-relation 92600. Up to 20514 conditions per place. [2022-12-06 03:21:24,741 INFO L137 encePairwiseOnDemand]: 4/21 looper letters, 1681 selfloop transitions, 894 changer transitions 3303/5878 dead transitions. [2022-12-06 03:21:24,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 5878 transitions, 286731 flow [2022-12-06 03:21:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 03:21:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 03:21:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 174 transitions. [2022-12-06 03:21:24,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-06 03:21:24,743 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 345 predicate places. [2022-12-06 03:21:24,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:21:24,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 364 places, 5878 transitions, 286731 flow [2022-12-06 03:21:24,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 364 places, 5878 transitions, 286731 flow [2022-12-06 03:21:24,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:21:28,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 03:21:28,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4142 [2022-12-06 03:21:28,885 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 5877 transitions, 286683 flow [2022-12-06 03:21:28,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:21:28,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:21:28,885 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:21:28,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 03:21:29,088 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,SelfDestructingSolverStorable22 [2022-12-06 03:21:29,089 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:21:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:21:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1940456143, now seen corresponding path program 2 times [2022-12-06 03:21:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:21:29,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482271856] [2022-12-06 03:21:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:21:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:21:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:21:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:21:29,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:21:29,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482271856] [2022-12-06 03:21:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482271856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:21:29,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621182439] [2022-12-06 03:21:29,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:21:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:21:29,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:21:29,396 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:21:29,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:21:29,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:21:29,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:21:29,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 03:21:29,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:21:29,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2022-12-06 03:21:29,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:21:29,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:21:29,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:21:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:21:29,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:21:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:21:29,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621182439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:21:29,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:21:29,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-12-06 03:21:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289694361] [2022-12-06 03:21:29,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:21:29,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 03:21:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:21:29,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 03:21:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=702, Unknown=1, NotChecked=0, Total=812 [2022-12-06 03:21:29,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 03:21:29,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 5877 transitions, 286683 flow. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:21:29,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:21:29,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 03:21:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:22:36,377 INFO L130 PetriNetUnfolder]: 16487/30623 cut-off events. [2022-12-06 03:22:36,378 INFO L131 PetriNetUnfolder]: For 5005/5005 co-relation queries the response was YES. [2022-12-06 03:22:36,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769209 conditions, 30623 events. 16487/30623 cut-off events. For 5005/5005 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 284162 event pairs, 251 based on Foata normal form. 40/20749 useless extension candidates. Maximal degree in co-relation 266564. Up to 30597 conditions per place. [2022-12-06 03:22:36,540 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 3848 selfloop transitions, 938 changer transitions 3919/8705 dead transitions. [2022-12-06 03:22:36,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 8705 transitions, 441922 flow [2022-12-06 03:22:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-12-06 03:22:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2022-12-06 03:22:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1545 transitions. [2022-12-06 03:22:36,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.394535240040858 [2022-12-06 03:22:36,548 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 521 predicate places. [2022-12-06 03:22:36,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:22:36,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 540 places, 8705 transitions, 441922 flow [2022-12-06 03:22:36,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 540 places, 8705 transitions, 441922 flow [2022-12-06 03:22:36,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:22:36,976 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:22:36,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-06 03:22:36,976 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 8705 transitions, 441922 flow [2022-12-06 03:22:36,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:22:36,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:22:36,977 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:22:36,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:22:37,183 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,SelfDestructingSolverStorable23 [2022-12-06 03:22:37,184 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:22:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:22:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2135863065, now seen corresponding path program 3 times [2022-12-06 03:22:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:22:37,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172281866] [2022-12-06 03:22:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:22:37,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:22:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:22:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:22:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:22:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172281866] [2022-12-06 03:22:37,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172281866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:22:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502911006] [2022-12-06 03:22:37,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:22:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:22:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:22:37,578 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:22:37,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:22:37,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:22:37,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:22:37,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 03:22:37,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:22:37,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2022-12-06 03:22:37,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:22:37,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:22:38,032 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-12-06 03:22:38,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 16 [2022-12-06 03:22:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:22:38,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:22:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:22:38,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502911006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:22:38,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:22:38,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-12-06 03:22:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289254971] [2022-12-06 03:22:38,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:22:38,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 03:22:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:22:38,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 03:22:38,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=495, Unknown=1, NotChecked=0, Total=600 [2022-12-06 03:22:38,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 03:22:38,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 8705 transitions, 441922 flow. Second operand has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:22:38,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:22:38,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 03:22:38,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:24:22,710 INFO L130 PetriNetUnfolder]: 15444/29018 cut-off events. [2022-12-06 03:24:22,710 INFO L131 PetriNetUnfolder]: For 4992/4992 co-relation queries the response was YES. [2022-12-06 03:24:22,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757986 conditions, 29018 events. 15444/29018 cut-off events. For 4992/4992 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 266085 event pairs, 249 based on Foata normal form. 57/19969 useless extension candidates. Maximal degree in co-relation 277100. Up to 28992 conditions per place. [2022-12-06 03:24:22,823 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 1817 selfloop transitions, 89 changer transitions 6377/8283 dead transitions. [2022-12-06 03:24:22,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 8283 transitions, 437151 flow [2022-12-06 03:24:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 03:24:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 03:24:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 370 transitions. [2022-12-06 03:24:22,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3822314049586777 [2022-12-06 03:24:22,825 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 528 predicate places. [2022-12-06 03:24:22,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:24:22,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 547 places, 8283 transitions, 437151 flow [2022-12-06 03:24:23,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 547 places, 8283 transitions, 437151 flow [2022-12-06 03:24:23,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:24:23,247 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:24:23,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 423 [2022-12-06 03:24:23,248 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 8283 transitions, 437151 flow [2022-12-06 03:24:23,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:23,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:24:23,249 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:24:23,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 03:24:23,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:23,454 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:24:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:24:23,454 INFO L85 PathProgramCache]: Analyzing trace with hash -9900057, now seen corresponding path program 4 times [2022-12-06 03:24:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:24:23,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985767904] [2022-12-06 03:24:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:24:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:24:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:24:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:24:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:24:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985767904] [2022-12-06 03:24:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985767904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:24:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440405007] [2022-12-06 03:24:23,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:24:23,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:24:23,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:24:23,878 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:24:23,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 03:24:23,982 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:24:23,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:24:23,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 03:24:23,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:24:24,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:24:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:24:24,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:24:24,057 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 03:24:24,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-12-06 03:24:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:24:24,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440405007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:24:24,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:24:24,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2022-12-06 03:24:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242890707] [2022-12-06 03:24:24,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:24:24,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 03:24:24,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:24:24,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 03:24:24,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-12-06 03:24:24,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 03:24:24,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 8283 transitions, 437151 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:24:24,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:24:24,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 03:24:24,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:26:03,975 INFO L130 PetriNetUnfolder]: 16446/30860 cut-off events. [2022-12-06 03:26:03,975 INFO L131 PetriNetUnfolder]: For 5214/5214 co-relation queries the response was YES. [2022-12-06 03:26:03,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836934 conditions, 30860 events. 16446/30860 cut-off events. For 5214/5214 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 285070 event pairs, 249 based on Foata normal form. 10/21149 useless extension candidates. Maximal degree in co-relation 289775. Up to 30834 conditions per place. [2022-12-06 03:26:04,138 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 1285 selfloop transitions, 767 changer transitions 6751/8803 dead transitions. [2022-12-06 03:26:04,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 8803 transitions, 482184 flow [2022-12-06 03:26:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-06 03:26:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-06 03:26:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 467 transitions. [2022-12-06 03:26:04,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40051457975986277 [2022-12-06 03:26:04,140 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 580 predicate places. [2022-12-06 03:26:04,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:26:04,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 599 places, 8803 transitions, 482184 flow [2022-12-06 03:26:04,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 599 places, 8803 transitions, 482184 flow [2022-12-06 03:26:04,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:26:04,677 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:26:04,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 537 [2022-12-06 03:26:04,678 INFO L495 AbstractCegarLoop]: Abstraction has has 599 places, 8803 transitions, 482184 flow [2022-12-06 03:26:04,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:04,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:26:04,678 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:26:04,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 03:26:04,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:04,879 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:26:04,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:26:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -668546725, now seen corresponding path program 2 times [2022-12-06 03:26:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:26:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553714489] [2022-12-06 03:26:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:26:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:26:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:26:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:05,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:26:05,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553714489] [2022-12-06 03:26:05,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553714489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:26:05,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53139384] [2022-12-06 03:26:05,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:26:05,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:26:05,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:26:05,261 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:26:05,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 03:26:05,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:26:05,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:26:05,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 03:26:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:26:05,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 03:26:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:05,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:26:05,504 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 03:26:05,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-12-06 03:26:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:26:05,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53139384] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:26:05,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:26:05,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-06 03:26:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947932592] [2022-12-06 03:26:05,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:26:05,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 03:26:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:26:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 03:26:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-12-06 03:26:05,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 03:26:05,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 8803 transitions, 482184 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:26:05,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:26:05,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 03:26:05,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:28:27,278 INFO L130 PetriNetUnfolder]: 19836/37003 cut-off events. [2022-12-06 03:28:27,278 INFO L131 PetriNetUnfolder]: For 6256/6256 co-relation queries the response was YES. [2022-12-06 03:28:27,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040448 conditions, 37003 events. 19836/37003 cut-off events. For 6256/6256 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 345280 event pairs, 265 based on Foata normal form. 20/25187 useless extension candidates. Maximal degree in co-relation 368636. Up to 36977 conditions per place. [2022-12-06 03:28:27,440 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 1485 selfloop transitions, 967 changer transitions 8044/10496 dead transitions. [2022-12-06 03:28:27,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 10496 transitions, 595879 flow [2022-12-06 03:28:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-06 03:28:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2022-12-06 03:28:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 640 transitions. [2022-12-06 03:28:27,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.398505603985056 [2022-12-06 03:28:27,442 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 652 predicate places. [2022-12-06 03:28:27,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:28:27,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 671 places, 10496 transitions, 595879 flow [2022-12-06 03:28:28,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 671 places, 10496 transitions, 595879 flow [2022-12-06 03:28:28,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:28:28,155 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:28:28,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 714 [2022-12-06 03:28:28,156 INFO L495 AbstractCegarLoop]: Abstraction has has 671 places, 10496 transitions, 595879 flow [2022-12-06 03:28:28,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:28:28,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:28:28,156 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:28:28,162 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 03:28:28,361 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,SelfDestructingSolverStorable26 [2022-12-06 03:28:28,362 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 03:28:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:28:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash 435495305, now seen corresponding path program 3 times [2022-12-06 03:28:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:28:28,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769682899] [2022-12-06 03:28:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:28:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:28:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:28:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:28:28,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769682899] [2022-12-06 03:28:28,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769682899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:28:28,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501178445] [2022-12-06 03:28:28,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:28:28,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:28:28,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:28:28,971 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:28:28,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 03:28:29,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 03:28:29,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:28:29,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 03:28:29,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:28:29,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2022-12-06 03:28:29,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:28:29,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:28:29,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 03:28:29,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 03:28:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:29,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:28:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:28:29,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501178445] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:28:29,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:28:29,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-12-06 03:28:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502221032] [2022-12-06 03:28:29,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:28:29,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 03:28:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:28:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 03:28:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-12-06 03:28:29,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 03:28:29,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 10496 transitions, 595879 flow. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:28:29,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:28:29,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 03:28:29,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:28:32,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-06 03:33:05,299 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:33:05,299 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:33:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-06 03:33:05,330 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 03:33:05,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 03:33:05,534 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,SelfDestructingSolverStorable27 [2022-12-06 03:33:05,534 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 1545138 conditions, 53121 events (29879/53120 cut-off events. For 8166/8166 co-relation queries the response was YES. Maximal size of possible extension queue 3738. Compared 538732 event pairs, 290 based on Foata normal form. 2/37612 useless extension candidates. Maximal degree in co-relation 516657. Up to 53094 conditions per place.). [2022-12-06 03:33:05,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 03:33:05,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 03:33:05,536 INFO L458 BasicCegarLoop]: Path program histogram: [7, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:33:05,539 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:33:05,539 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:33:05,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:33:05 BasicIcfg [2022-12-06 03:33:05,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:33:05,541 INFO L158 Benchmark]: Toolchain (without parser) took 833199.75ms. Allocated memory was 192.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 169.8MB in the beginning and 419.2MB in the end (delta: -249.4MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-06 03:33:05,541 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory was 169.6MB in the beginning and 169.5MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:33:05,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.90ms. Allocated memory is still 192.9MB. Free memory was 169.3MB in the beginning and 157.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 03:33:05,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.55ms. Allocated memory is still 192.9MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 03:33:05,541 INFO L158 Benchmark]: Boogie Preprocessor took 33.31ms. Allocated memory is still 192.9MB. Free memory was 155.6MB in the beginning and 154.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:33:05,541 INFO L158 Benchmark]: RCFGBuilder took 414.91ms. Allocated memory is still 192.9MB. Free memory was 154.6MB in the beginning and 133.9MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 03:33:05,542 INFO L158 Benchmark]: TraceAbstraction took 832482.40ms. Allocated memory was 192.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 133.6MB in the beginning and 419.2MB in the end (delta: -285.6MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-06 03:33:05,542 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 192.9MB. Free memory was 169.6MB in the beginning and 169.5MB in the end (delta: 85.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.90ms. Allocated memory is still 192.9MB. Free memory was 169.3MB in the beginning and 157.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.55ms. Allocated memory is still 192.9MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.31ms. Allocated memory is still 192.9MB. Free memory was 155.6MB in the beginning and 154.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 414.91ms. Allocated memory is still 192.9MB. Free memory was 154.6MB in the beginning and 133.9MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 832482.40ms. Allocated memory was 192.9MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 133.6MB in the beginning and 419.2MB in the end (delta: -285.6MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 98 PlacesBefore, 19 PlacesAfterwards, 100 TransitionsBefore, 15 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 191, independent conditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, 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, 21 PlacesBefore, 21 PlacesAfterwards, 23 TransitionsBefore, 23 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, 23 PlacesBefore, 23 PlacesAfterwards, 32 TransitionsBefore, 32 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: 1.5s, 26 PlacesBefore, 25 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 37 PlacesBefore, 36 PlacesAfterwards, 134 TransitionsBefore, 133 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 46 PlacesBefore, 45 PlacesAfterwards, 176 TransitionsBefore, 175 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 202 TransitionsBefore, 202 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, 55 PlacesBefore, 55 PlacesAfterwards, 310 TransitionsBefore, 310 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 381 TransitionsBefore, 381 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 80 PlacesBefore, 79 PlacesAfterwards, 516 TransitionsBefore, 515 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 793 TransitionsBefore, 793 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, 921 TransitionsBefore, 921 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, 129 PlacesBefore, 129 PlacesAfterwards, 1070 TransitionsBefore, 1070 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, 140 PlacesBefore, 140 PlacesAfterwards, 1272 TransitionsBefore, 1272 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: 3.1s, 153 PlacesBefore, 152 PlacesAfterwards, 1462 TransitionsBefore, 1461 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 222 PlacesBefore, 222 PlacesAfterwards, 2661 TransitionsBefore, 2661 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, 214 PlacesBefore, 214 PlacesAfterwards, 1696 TransitionsBefore, 1696 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, 245 PlacesBefore, 245 PlacesAfterwards, 1727 TransitionsBefore, 1727 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, 265 PlacesBefore, 265 PlacesAfterwards, 1734 TransitionsBefore, 1734 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, 281 PlacesBefore, 281 PlacesAfterwards, 2175 TransitionsBefore, 2175 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, 286 PlacesBefore, 286 PlacesAfterwards, 2838 TransitionsBefore, 2838 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: 3.6s, 332 PlacesBefore, 331 PlacesAfterwards, 4219 TransitionsBefore, 4218 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 345 PlacesBefore, 345 PlacesAfterwards, 4722 TransitionsBefore, 4722 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: 3.9s, 364 PlacesBefore, 363 PlacesAfterwards, 5878 TransitionsBefore, 5877 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 540 PlacesBefore, 540 PlacesAfterwards, 8705 TransitionsBefore, 8705 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, 547 PlacesBefore, 547 PlacesAfterwards, 8283 TransitionsBefore, 8283 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, 599 PlacesBefore, 599 PlacesAfterwards, 8803 TransitionsBefore, 8803 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, 671 PlacesBefore, 671 PlacesAfterwards, 10496 TransitionsBefore, 10496 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: 86]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (30states, 0/22 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 1545138 conditions, 53121 events (29879/53120 cut-off events. For 8166/8166 co-relation queries the response was YES. Maximal size of possible extension queue 3738. Compared 538732 event pairs, 290 based on Foata normal form. 2/37612 useless extension candidates. Maximal degree in co-relation 516657. Up to 53094 conditions per place.). - TimeoutResultAtElement [Line: 81]: 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 (30states, 0/22 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 1545138 conditions, 53121 events (29879/53120 cut-off events. For 8166/8166 co-relation queries the response was YES. Maximal size of possible extension queue 3738. Compared 538732 event pairs, 290 based on Foata normal form. 2/37612 useless extension candidates. Maximal degree in co-relation 516657. Up to 53094 conditions per place.). - TimeoutResultAtElement [Line: 80]: 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 (30states, 0/22 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 1545138 conditions, 53121 events (29879/53120 cut-off events. For 8166/8166 co-relation queries the response was YES. Maximal size of possible extension queue 3738. Compared 538732 event pairs, 290 based on Foata normal form. 2/37612 useless extension candidates. Maximal degree in co-relation 516657. Up to 53094 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 118 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: 832.4s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 783.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 9492 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9492 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 265 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22338 IncrementalHoareTripleChecker+Invalid, 23972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1330 mSolverCounterUnsat, 0 mSDtfsCounter, 22338 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1691 GetRequests, 545 SyntacticMatches, 7 SemanticMatches, 1139 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 28203 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=595879occurred in iteration=27, InterpolantAutomatonStates: 772, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 861 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1194 ConstructedInterpolants, 98 QuantifiedInterpolants, 17818 SizeOfPredicates, 326 NumberOfNonLiveVariables, 5264 ConjunctsInSsa, 826 ConjunctsInUnsatCore, 78 InterpolantComputations, 3 PerfectInterpolantSequences, 99/792 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