/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-bad-counter-queue2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:27:30,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:27:30,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:27:31,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:27:31,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:27:31,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:27:31,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:27:31,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:27:31,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:27:31,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:27:31,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:27:31,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:27:31,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:27:31,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:27:31,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:27:31,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:27:31,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:27:31,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:27:31,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:27:31,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:27:31,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:27:31,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:27:31,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:27:31,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:27:31,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:27:31,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:27:31,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:27:31,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:27:31,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:27:31,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:27:31,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:27:31,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:27:31,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:27:31,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:27:31,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:27:31,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:27:31,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:27:31,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:27:31,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:27:31,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:27:31,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:27:31,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:27:31,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:27:31,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:27:31,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:27:31,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:27:31,078 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:27:31,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:27:31,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:27:31,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:27:31,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:27:31,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:27:31,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:27:31,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:27:31,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:27:31,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:27:31,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:27:31,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:27:31,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:27:31,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:27:31,382 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:27:31,383 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:27:31,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-12-06 02:27:32,341 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:27:32,569 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:27:32,569 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-12-06 02:27:32,605 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7e5103/83a790fff1784a7f964371b1066c6e62/FLAGd664bc1a3 [2022-12-06 02:27:32,616 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9b7e5103/83a790fff1784a7f964371b1066c6e62 [2022-12-06 02:27:32,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:27:32,618 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:27:32,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:27:32,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:27:32,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:27:32,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446f108c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32, skipping insertion in model container [2022-12-06 02:27:32,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:27:32,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:27:32,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:32,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:32,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:32,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:32,785 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-bad-counter-queue2.wvr.c[2271,2284] [2022-12-06 02:27:32,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:27:32,806 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:27:32,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:32,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:32,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:27:32,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:27:32,833 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-bad-counter-queue2.wvr.c[2271,2284] [2022-12-06 02:27:32,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:27:32,855 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:27:32,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32 WrapperNode [2022-12-06 02:27:32,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:27:32,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:27:32,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:27:32,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:27:32,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,885 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 138 [2022-12-06 02:27:32,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:27:32,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:27:32,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:27:32,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:27:32,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,902 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:27:32,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:27:32,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:27:32,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:27:32,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (1/1) ... [2022-12-06 02:27:32,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:27:32,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:32,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:27:32,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:27:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:27:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:27:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:27:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:27:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:27:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:27:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:27:32,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:27:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:27:32,972 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:27:33,039 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:27:33,040 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:27:33,236 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:27:33,375 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:27:33,375 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 02:27:33,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:27:33 BoogieIcfgContainer [2022-12-06 02:27:33,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:27:33,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:27:33,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:27:33,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:27:33,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:27:32" (1/3) ... [2022-12-06 02:27:33,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c3bfe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:27:33, skipping insertion in model container [2022-12-06 02:27:33,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:27:32" (2/3) ... [2022-12-06 02:27:33,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c3bfe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:27:33, skipping insertion in model container [2022-12-06 02:27:33,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:27:33" (3/3) ... [2022-12-06 02:27:33,383 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2022-12-06 02:27:33,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:27:33,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:27:33,405 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:27:33,482 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:27:33,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 230 flow [2022-12-06 02:27:33,605 INFO L130 PetriNetUnfolder]: 9/105 cut-off events. [2022-12-06 02:27:33,606 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:27:33,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 105 events. 9/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 02:27:33,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 107 transitions, 230 flow [2022-12-06 02:27:33,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 97 transitions, 206 flow [2022-12-06 02:27:33,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:33,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 97 transitions, 206 flow [2022-12-06 02:27:33,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 97 transitions, 206 flow [2022-12-06 02:27:33,699 INFO L130 PetriNetUnfolder]: 9/97 cut-off events. [2022-12-06 02:27:33,700 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:27:33,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 97 events. 9/97 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 02:27:33,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 97 transitions, 206 flow [2022-12-06 02:27:33,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 02:27:36,948 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-06 02:27:36,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:27:36,962 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;@1e1af07e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:27:36,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:27:36,966 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 02:27:36,966 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:27:36,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:36,967 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:36,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 309762736, now seen corresponding path program 1 times [2022-12-06 02:27:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:36,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559560456] [2022-12-06 02:27:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:37,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559560456] [2022-12-06 02:27:37,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559560456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:37,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:37,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:27:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66370021] [2022-12-06 02:27:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:37,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:27:37,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:37,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:27:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:27:37,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 02:27:37,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:37,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:37,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 02:27:37,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:37,303 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 02:27:37,303 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 02:27:37,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 116 events. 66/116 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2022-12-06 02:27:37,305 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 02:27:37,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 27 transitions, 125 flow [2022-12-06 02:27:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:27:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:27:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 02:27:37,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 02:27:37,318 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 02:27:37,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:37,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 27 transitions, 125 flow [2022-12-06 02:27:37,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 27 transitions, 125 flow [2022-12-06 02:27:37,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 02:27:37,330 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:37,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:27:37,332 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 27 transitions, 125 flow [2022-12-06 02:27:37,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:37,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:37,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:37,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:27:37,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 640615258, now seen corresponding path program 1 times [2022-12-06 02:27:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:37,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901844766] [2022-12-06 02:27:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:37,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:37,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901844766] [2022-12-06 02:27:37,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901844766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:37,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:37,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:27:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531442321] [2022-12-06 02:27:37,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:37,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:27:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:27:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:27:37,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 02:27:37,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 27 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:37,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:37,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 02:27:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:37,592 INFO L130 PetriNetUnfolder]: 111/210 cut-off events. [2022-12-06 02:27:37,592 INFO L131 PetriNetUnfolder]: For 45/54 co-relation queries the response was YES. [2022-12-06 02:27:37,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 210 events. 111/210 cut-off events. For 45/54 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 774 event pairs, 18 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 284. Up to 124 conditions per place. [2022-12-06 02:27:37,594 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 47 selfloop transitions, 4 changer transitions 4/56 dead transitions. [2022-12-06 02:27:37,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 56 transitions, 370 flow [2022-12-06 02:27:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 02:27:37,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 02:27:37,596 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 02:27:37,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:37,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 56 transitions, 370 flow [2022-12-06 02:27:37,598 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 56 transitions, 370 flow [2022-12-06 02:27:37,598 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 02:27:38,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:38,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 930 [2022-12-06 02:27:38,527 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 55 transitions, 364 flow [2022-12-06 02:27:38,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:38,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:27:38,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash 598586623, now seen corresponding path program 1 times [2022-12-06 02:27:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:38,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670939410] [2022-12-06 02:27:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:38,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:38,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670939410] [2022-12-06 02:27:38,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670939410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:38,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:38,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:27:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866464978] [2022-12-06 02:27:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:38,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:27:38,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 02:27:38,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 55 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:38,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 02:27:38,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:38,663 INFO L130 PetriNetUnfolder]: 97/189 cut-off events. [2022-12-06 02:27:38,663 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-12-06 02:27:38,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 189 events. 97/189 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 650 event pairs, 25 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 384. Up to 125 conditions per place. [2022-12-06 02:27:38,665 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 25 selfloop transitions, 0 changer transitions 22/48 dead transitions. [2022-12-06 02:27:38,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 48 transitions, 407 flow [2022-12-06 02:27:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 02:27:38,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:27:38,666 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 8 predicate places. [2022-12-06 02:27:38,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:38,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 48 transitions, 407 flow [2022-12-06 02:27:38,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 48 transitions, 407 flow [2022-12-06 02:27:38,668 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 02:27:38,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:38,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 02:27:38,669 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 48 transitions, 407 flow [2022-12-06 02:27:38,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:38,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:27:38,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 134802269, now seen corresponding path program 1 times [2022-12-06 02:27:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:38,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477295727] [2022-12-06 02:27:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:38,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:38,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477295727] [2022-12-06 02:27:38,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477295727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:38,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:38,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:27:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689509370] [2022-12-06 02:27:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:38,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:38,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:27:38,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 02:27:38,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 48 transitions, 407 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:38,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 02:27:38,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:38,778 INFO L130 PetriNetUnfolder]: 87/167 cut-off events. [2022-12-06 02:27:38,778 INFO L131 PetriNetUnfolder]: For 211/231 co-relation queries the response was YES. [2022-12-06 02:27:38,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 167 events. 87/167 cut-off events. For 211/231 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 542 event pairs, 8 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 445. Up to 106 conditions per place. [2022-12-06 02:27:38,780 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 27 selfloop transitions, 4 changer transitions 21/53 dead transitions. [2022-12-06 02:27:38,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 53 transitions, 546 flow [2022-12-06 02:27:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 02:27:38,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 02:27:38,782 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2022-12-06 02:27:38,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:38,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 53 transitions, 546 flow [2022-12-06 02:27:38,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 53 transitions, 546 flow [2022-12-06 02:27:38,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 02:27:38,784 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:38,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 02:27:38,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 53 transitions, 546 flow [2022-12-06 02:27:38,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:38,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:38,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:27:38,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -152495845, now seen corresponding path program 1 times [2022-12-06 02:27:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299682484] [2022-12-06 02:27:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:38,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299682484] [2022-12-06 02:27:38,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299682484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:38,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:27:38,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:27:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421061662] [2022-12-06 02:27:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:38,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:27:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:27:38,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:27:38,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 02:27:38,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 53 transitions, 546 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:38,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 02:27:38,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:38,889 INFO L130 PetriNetUnfolder]: 88/170 cut-off events. [2022-12-06 02:27:38,889 INFO L131 PetriNetUnfolder]: For 294/310 co-relation queries the response was YES. [2022-12-06 02:27:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 170 events. 88/170 cut-off events. For 294/310 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 542 event pairs, 8 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 530. Up to 109 conditions per place. [2022-12-06 02:27:38,892 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 33 selfloop transitions, 5 changer transitions 21/60 dead transitions. [2022-12-06 02:27:38,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 60 transitions, 735 flow [2022-12-06 02:27:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:27:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:27:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 02:27:38,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-06 02:27:38,895 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 02:27:38,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:38,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 60 transitions, 735 flow [2022-12-06 02:27:38,898 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 60 transitions, 735 flow [2022-12-06 02:27:38,898 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 02:27:38,899 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:38,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:27:38,901 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 60 transitions, 735 flow [2022-12-06 02:27:38,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:38,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:38,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:38,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:27:38,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash 835098911, now seen corresponding path program 1 times [2022-12-06 02:27:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:38,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634755786] [2022-12-06 02:27:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634755786] [2022-12-06 02:27:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634755786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617841380] [2022-12-06 02:27:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:39,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:39,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:27:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:39,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 02:27:39,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:39,363 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 11 treesize of output 7 [2022-12-06 02:27:39,388 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 02:27:39,408 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 02:27:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:39,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:39,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617841380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:39,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:39,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 4] total 11 [2022-12-06 02:27:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415789625] [2022-12-06 02:27:39,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:39,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:27:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:27:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:27:39,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:39,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 60 transitions, 735 flow. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:39,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:39,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:39,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:39,765 INFO L130 PetriNetUnfolder]: 134/253 cut-off events. [2022-12-06 02:27:39,765 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-12-06 02:27:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 253 events. 134/253 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 874 event pairs, 4 based on Foata normal form. 1/214 useless extension candidates. Maximal degree in co-relation 1024. Up to 188 conditions per place. [2022-12-06 02:27:39,768 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 54 selfloop transitions, 15 changer transitions 23/92 dead transitions. [2022-12-06 02:27:39,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 92 transitions, 1291 flow [2022-12-06 02:27:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-06 02:27:39,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 02:27:39,772 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-06 02:27:39,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:39,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 92 transitions, 1291 flow [2022-12-06 02:27:39,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 92 transitions, 1291 flow [2022-12-06 02:27:39,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:39,777 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:39,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:27:39,781 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 92 transitions, 1291 flow [2022-12-06 02:27:39,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:39,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:39,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:39,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:27:39,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:27:39,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2135219787, now seen corresponding path program 2 times [2022-12-06 02:27:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:39,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763670032] [2022-12-06 02:27:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:39,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:40,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:40,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763670032] [2022-12-06 02:27:40,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763670032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:40,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408927181] [2022-12-06 02:27:40,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:40,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:40,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:40,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:40,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:27:40,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:40,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:40,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 02:27:40,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:40,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:40,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:40,601 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 22 treesize of output 19 [2022-12-06 02:27:40,613 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:27:40,614 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 21 treesize of output 10 [2022-12-06 02:27:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:40,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408927181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:40,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:40,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2022-12-06 02:27:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398066386] [2022-12-06 02:27:40,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:40,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:27:40,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:40,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:27:40,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:27:40,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:40,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 92 transitions, 1291 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:40,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:40,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:40,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:40,824 INFO L130 PetriNetUnfolder]: 165/316 cut-off events. [2022-12-06 02:27:40,824 INFO L131 PetriNetUnfolder]: For 418/418 co-relation queries the response was YES. [2022-12-06 02:27:40,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 316 events. 165/316 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1214 event pairs, 4 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 1458. Up to 232 conditions per place. [2022-12-06 02:27:40,827 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 70 selfloop transitions, 14 changer transitions 31/115 dead transitions. [2022-12-06 02:27:40,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 115 transitions, 1843 flow [2022-12-06 02:27:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 02:27:40,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 02:27:40,829 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-06 02:27:40,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:40,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 115 transitions, 1843 flow [2022-12-06 02:27:40,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 115 transitions, 1843 flow [2022-12-06 02:27:40,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:40,833 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:40,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:27:40,833 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 115 transitions, 1843 flow [2022-12-06 02:27:40,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:40,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:40,834 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:40,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:41,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 02:27:41,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1089287905, now seen corresponding path program 3 times [2022-12-06 02:27:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:41,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456564873] [2022-12-06 02:27:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456564873] [2022-12-06 02:27:41,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456564873] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:41,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351774346] [2022-12-06 02:27:41,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:27:41,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:41,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:41,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:41,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:27:41,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:27:41,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:41,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 02:27:41,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:41,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:41,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:41,625 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 22 treesize of output 19 [2022-12-06 02:27:41,637 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:27:41,637 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 21 treesize of output 10 [2022-12-06 02:27:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:41,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351774346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:41,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 10 [2022-12-06 02:27:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932926543] [2022-12-06 02:27:41,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:41,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:27:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:27:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:27:41,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:41,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 115 transitions, 1843 flow. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:41,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:41,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:41,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:41,867 INFO L130 PetriNetUnfolder]: 187/355 cut-off events. [2022-12-06 02:27:41,867 INFO L131 PetriNetUnfolder]: For 457/457 co-relation queries the response was YES. [2022-12-06 02:27:41,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 355 events. 187/355 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1385 event pairs, 4 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 1928. Up to 271 conditions per place. [2022-12-06 02:27:41,870 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 81 selfloop transitions, 14 changer transitions 32/127 dead transitions. [2022-12-06 02:27:41,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 127 transitions, 2295 flow [2022-12-06 02:27:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 02:27:41,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 02:27:41,871 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 02:27:41,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:41,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 127 transitions, 2295 flow [2022-12-06 02:27:41,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 127 transitions, 2295 flow [2022-12-06 02:27:41,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:41,876 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:41,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:27:41,876 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 127 transitions, 2295 flow [2022-12-06 02:27:41,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:41,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:41,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:41,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:42,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:42,082 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 584457351, now seen corresponding path program 4 times [2022-12-06 02:27:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:42,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842697094] [2022-12-06 02:27:42,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:42,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842697094] [2022-12-06 02:27:42,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842697094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:42,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313773548] [2022-12-06 02:27:42,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:27:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:42,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:42,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:27:42,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:27:42,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:42,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 02:27:42,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:42,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:42,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:42,607 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 22 treesize of output 19 [2022-12-06 02:27:42,616 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:27:42,616 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 21 treesize of output 10 [2022-12-06 02:27:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:42,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313773548] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:42,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:42,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2022-12-06 02:27:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106482214] [2022-12-06 02:27:42,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:27:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:27:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:27:42,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:42,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 127 transitions, 2295 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:42,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:42,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:42,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:42,815 INFO L130 PetriNetUnfolder]: 211/398 cut-off events. [2022-12-06 02:27:42,816 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2022-12-06 02:27:42,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 398 events. 211/398 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1610 event pairs, 8 based on Foata normal form. 1/323 useless extension candidates. Maximal degree in co-relation 2436. Up to 314 conditions per place. [2022-12-06 02:27:42,819 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 94 selfloop transitions, 14 changer transitions 33/141 dead transitions. [2022-12-06 02:27:42,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 141 transitions, 2838 flow [2022-12-06 02:27:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-06 02:27:42,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-06 02:27:42,820 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 38 predicate places. [2022-12-06 02:27:42,820 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:42,820 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 141 transitions, 2838 flow [2022-12-06 02:27:42,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 141 transitions, 2838 flow [2022-12-06 02:27:42,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:42,824 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:42,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:27:42,825 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 141 transitions, 2838 flow [2022-12-06 02:27:42,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:42,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:42,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:42,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:43,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:43,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1751294153, now seen corresponding path program 5 times [2022-12-06 02:27:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:43,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758599433] [2022-12-06 02:27:43,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:43,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758599433] [2022-12-06 02:27:43,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758599433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763043568] [2022-12-06 02:27:43,383 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:27:43,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:43,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:43,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:43,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:27:43,488 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:43,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:43,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 02:27:43,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:43,513 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 11 treesize of output 7 [2022-12-06 02:27:43,534 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 02:27:43,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:27:43,628 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 14 treesize of output 16 [2022-12-06 02:27:43,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:27:43,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:43,693 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 27 treesize of output 14 [2022-12-06 02:27:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:43,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:43,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)))) (and (forall ((v_ArrVal_227 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) c_~A~0.base) c_~A~0.offset) (+ .cse0 c_~counter~0 1))))) is different from false [2022-12-06 02:27:43,851 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_226))) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_226))) (<= (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-12-06 02:27:43,852 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 02:27:43,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763043568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:43,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:43,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 02:27:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986245686] [2022-12-06 02:27:43,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:27:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:27:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=232, Unknown=16, NotChecked=66, Total=380 [2022-12-06 02:27:43,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:43,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 141 transitions, 2838 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:43,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:43,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:43,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:44,132 INFO L130 PetriNetUnfolder]: 245/459 cut-off events. [2022-12-06 02:27:44,132 INFO L131 PetriNetUnfolder]: For 538/538 co-relation queries the response was YES. [2022-12-06 02:27:44,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4977 conditions, 459 events. 245/459 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1926 event pairs, 4 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 3161. Up to 375 conditions per place. [2022-12-06 02:27:44,136 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 103 selfloop transitions, 25 changer transitions 34/162 dead transitions. [2022-12-06 02:27:44,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 162 transitions, 3591 flow [2022-12-06 02:27:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-06 02:27:44,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 02:27:44,137 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-06 02:27:44,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:44,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 162 transitions, 3591 flow [2022-12-06 02:27:44,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 162 transitions, 3591 flow [2022-12-06 02:27:44,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:44,143 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:44,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:27:44,143 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 162 transitions, 3591 flow [2022-12-06 02:27:44,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:44,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:44,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:44,164 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 02:27:44,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 02:27:44,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash -486002253, now seen corresponding path program 6 times [2022-12-06 02:27:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:44,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662812557] [2022-12-06 02:27:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:44,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 02:27:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662812557] [2022-12-06 02:27:44,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662812557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449037650] [2022-12-06 02:27:44,521 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:27:44,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:44,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:44,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:27:44,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:27:44,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:44,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 02:27:44,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:44,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:44,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:44,681 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 22 treesize of output 19 [2022-12-06 02:27:44,688 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 02:27:44,688 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 21 treesize of output 10 [2022-12-06 02:27:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:44,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449037650] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:44,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2022-12-06 02:27:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479292633] [2022-12-06 02:27:44,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:27:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:27:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:27:44,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:44,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 162 transitions, 3591 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:44,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:44,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:44,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:44,921 INFO L130 PetriNetUnfolder]: 261/488 cut-off events. [2022-12-06 02:27:44,922 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2022-12-06 02:27:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5788 conditions, 488 events. 261/488 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2111 event pairs, 6 based on Foata normal form. 1/388 useless extension candidates. Maximal degree in co-relation 3750. Up to 404 conditions per place. [2022-12-06 02:27:44,925 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 121 selfloop transitions, 14 changer transitions 35/170 dead transitions. [2022-12-06 02:27:44,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 170 transitions, 4113 flow [2022-12-06 02:27:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-06 02:27:44,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2022-12-06 02:27:44,926 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-06 02:27:44,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:44,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 170 transitions, 4113 flow [2022-12-06 02:27:44,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 170 transitions, 4113 flow [2022-12-06 02:27:44,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:44,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:44,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:27:44,932 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 170 transitions, 4113 flow [2022-12-06 02:27:44,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:44,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:44,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:44,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:45,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:45,138 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash 438967871, now seen corresponding path program 7 times [2022-12-06 02:27:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:45,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889162306] [2022-12-06 02:27:45,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:45,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889162306] [2022-12-06 02:27:45,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889162306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089228807] [2022-12-06 02:27:45,346 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:27:45,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:45,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:45,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:27:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:45,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 02:27:45,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:45,430 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 11 treesize of output 7 [2022-12-06 02:27:45,446 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 02:27:45,461 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 02:27:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:45,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:45,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089228807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:45,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:45,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 4] total 11 [2022-12-06 02:27:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274914083] [2022-12-06 02:27:45,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:45,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:27:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:27:45,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:27:45,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 02:27:45,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 170 transitions, 4113 flow. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:45,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:45,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 02:27:45,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:45,803 INFO L130 PetriNetUnfolder]: 289/537 cut-off events. [2022-12-06 02:27:45,804 INFO L131 PetriNetUnfolder]: For 550/550 co-relation queries the response was YES. [2022-12-06 02:27:45,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 537 events. 289/537 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2361 event pairs, 8 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 4681. Up to 449 conditions per place. [2022-12-06 02:27:45,808 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 131 selfloop transitions, 19 changer transitions 36/186 dead transitions. [2022-12-06 02:27:45,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 186 transitions, 4869 flow [2022-12-06 02:27:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:27:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:27:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-06 02:27:45,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 02:27:45,809 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2022-12-06 02:27:45,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:45,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 186 transitions, 4869 flow [2022-12-06 02:27:45,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 186 transitions, 4869 flow [2022-12-06 02:27:45,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:45,815 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:45,815 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 02:27:45,815 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 186 transitions, 4869 flow [2022-12-06 02:27:45,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:45,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:45,815 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:45,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:46,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:46,021 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash -539188529, now seen corresponding path program 8 times [2022-12-06 02:27:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:46,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592529032] [2022-12-06 02:27:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:46,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592529032] [2022-12-06 02:27:46,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592529032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:46,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399065956] [2022-12-06 02:27:46,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:46,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:46,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:46,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:46,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:27:46,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:46,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:46,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:27:46,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:46,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:27:46,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399065956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:46,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:27:46,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 02:27:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850743154] [2022-12-06 02:27:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:46,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:27:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:27:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:27:46,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 02:27:46,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 186 transitions, 4869 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:46,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:46,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 02:27:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:46,343 INFO L130 PetriNetUnfolder]: 480/915 cut-off events. [2022-12-06 02:27:46,343 INFO L131 PetriNetUnfolder]: For 1216/1216 co-relation queries the response was YES. [2022-12-06 02:27:46,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12643 conditions, 915 events. 480/915 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4789 event pairs, 8 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 5030. Up to 813 conditions per place. [2022-12-06 02:27:46,351 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 245 selfloop transitions, 14 changer transitions 54/318 dead transitions. [2022-12-06 02:27:46,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 318 transitions, 8980 flow [2022-12-06 02:27:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:27:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:27:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 02:27:46,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2022-12-06 02:27:46,352 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 61 predicate places. [2022-12-06 02:27:46,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:46,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 318 transitions, 8980 flow [2022-12-06 02:27:46,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 318 transitions, 8980 flow [2022-12-06 02:27:46,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:48,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:48,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1801 [2022-12-06 02:27:48,153 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 317 transitions, 8952 flow [2022-12-06 02:27:48,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:48,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:48,153 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:48,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 02:27:48,353 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,SelfDestructingSolverStorable12 [2022-12-06 02:27:48,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1029245745, now seen corresponding path program 1 times [2022-12-06 02:27:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:48,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444189793] [2022-12-06 02:27:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:48,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444189793] [2022-12-06 02:27:48,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444189793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722756750] [2022-12-06 02:27:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:48,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:48,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:48,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:48,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:27:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:48,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:27:48,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:27:48,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:27:48,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722756750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:27:48,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:27:48,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 02:27:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15368921] [2022-12-06 02:27:48,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:27:48,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:27:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:27:48,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:27:48,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 02:27:48,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 317 transitions, 8952 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:48,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:48,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 02:27:48,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:48,685 INFO L130 PetriNetUnfolder]: 406/818 cut-off events. [2022-12-06 02:27:48,686 INFO L131 PetriNetUnfolder]: For 1422/1422 co-relation queries the response was YES. [2022-12-06 02:27:48,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12081 conditions, 818 events. 406/818 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4431 event pairs, 8 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 5383. Up to 720 conditions per place. [2022-12-06 02:27:48,692 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 146 selfloop transitions, 0 changer transitions 144/294 dead transitions. [2022-12-06 02:27:48,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 294 transitions, 8846 flow [2022-12-06 02:27:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 02:27:48,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-06 02:27:48,693 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 64 predicate places. [2022-12-06 02:27:48,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:48,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 294 transitions, 8846 flow [2022-12-06 02:27:48,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 294 transitions, 8846 flow [2022-12-06 02:27:48,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:48,703 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:48,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:27:48,704 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 294 transitions, 8846 flow [2022-12-06 02:27:48,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:48,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:48,704 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:48,722 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 02:27:48,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:27:48,910 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2127536431, now seen corresponding path program 1 times [2022-12-06 02:27:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:48,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852313906] [2022-12-06 02:27:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:27:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:48,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852313906] [2022-12-06 02:27:48,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852313906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:48,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441194069] [2022-12-06 02:27:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:48,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:48,969 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:49,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:27:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:49,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:27:49,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:27:49,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:27:49,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441194069] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:49,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:49,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 02:27:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684194896] [2022-12-06 02:27:49,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:49,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:27:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:27:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:27:49,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 02:27:49,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 294 transitions, 8846 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:49,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:49,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 02:27:49,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:49,257 INFO L130 PetriNetUnfolder]: 346/707 cut-off events. [2022-12-06 02:27:49,258 INFO L131 PetriNetUnfolder]: For 1642/1642 co-relation queries the response was YES. [2022-12-06 02:27:49,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11089 conditions, 707 events. 346/707 cut-off events. For 1642/1642 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3786 event pairs, 0 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 4301. Up to 611 conditions per place. [2022-12-06 02:27:49,263 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 115 selfloop transitions, 26 changer transitions 137/282 dead transitions. [2022-12-06 02:27:49,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 282 transitions, 9014 flow [2022-12-06 02:27:49,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 02:27:49,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-06 02:27:49,264 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 68 predicate places. [2022-12-06 02:27:49,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:49,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 282 transitions, 9014 flow [2022-12-06 02:27:49,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 282 transitions, 9014 flow [2022-12-06 02:27:49,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:49,274 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:49,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:27:49,275 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 282 transitions, 9014 flow [2022-12-06 02:27:49,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:49,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:49,275 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:49,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:49,480 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,SelfDestructingSolverStorable14 [2022-12-06 02:27:49,480 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash -110538211, now seen corresponding path program 2 times [2022-12-06 02:27:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:49,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669834582] [2022-12-06 02:27:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:27:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669834582] [2022-12-06 02:27:49,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669834582] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:49,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584423415] [2022-12-06 02:27:49,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:49,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:49,541 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:49,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:27:49,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:49,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:49,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:27:49,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:27:49,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:27:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584423415] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:49,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:49,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 02:27:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358462000] [2022-12-06 02:27:49,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:49,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:27:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:27:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:27:49,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 02:27:49,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 282 transitions, 9014 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:49,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:49,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 02:27:49,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:49,840 INFO L130 PetriNetUnfolder]: 284/594 cut-off events. [2022-12-06 02:27:49,840 INFO L131 PetriNetUnfolder]: For 1871/1871 co-relation queries the response was YES. [2022-12-06 02:27:49,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 594 events. 284/594 cut-off events. For 1871/1871 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3026 event pairs, 8 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 3547. Up to 498 conditions per place. [2022-12-06 02:27:49,845 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 79 selfloop transitions, 26 changer transitions 137/247 dead transitions. [2022-12-06 02:27:49,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 247 transitions, 8327 flow [2022-12-06 02:27:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:27:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:27:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 02:27:49,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-06 02:27:49,847 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 72 predicate places. [2022-12-06 02:27:49,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:49,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 247 transitions, 8327 flow [2022-12-06 02:27:49,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 247 transitions, 8327 flow [2022-12-06 02:27:49,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:49,856 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:49,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 02:27:49,857 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 247 transitions, 8327 flow [2022-12-06 02:27:49,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:49,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:49,858 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:49,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:50,063 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,SelfDestructingSolverStorable15 [2022-12-06 02:27:50,063 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1994791337, now seen corresponding path program 3 times [2022-12-06 02:27:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165685229] [2022-12-06 02:27:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:50,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:50,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165685229] [2022-12-06 02:27:50,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165685229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:50,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464710431] [2022-12-06 02:27:50,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:27:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:50,651 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:50,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:27:50,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:27:50,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:50,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:27:50,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:50,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:51,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:51,052 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 36 treesize of output 52 [2022-12-06 02:27:51,100 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:27:51,100 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 35 treesize of output 17 [2022-12-06 02:27:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464710431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:51,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:51,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 19 [2022-12-06 02:27:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915094102] [2022-12-06 02:27:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:51,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:27:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:27:51,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:27:51,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:27:51,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 247 transitions, 8327 flow. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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 02:27:51,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:51,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:27:51,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:52,154 INFO L130 PetriNetUnfolder]: 373/771 cut-off events. [2022-12-06 02:27:52,154 INFO L131 PetriNetUnfolder]: For 2443/2443 co-relation queries the response was YES. [2022-12-06 02:27:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13562 conditions, 771 events. 373/771 cut-off events. For 2443/2443 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4113 event pairs, 14 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 5078. Up to 669 conditions per place. [2022-12-06 02:27:52,159 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 129 selfloop transitions, 52 changer transitions 174/355 dead transitions. [2022-12-06 02:27:52,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 355 transitions, 12682 flow [2022-12-06 02:27:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:27:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:27:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 151 transitions. [2022-12-06 02:27:52,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33114035087719296 [2022-12-06 02:27:52,161 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-06 02:27:52,161 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:52,161 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 355 transitions, 12682 flow [2022-12-06 02:27:52,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 355 transitions, 12682 flow [2022-12-06 02:27:52,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:53,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:27:53,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1487 [2022-12-06 02:27:53,648 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 354 transitions, 12646 flow [2022-12-06 02:27:53,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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 02:27:53,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:53,648 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:53,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 02:27:53,849 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,SelfDestructingSolverStorable16 [2022-12-06 02:27:53,849 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash -373596425, now seen corresponding path program 1 times [2022-12-06 02:27:53,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:53,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51651696] [2022-12-06 02:27:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51651696] [2022-12-06 02:27:54,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51651696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605882180] [2022-12-06 02:27:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:54,469 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:54,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:27:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:54,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:27:54,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:54,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:54,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:54,787 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 36 treesize of output 52 [2022-12-06 02:27:54,823 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:27:54,823 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 35 treesize of output 17 [2022-12-06 02:27:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:54,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605882180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:54,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:54,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:27:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082527167] [2022-12-06 02:27:54,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:54,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:27:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:27:54,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:27:54,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:27:54,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 354 transitions, 12646 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:54,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:54,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:27:54,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:27:56,642 INFO L130 PetriNetUnfolder]: 518/1045 cut-off events. [2022-12-06 02:27:56,642 INFO L131 PetriNetUnfolder]: For 2681/2681 co-relation queries the response was YES. [2022-12-06 02:27:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19531 conditions, 1045 events. 518/1045 cut-off events. For 2681/2681 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5912 event pairs, 10 based on Foata normal form. 3/952 useless extension candidates. Maximal degree in co-relation 7208. Up to 932 conditions per place. [2022-12-06 02:27:56,651 INFO L137 encePairwiseOnDemand]: 6/20 looper letters, 217 selfloop transitions, 78 changer transitions 217/512 dead transitions. [2022-12-06 02:27:56,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 512 transitions, 19408 flow [2022-12-06 02:27:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 02:27:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 02:27:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 221 transitions. [2022-12-06 02:27:56,653 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27625 [2022-12-06 02:27:56,654 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 133 predicate places. [2022-12-06 02:27:56,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:27:56,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 512 transitions, 19408 flow [2022-12-06 02:27:56,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 512 transitions, 19408 flow [2022-12-06 02:27:56,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:27:56,675 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:27:56,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 02:27:56,676 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 512 transitions, 19408 flow [2022-12-06 02:27:56,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:56,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:27:56,677 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:27:56,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 02:27:56,883 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,SelfDestructingSolverStorable17 [2022-12-06 02:27:56,883 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:27:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:27:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1901130231, now seen corresponding path program 2 times [2022-12-06 02:27:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:27:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437198319] [2022-12-06 02:27:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:27:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:27:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:27:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:27:57,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437198319] [2022-12-06 02:27:57,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437198319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:27:57,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549160713] [2022-12-06 02:27:57,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:27:57,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:27:57,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:27:57,371 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:27:57,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 02:27:57,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:27:57,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:27:57,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:27:57,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:27:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:57,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:27:57,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:27:57,752 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 36 treesize of output 52 [2022-12-06 02:27:57,787 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:27:57,787 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 35 treesize of output 17 [2022-12-06 02:27:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:27:57,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549160713] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:27:57,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:27:57,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:27:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091553796] [2022-12-06 02:27:57,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:27:57,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:27:57,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:27:57,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:27:57,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:27:57,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:27:57,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 512 transitions, 19408 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:27:57,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:27:57,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:27:57,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:00,475 INFO L130 PetriNetUnfolder]: 795/1604 cut-off events. [2022-12-06 02:28:00,476 INFO L131 PetriNetUnfolder]: For 3092/3092 co-relation queries the response was YES. [2022-12-06 02:28:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31706 conditions, 1604 events. 795/1604 cut-off events. For 3092/3092 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9970 event pairs, 14 based on Foata normal form. 3/1391 useless extension candidates. Maximal degree in co-relation 14431. Up to 1481 conditions per place. [2022-12-06 02:28:00,548 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 348 selfloop transitions, 153 changer transitions 271/772 dead transitions. [2022-12-06 02:28:00,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 772 transitions, 30937 flow [2022-12-06 02:28:00,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 02:28:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 02:28:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 299 transitions. [2022-12-06 02:28:00,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2931372549019608 [2022-12-06 02:28:00,551 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 183 predicate places. [2022-12-06 02:28:00,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:00,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 772 transitions, 30937 flow [2022-12-06 02:28:00,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 772 transitions, 30937 flow [2022-12-06 02:28:00,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:00,584 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:00,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 02:28:00,585 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 772 transitions, 30937 flow [2022-12-06 02:28:00,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:00,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:00,585 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:00,593 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 02:28:00,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:00,791 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -95810729, now seen corresponding path program 3 times [2022-12-06 02:28:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:00,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375025244] [2022-12-06 02:28:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375025244] [2022-12-06 02:28:01,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375025244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32738601] [2022-12-06 02:28:01,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:28:01,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:01,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:01,228 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:01,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 02:28:01,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:28:01,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:01,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:28:01,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:01,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:01,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:01,527 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 36 treesize of output 52 [2022-12-06 02:28:01,570 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:28:01,570 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 35 treesize of output 17 [2022-12-06 02:28:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:01,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32738601] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:01,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:01,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:28:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513698455] [2022-12-06 02:28:01,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:01,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:28:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:28:01,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:28:01,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:01,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 772 transitions, 30937 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 02:28:01,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:01,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:01,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:03,112 INFO L130 PetriNetUnfolder]: 874/1759 cut-off events. [2022-12-06 02:28:03,113 INFO L131 PetriNetUnfolder]: For 3114/3114 co-relation queries the response was YES. [2022-12-06 02:28:03,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36584 conditions, 1759 events. 874/1759 cut-off events. For 3114/3114 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11027 event pairs, 12 based on Foata normal form. 4/1501 useless extension candidates. Maximal degree in co-relation 17308. Up to 1636 conditions per place. [2022-12-06 02:28:03,126 INFO L137 encePairwiseOnDemand]: 6/20 looper letters, 478 selfloop transitions, 78 changer transitions 307/863 dead transitions. [2022-12-06 02:28:03,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 863 transitions, 36363 flow [2022-12-06 02:28:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 02:28:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 02:28:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 220 transitions. [2022-12-06 02:28:03,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2022-12-06 02:28:03,128 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 217 predicate places. [2022-12-06 02:28:03,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:03,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 863 transitions, 36363 flow [2022-12-06 02:28:03,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 863 transitions, 36363 flow [2022-12-06 02:28:03,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:03,203 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:03,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 02:28:03,203 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 863 transitions, 36363 flow [2022-12-06 02:28:03,203 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 02:28:03,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:03,204 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:03,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:03,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:03,408 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 491302695, now seen corresponding path program 4 times [2022-12-06 02:28:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:03,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929336613] [2022-12-06 02:28:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929336613] [2022-12-06 02:28:03,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929336613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543484275] [2022-12-06 02:28:03,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:28:03,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:03,895 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:03,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 02:28:03,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:28:03,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:03,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:28:03,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:04,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:04,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:04,153 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 43 treesize of output 62 [2022-12-06 02:28:04,243 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:04,243 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 42 treesize of output 17 [2022-12-06 02:28:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:04,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543484275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:04,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:04,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:28:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853500229] [2022-12-06 02:28:04,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:04,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:28:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:28:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:28:04,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:04,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 863 transitions, 36363 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:04,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:04,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:04,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:05,750 INFO L130 PetriNetUnfolder]: 1055/2088 cut-off events. [2022-12-06 02:28:05,750 INFO L131 PetriNetUnfolder]: For 3162/3162 co-relation queries the response was YES. [2022-12-06 02:28:05,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45611 conditions, 2088 events. 1055/2088 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13397 event pairs, 14 based on Foata normal form. 4/1748 useless extension candidates. Maximal degree in co-relation 24294. Up to 1965 conditions per place. [2022-12-06 02:28:05,797 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 606 selfloop transitions, 87 changer transitions 322/1015 dead transitions. [2022-12-06 02:28:05,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1015 transitions, 44855 flow [2022-12-06 02:28:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 02:28:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 02:28:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 199 transitions. [2022-12-06 02:28:05,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3109375 [2022-12-06 02:28:05,806 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 248 predicate places. [2022-12-06 02:28:05,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:05,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 1015 transitions, 44855 flow [2022-12-06 02:28:05,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 1015 transitions, 44855 flow [2022-12-06 02:28:05,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:05,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:05,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 02:28:05,854 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 1015 transitions, 44855 flow [2022-12-06 02:28:05,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:05,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:05,854 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:05,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:06,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:06,060 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 837798079, now seen corresponding path program 5 times [2022-12-06 02:28:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58766567] [2022-12-06 02:28:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:06,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58766567] [2022-12-06 02:28:06,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58766567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382693479] [2022-12-06 02:28:06,480 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:28:06,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:06,481 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:06,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 02:28:06,571 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:28:06,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:06,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-06 02:28:06,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:06,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:06,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:06,789 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 42 treesize of output 61 [2022-12-06 02:28:06,831 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:06,832 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 43 treesize of output 18 [2022-12-06 02:28:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:06,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382693479] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:06,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:06,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-06 02:28:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115961533] [2022-12-06 02:28:06,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:06,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:28:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:28:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:28:06,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:06,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 1015 transitions, 44855 flow. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:06,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:06,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:06,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:08,515 INFO L130 PetriNetUnfolder]: 1140/2244 cut-off events. [2022-12-06 02:28:08,516 INFO L131 PetriNetUnfolder]: For 3192/3192 co-relation queries the response was YES. [2022-12-06 02:28:08,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51304 conditions, 2244 events. 1140/2244 cut-off events. For 3192/3192 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14571 event pairs, 16 based on Foata normal form. 2/1858 useless extension candidates. Maximal degree in co-relation 27271. Up to 2121 conditions per place. [2022-12-06 02:28:08,532 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 684 selfloop transitions, 62 changer transitions 333/1079 dead transitions. [2022-12-06 02:28:08,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1079 transitions, 49871 flow [2022-12-06 02:28:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:28:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:28:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 156 transitions. [2022-12-06 02:28:08,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.312 [2022-12-06 02:28:08,556 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 272 predicate places. [2022-12-06 02:28:08,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:08,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 1079 transitions, 49871 flow [2022-12-06 02:28:08,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 1079 transitions, 49871 flow [2022-12-06 02:28:08,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:08,601 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:08,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 02:28:08,602 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 1079 transitions, 49871 flow [2022-12-06 02:28:08,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:08,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:08,602 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:08,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:08,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:08,811 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1447808351, now seen corresponding path program 6 times [2022-12-06 02:28:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:08,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100192668] [2022-12-06 02:28:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:09,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100192668] [2022-12-06 02:28:09,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100192668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:09,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219413078] [2022-12-06 02:28:09,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:28:09,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:09,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 02:28:09,303 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:28:09,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:09,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 02:28:09,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:09,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:09,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:09,489 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 43 treesize of output 62 [2022-12-06 02:28:09,526 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:09,526 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 42 treesize of output 17 [2022-12-06 02:28:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:09,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219413078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:09,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:09,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 02:28:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928737588] [2022-12-06 02:28:09,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:09,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:28:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:28:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:28:09,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:09,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1079 transitions, 49871 flow. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 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 02:28:09,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:09,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:09,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:11,258 INFO L130 PetriNetUnfolder]: 1191/2356 cut-off events. [2022-12-06 02:28:11,258 INFO L131 PetriNetUnfolder]: For 3317/3317 co-relation queries the response was YES. [2022-12-06 02:28:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56234 conditions, 2356 events. 1191/2356 cut-off events. For 3317/3317 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15523 event pairs, 10 based on Foata normal form. 2/1942 useless extension candidates. Maximal degree in co-relation 29737. Up to 2218 conditions per place. [2022-12-06 02:28:11,282 INFO L137 encePairwiseOnDemand]: 6/20 looper letters, 707 selfloop transitions, 70 changer transitions 356/1133 dead transitions. [2022-12-06 02:28:11,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 1133 transitions, 54653 flow [2022-12-06 02:28:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 02:28:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 02:28:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 168 transitions. [2022-12-06 02:28:11,286 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 02:28:11,287 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 298 predicate places. [2022-12-06 02:28:11,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:11,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 1133 transitions, 54653 flow [2022-12-06 02:28:11,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 319 places, 1133 transitions, 54653 flow [2022-12-06 02:28:11,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:11,334 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:11,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 02:28:11,337 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 1133 transitions, 54653 flow [2022-12-06 02:28:11,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 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 02:28:11,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:11,337 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:11,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:11,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:11,542 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 961102423, now seen corresponding path program 7 times [2022-12-06 02:28:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:11,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258650328] [2022-12-06 02:28:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258650328] [2022-12-06 02:28:12,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258650328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:12,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755519434] [2022-12-06 02:28:12,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:28:12,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:12,030 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:12,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 02:28:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:12,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 02:28:12,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:12,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:12,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:12,435 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 43 treesize of output 62 [2022-12-06 02:28:12,486 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:12,487 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 42 treesize of output 17 [2022-12-06 02:28:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:12,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755519434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:12,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:12,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:28:12,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387199015] [2022-12-06 02:28:12,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:12,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:28:12,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:12,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:28:12,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:28:12,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:12,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 1133 transitions, 54653 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:12,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:12,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:12,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:15,177 INFO L130 PetriNetUnfolder]: 1347/2631 cut-off events. [2022-12-06 02:28:15,177 INFO L131 PetriNetUnfolder]: For 3443/3443 co-relation queries the response was YES. [2022-12-06 02:28:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65485 conditions, 2631 events. 1347/2631 cut-off events. For 3443/3443 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17554 event pairs, 22 based on Foata normal form. 3/2140 useless extension candidates. Maximal degree in co-relation 36139. Up to 2493 conditions per place. [2022-12-06 02:28:15,195 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 805 selfloop transitions, 79 changer transitions 364/1248 dead transitions. [2022-12-06 02:28:15,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1248 transitions, 62711 flow [2022-12-06 02:28:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:28:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:28:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 187 transitions. [2022-12-06 02:28:15,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-06 02:28:15,199 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 330 predicate places. [2022-12-06 02:28:15,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:15,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 1248 transitions, 62711 flow [2022-12-06 02:28:15,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 1248 transitions, 62711 flow [2022-12-06 02:28:15,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:15,264 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:15,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 02:28:15,265 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1248 transitions, 62711 flow [2022-12-06 02:28:15,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:15,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:15,265 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:15,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:15,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:15,470 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 614607039, now seen corresponding path program 8 times [2022-12-06 02:28:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:15,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313499865] [2022-12-06 02:28:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313499865] [2022-12-06 02:28:15,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313499865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783262841] [2022-12-06 02:28:15,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:28:15,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:15,819 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:15,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 02:28:15,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:28:15,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:15,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:28:15,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:16,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:16,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:16,089 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 43 treesize of output 62 [2022-12-06 02:28:16,118 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:16,119 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 42 treesize of output 17 [2022-12-06 02:28:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:16,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783262841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:16,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:16,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 02:28:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183532103] [2022-12-06 02:28:16,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:16,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:28:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:28:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:28:16,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:16,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1248 transitions, 62711 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:16,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:16,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:16,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:18,275 INFO L130 PetriNetUnfolder]: 1416/2753 cut-off events. [2022-12-06 02:28:18,275 INFO L131 PetriNetUnfolder]: For 3353/3353 co-relation queries the response was YES. [2022-12-06 02:28:18,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71298 conditions, 2753 events. 1416/2753 cut-off events. For 3353/3353 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18479 event pairs, 14 based on Foata normal form. 2/2223 useless extension candidates. Maximal degree in co-relation 40061. Up to 2615 conditions per place. [2022-12-06 02:28:18,297 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 869 selfloop transitions, 56 changer transitions 370/1295 dead transitions. [2022-12-06 02:28:18,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1295 transitions, 67669 flow [2022-12-06 02:28:18,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:28:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:28:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 137 transitions. [2022-12-06 02:28:18,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31136363636363634 [2022-12-06 02:28:18,300 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 351 predicate places. [2022-12-06 02:28:18,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:18,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 1295 transitions, 67669 flow [2022-12-06 02:28:18,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 1295 transitions, 67669 flow [2022-12-06 02:28:18,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:18,345 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:18,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 02:28:18,347 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 1295 transitions, 67669 flow [2022-12-06 02:28:18,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:18,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:18,348 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:18,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:18,552 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,SelfDestructingSolverStorable24 [2022-12-06 02:28:18,552 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1035838537, now seen corresponding path program 9 times [2022-12-06 02:28:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:18,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892954011] [2022-12-06 02:28:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892954011] [2022-12-06 02:28:19,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892954011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:19,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043524012] [2022-12-06 02:28:19,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:28:19,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:19,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:19,012 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:19,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 02:28:19,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:28:19,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:19,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 02:28:19,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:19,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:19,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:19,386 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 43 treesize of output 62 [2022-12-06 02:28:19,419 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:19,419 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 42 treesize of output 17 [2022-12-06 02:28:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:19,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043524012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:19,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:19,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:28:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477433153] [2022-12-06 02:28:19,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:19,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:28:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:28:19,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:28:19,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:19,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 1295 transitions, 67669 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 02:28:19,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:19,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:19,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:22,514 INFO L130 PetriNetUnfolder]: 1491/2908 cut-off events. [2022-12-06 02:28:22,514 INFO L131 PetriNetUnfolder]: For 3387/3387 co-relation queries the response was YES. [2022-12-06 02:28:22,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78257 conditions, 2908 events. 1491/2908 cut-off events. For 3387/3387 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 19793 event pairs, 20 based on Foata normal form. 4/2334 useless extension candidates. Maximal degree in co-relation 43041. Up to 2770 conditions per place. [2022-12-06 02:28:22,572 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 882 selfloop transitions, 103 changer transitions 397/1382 dead transitions. [2022-12-06 02:28:22,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1382 transitions, 75017 flow [2022-12-06 02:28:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:28:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:28:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 193 transitions. [2022-12-06 02:28:22,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2924242424242424 [2022-12-06 02:28:22,575 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 383 predicate places. [2022-12-06 02:28:22,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:22,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 404 places, 1382 transitions, 75017 flow [2022-12-06 02:28:22,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 404 places, 1382 transitions, 75017 flow [2022-12-06 02:28:22,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:22,663 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:22,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 02:28:22,664 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 1382 transitions, 75017 flow [2022-12-06 02:28:22,664 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 02:28:22,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:22,665 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:22,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-06 02:28:22,869 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,SelfDestructingSolverStorable25 [2022-12-06 02:28:22,870 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash 717704331, now seen corresponding path program 10 times [2022-12-06 02:28:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:22,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379212568] [2022-12-06 02:28:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:22,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:23,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379212568] [2022-12-06 02:28:23,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379212568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:23,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068322983] [2022-12-06 02:28:23,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:28:23,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:23,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:23,343 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:23,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 02:28:23,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:28:23,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:23,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 02:28:23,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:23,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:28:23,500 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 14 treesize of output 16 [2022-12-06 02:28:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:23,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:23,697 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (.cse1 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_832) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1)) (+ (select .cse0 .cse2) c_~counter~0 1)))) (forall ((v_ArrVal_832 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_832) c_~A~0.base))) (<= (+ (select .cse3 .cse2) c_~counter~0) (+ (select .cse3 c_~A~0.offset) (select .cse3 .cse1))))))) is different from false [2022-12-06 02:28:23,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:23,728 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 74 treesize of output 81 [2022-12-06 02:28:23,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:23,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-12-06 02:28:23,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:28:23,812 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:28:23,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2022-12-06 02:28:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:23,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068322983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:23,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:23,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:28:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11063611] [2022-12-06 02:28:23,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:23,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:28:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:28:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2022-12-06 02:28:23,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:23,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1382 transitions, 75017 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 02:28:23,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:23,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:23,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:26,481 INFO L130 PetriNetUnfolder]: 1557/3028 cut-off events. [2022-12-06 02:28:26,481 INFO L131 PetriNetUnfolder]: For 3636/3636 co-relation queries the response was YES. [2022-12-06 02:28:26,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84501 conditions, 3028 events. 1557/3028 cut-off events. For 3636/3636 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 20767 event pairs, 10 based on Foata normal form. 1/2432 useless extension candidates. Maximal degree in co-relation 46095. Up to 2890 conditions per place. [2022-12-06 02:28:26,506 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 954 selfloop transitions, 73 changer transitions 419/1446 dead transitions. [2022-12-06 02:28:26,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 1446 transitions, 81374 flow [2022-12-06 02:28:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:28:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:28:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 140 transitions. [2022-12-06 02:28:26,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-06 02:28:26,507 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 404 predicate places. [2022-12-06 02:28:26,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:26,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 425 places, 1446 transitions, 81374 flow [2022-12-06 02:28:26,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 425 places, 1446 transitions, 81374 flow [2022-12-06 02:28:26,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:26,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:26,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 02:28:26,563 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 1446 transitions, 81374 flow [2022-12-06 02:28:26,563 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 02:28:26,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:26,564 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:26,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 02:28:26,769 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 898029035, now seen corresponding path program 11 times [2022-12-06 02:28:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:26,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891977190] [2022-12-06 02:28:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:27,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891977190] [2022-12-06 02:28:27,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891977190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:27,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609768847] [2022-12-06 02:28:27,263 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:28:27,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:27,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:27,264 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:27,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 02:28:27,389 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:28:27,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:27,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-06 02:28:27,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:27,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:27,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:27,579 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 42 treesize of output 61 [2022-12-06 02:28:27,613 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:27,613 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 43 treesize of output 18 [2022-12-06 02:28:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609768847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:27,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:27,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-12-06 02:28:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678524209] [2022-12-06 02:28:27,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:27,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:28:27,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:27,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:28:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:28:27,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:27,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 1446 transitions, 81374 flow. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:27,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:27,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:27,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:30,429 INFO L130 PetriNetUnfolder]: 1655/3203 cut-off events. [2022-12-06 02:28:30,429 INFO L131 PetriNetUnfolder]: For 3768/3768 co-relation queries the response was YES. [2022-12-06 02:28:30,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92618 conditions, 3203 events. 1655/3203 cut-off events. For 3768/3768 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22162 event pairs, 16 based on Foata normal form. 1/2565 useless extension candidates. Maximal degree in co-relation 50184. Up to 3065 conditions per place. [2022-12-06 02:28:30,454 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 1036 selfloop transitions, 56 changer transitions 422/1514 dead transitions. [2022-12-06 02:28:30,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1514 transitions, 88240 flow [2022-12-06 02:28:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 02:28:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 02:28:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 162 transitions. [2022-12-06 02:28:30,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2892857142857143 [2022-12-06 02:28:30,455 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 431 predicate places. [2022-12-06 02:28:30,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:30,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 1514 transitions, 88240 flow [2022-12-06 02:28:30,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 452 places, 1514 transitions, 88240 flow [2022-12-06 02:28:30,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:30,509 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:30,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 02:28:30,509 INFO L495 AbstractCegarLoop]: Abstraction has has 452 places, 1514 transitions, 88240 flow [2022-12-06 02:28:30,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:30,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:30,510 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:30,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:30,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:30,712 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash 375329259, now seen corresponding path program 12 times [2022-12-06 02:28:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829780955] [2022-12-06 02:28:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829780955] [2022-12-06 02:28:31,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829780955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655463050] [2022-12-06 02:28:31,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:28:31,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:31,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:31,296 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:31,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 02:28:31,401 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:28:31,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:31,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 02:28:31,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:31,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:28:31,489 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 22 treesize of output 22 [2022-12-06 02:28:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:31,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:31,644 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_909 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_909) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1))) (+ c_~counter~0 1))) (forall ((v_ArrVal_909 (Array Int Int))) (<= c_~counter~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_909) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 .cse1))))))) is different from false [2022-12-06 02:28:31,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:31,711 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 76 treesize of output 74 [2022-12-06 02:28:31,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:31,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 12 [2022-12-06 02:28:31,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:28:31,778 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:28:31,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2022-12-06 02:28:31,822 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 02:28:31,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655463050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:31,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:31,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:28:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732140079] [2022-12-06 02:28:31,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:31,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:28:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:28:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=4, NotChecked=42, Total=552 [2022-12-06 02:28:31,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:31,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 1514 transitions, 88240 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 02:28:31,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:31,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:31,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:35,046 INFO L130 PetriNetUnfolder]: 1697/3278 cut-off events. [2022-12-06 02:28:35,046 INFO L131 PetriNetUnfolder]: For 3933/3933 co-relation queries the response was YES. [2022-12-06 02:28:35,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98052 conditions, 3278 events. 1697/3278 cut-off events. For 3933/3933 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22738 event pairs, 8 based on Foata normal form. 1/2623 useless extension candidates. Maximal degree in co-relation 51915. Up to 3140 conditions per place. [2022-12-06 02:28:35,076 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 1039 selfloop transitions, 79 changer transitions 423/1541 dead transitions. [2022-12-06 02:28:35,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 1541 transitions, 92896 flow [2022-12-06 02:28:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:28:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:28:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 140 transitions. [2022-12-06 02:28:35,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-06 02:28:35,078 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 452 predicate places. [2022-12-06 02:28:35,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:35,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 473 places, 1541 transitions, 92896 flow [2022-12-06 02:28:35,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 473 places, 1541 transitions, 92896 flow [2022-12-06 02:28:35,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:35,139 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:35,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-06 02:28:35,140 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 1541 transitions, 92896 flow [2022-12-06 02:28:35,140 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 02:28:35,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:35,140 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:35,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:35,342 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,SelfDestructingSolverStorable28 [2022-12-06 02:28:35,343 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1035899797, now seen corresponding path program 13 times [2022-12-06 02:28:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:35,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681316163] [2022-12-06 02:28:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:35,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681316163] [2022-12-06 02:28:35,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681316163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:35,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820749804] [2022-12-06 02:28:35,891 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:28:35,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:35,892 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:35,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 02:28:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:36,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-06 02:28:36,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:36,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:28:36,076 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 02:28:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:36,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:36,281 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse1 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 .cse1)) (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse2))))) (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) c_~A~0.base))) (< (+ (select .cse3 c_~A~0.offset) (select .cse3 .cse2)) (+ c_~counter~0 (select .cse3 .cse1) 1)))))) is different from false [2022-12-06 02:28:36,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:36,304 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 76 treesize of output 83 [2022-12-06 02:28:36,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:36,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2022-12-06 02:28:36,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:28:36,399 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:28:36,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 17 [2022-12-06 02:28:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820749804] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:36,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:28:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210773720] [2022-12-06 02:28:36,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:36,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:28:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:28:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=434, Unknown=1, NotChecked=42, Total=552 [2022-12-06 02:28:36,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:36,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1541 transitions, 92896 flow. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:36,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:36,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:36,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:39,261 INFO L130 PetriNetUnfolder]: 1734/3346 cut-off events. [2022-12-06 02:28:39,262 INFO L131 PetriNetUnfolder]: For 3854/3854 co-relation queries the response was YES. [2022-12-06 02:28:39,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103424 conditions, 3346 events. 1734/3346 cut-off events. For 3854/3854 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23307 event pairs, 14 based on Foata normal form. 1/2679 useless extension candidates. Maximal degree in co-relation 53827. Up to 3208 conditions per place. [2022-12-06 02:28:39,287 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 1078 selfloop transitions, 60 changer transitions 441/1579 dead transitions. [2022-12-06 02:28:39,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 1579 transitions, 98332 flow [2022-12-06 02:28:39,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:28:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:28:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2022-12-06 02:28:39,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 02:28:39,293 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 465 predicate places. [2022-12-06 02:28:39,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:39,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 486 places, 1579 transitions, 98332 flow [2022-12-06 02:28:39,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 486 places, 1579 transitions, 98332 flow [2022-12-06 02:28:39,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:39,360 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:39,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 02:28:39,361 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 1579 transitions, 98332 flow [2022-12-06 02:28:39,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:39,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:39,361 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:39,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:39,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:39,564 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1238826859, now seen corresponding path program 14 times [2022-12-06 02:28:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522258493] [2022-12-06 02:28:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522258493] [2022-12-06 02:28:40,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522258493] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631219900] [2022-12-06 02:28:40,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:28:40,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:40,245 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:40,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 02:28:40,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:28:40,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:40,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 02:28:40,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:40,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:28:40,401 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 14 treesize of output 16 [2022-12-06 02:28:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:40,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:40,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse1 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (forall ((v_ArrVal_987 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 .cse1)) (+ (select .cse0 .cse2) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_987 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) c_~A~0.base))) (< (+ (select .cse3 .cse2) (select .cse3 c_~A~0.offset)) (+ c_~counter~0 (select .cse3 .cse1) 1)))))) is different from false [2022-12-06 02:28:40,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:40,607 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 74 treesize of output 81 [2022-12-06 02:28:40,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:40,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-12-06 02:28:40,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:28:40,696 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:28:40,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2022-12-06 02:28:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:40,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631219900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:40,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:40,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:28:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162874030] [2022-12-06 02:28:40,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:40,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:28:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:28:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=436, Unknown=1, NotChecked=42, Total=552 [2022-12-06 02:28:40,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:40,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 1579 transitions, 98332 flow. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:40,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:40,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:40,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:45,479 INFO L130 PetriNetUnfolder]: 1945/3743 cut-off events. [2022-12-06 02:28:45,479 INFO L131 PetriNetUnfolder]: For 4150/4150 co-relation queries the response was YES. [2022-12-06 02:28:45,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119376 conditions, 3743 events. 1945/3743 cut-off events. For 4150/4150 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 26570 event pairs, 14 based on Foata normal form. 4/2985 useless extension candidates. Maximal degree in co-relation 61402. Up to 3605 conditions per place. [2022-12-06 02:28:45,513 INFO L137 encePairwiseOnDemand]: 6/20 looper letters, 1067 selfloop transitions, 177 changer transitions 487/1731 dead transitions. [2022-12-06 02:28:45,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1731 transitions, 111251 flow [2022-12-06 02:28:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 02:28:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 02:28:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 200 transitions. [2022-12-06 02:28:45,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 02:28:45,514 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 491 predicate places. [2022-12-06 02:28:45,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:45,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 512 places, 1731 transitions, 111251 flow [2022-12-06 02:28:45,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 512 places, 1731 transitions, 111251 flow [2022-12-06 02:28:45,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:45,587 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:45,588 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 02:28:45,588 INFO L495 AbstractCegarLoop]: Abstraction has has 512 places, 1731 transitions, 111251 flow [2022-12-06 02:28:45,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:45,588 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:45,588 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:45,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-06 02:28:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 02:28:45,791 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -758114101, now seen corresponding path program 15 times [2022-12-06 02:28:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:45,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420263837] [2022-12-06 02:28:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420263837] [2022-12-06 02:28:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420263837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:46,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434449376] [2022-12-06 02:28:46,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:28:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:46,387 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:46,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 02:28:46,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:28:46,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:46,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 02:28:46,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:46,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:28:46,603 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 02:28:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:46,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:46,832 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (.cse1 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1026) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1)) (+ c_~counter~0 (select .cse0 .cse2) 1)))) (forall ((v_ArrVal_1026 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1026) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse3 .cse2)) (+ (select .cse3 c_~A~0.offset) (select .cse3 .cse1))))))) is different from false [2022-12-06 02:28:46,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:46,848 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 74 treesize of output 81 [2022-12-06 02:28:46,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:46,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-12-06 02:28:46,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:28:46,921 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:28:46,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2022-12-06 02:28:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:46,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434449376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:46,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:46,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 02:28:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592693668] [2022-12-06 02:28:46,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 02:28:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 02:28:46,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-12-06 02:28:46,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:46,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 1731 transitions, 111251 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 02:28:46,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:46,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:46,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:51,643 INFO L130 PetriNetUnfolder]: 1977/3800 cut-off events. [2022-12-06 02:28:51,643 INFO L131 PetriNetUnfolder]: For 4075/4075 co-relation queries the response was YES. [2022-12-06 02:28:51,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125007 conditions, 3800 events. 1977/3800 cut-off events. For 4075/4075 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 27073 event pairs, 14 based on Foata normal form. 2/3020 useless extension candidates. Maximal degree in co-relation 63321. Up to 3662 conditions per place. [2022-12-06 02:28:51,676 INFO L137 encePairwiseOnDemand]: 5/20 looper letters, 1177 selfloop transitions, 76 changer transitions 495/1748 dead transitions. [2022-12-06 02:28:51,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 1748 transitions, 115847 flow [2022-12-06 02:28:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:28:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:28:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 167 transitions. [2022-12-06 02:28:51,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.334 [2022-12-06 02:28:51,677 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 515 predicate places. [2022-12-06 02:28:51,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:51,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 536 places, 1748 transitions, 115847 flow [2022-12-06 02:28:51,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 536 places, 1748 transitions, 115847 flow [2022-12-06 02:28:51,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:51,752 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:51,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 02:28:51,752 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 1748 transitions, 115847 flow [2022-12-06 02:28:51,753 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 02:28:51,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:51,753 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:51,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:51,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:51,954 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:51,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1599888661, now seen corresponding path program 16 times [2022-12-06 02:28:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:51,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330884586] [2022-12-06 02:28:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330884586] [2022-12-06 02:28:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330884586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342572057] [2022-12-06 02:28:52,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:28:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:52,392 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:52,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 02:28:52,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:28:52,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:52,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:28:52,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:52,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:52,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:52,702 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 43 treesize of output 62 [2022-12-06 02:28:52,744 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:52,744 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 42 treesize of output 17 [2022-12-06 02:28:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:52,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342572057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:52,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:52,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:28:52,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481353935] [2022-12-06 02:28:52,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:52,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:28:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:52,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:28:52,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:28:52,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:52,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 1748 transitions, 115847 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:52,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:52,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:52,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:57,636 INFO L130 PetriNetUnfolder]: 2081/3991 cut-off events. [2022-12-06 02:28:57,636 INFO L131 PetriNetUnfolder]: For 4187/4187 co-relation queries the response was YES. [2022-12-06 02:28:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135313 conditions, 3991 events. 2081/3991 cut-off events. For 4187/4187 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 28603 event pairs, 10 based on Foata normal form. 3/3164 useless extension candidates. Maximal degree in co-relation 69665. Up to 3853 conditions per place. [2022-12-06 02:28:57,685 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 1260 selfloop transitions, 63 changer transitions 510/1833 dead transitions. [2022-12-06 02:28:57,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1833 transitions, 125147 flow [2022-12-06 02:28:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 02:28:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 02:28:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 167 transitions. [2022-12-06 02:28:57,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23857142857142857 [2022-12-06 02:28:57,686 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 549 predicate places. [2022-12-06 02:28:57,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:57,688 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 570 places, 1833 transitions, 125147 flow [2022-12-06 02:28:57,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 570 places, 1833 transitions, 125147 flow [2022-12-06 02:28:57,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:57,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:57,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 02:28:57,768 INFO L495 AbstractCegarLoop]: Abstraction has has 570 places, 1833 transitions, 125147 flow [2022-12-06 02:28:57,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:57,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:57,768 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:57,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-06 02:28:57,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:57,972 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:28:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash 420351979, now seen corresponding path program 17 times [2022-12-06 02:28:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:57,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133828437] [2022-12-06 02:28:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133828437] [2022-12-06 02:28:58,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133828437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:58,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422851509] [2022-12-06 02:28:58,360 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:28:58,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:58,361 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:58,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 02:28:58,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:28:58,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:28:58,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:28:58,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:58,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:58,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:58,675 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 43 treesize of output 62 [2022-12-06 02:28:58,712 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:28:58,712 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 42 treesize of output 17 [2022-12-06 02:28:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:58,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422851509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:58,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:58,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:28:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797150634] [2022-12-06 02:28:58,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:58,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:28:58,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:28:58,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:28:58,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:28:58,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 1833 transitions, 125147 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:58,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:58,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:28:58,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:03,887 INFO L130 PetriNetUnfolder]: 2212/4248 cut-off events. [2022-12-06 02:29:03,887 INFO L131 PetriNetUnfolder]: For 4216/4216 co-relation queries the response was YES. [2022-12-06 02:29:03,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148327 conditions, 4248 events. 2212/4248 cut-off events. For 4216/4216 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 30890 event pairs, 18 based on Foata normal form. 2/3346 useless extension candidates. Maximal degree in co-relation 78834. Up to 4110 conditions per place. [2022-12-06 02:29:03,924 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 1330 selfloop transitions, 97 changer transitions 531/1958 dead transitions. [2022-12-06 02:29:03,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 1958 transitions, 137632 flow [2022-12-06 02:29:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-06 02:29:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-06 02:29:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 191 transitions. [2022-12-06 02:29:03,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28939393939393937 [2022-12-06 02:29:03,925 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 581 predicate places. [2022-12-06 02:29:03,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:03,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 602 places, 1958 transitions, 137632 flow [2022-12-06 02:29:04,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 602 places, 1958 transitions, 137632 flow [2022-12-06 02:29:04,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:04,012 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:04,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 02:29:04,013 INFO L495 AbstractCegarLoop]: Abstraction has has 602 places, 1958 transitions, 137632 flow [2022-12-06 02:29:04,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:04,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:04,013 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:04,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:04,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:04,216 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash -154919151, now seen corresponding path program 18 times [2022-12-06 02:29:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:04,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536308770] [2022-12-06 02:29:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:04,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:04,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536308770] [2022-12-06 02:29:04,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536308770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:04,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760342699] [2022-12-06 02:29:04,559 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:29:04,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:04,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:04,560 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 02:29:04,686 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:29:04,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:04,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:29:04,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:04,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:04,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:04,881 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 43 treesize of output 62 [2022-12-06 02:29:04,925 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-06 02:29:04,925 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 42 treesize of output 17 [2022-12-06 02:29:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:04,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760342699] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:04,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:04,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 02:29:04,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673911012] [2022-12-06 02:29:04,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:04,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:29:04,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:29:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:29:04,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:29:04,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 1958 transitions, 137632 flow. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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 02:29:04,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:04,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:29:04,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:10,515 INFO L130 PetriNetUnfolder]: 2293/4401 cut-off events. [2022-12-06 02:29:10,516 INFO L131 PetriNetUnfolder]: For 4158/4158 co-relation queries the response was YES. [2022-12-06 02:29:10,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158101 conditions, 4401 events. 2293/4401 cut-off events. For 4158/4158 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 32231 event pairs, 16 based on Foata normal form. 4/3455 useless extension candidates. Maximal degree in co-relation 83865. Up to 4263 conditions per place. [2022-12-06 02:29:10,554 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 1415 selfloop transitions, 57 changer transitions 548/2020 dead transitions. [2022-12-06 02:29:10,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 2020 transitions, 146057 flow [2022-12-06 02:29:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:29:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:29:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-12-06 02:29:10,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2022-12-06 02:29:10,557 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 602 predicate places. [2022-12-06 02:29:10,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:10,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 623 places, 2020 transitions, 146057 flow [2022-12-06 02:29:10,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 623 places, 2020 transitions, 146057 flow [2022-12-06 02:29:10,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:10,650 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:10,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 02:29:10,651 INFO L495 AbstractCegarLoop]: Abstraction has has 623 places, 2020 transitions, 146057 flow [2022-12-06 02:29:10,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 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 02:29:10,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:10,651 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:10,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-06 02:29:10,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 02:29:10,856 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash 736087927, now seen corresponding path program 19 times [2022-12-06 02:29:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:10,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288919901] [2022-12-06 02:29:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288919901] [2022-12-06 02:29:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288919901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882537217] [2022-12-06 02:29:11,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:29:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:11,171 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:11,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 02:29:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:11,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:29:11,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:11,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:11,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:11,465 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 35 treesize of output 51 [2022-12-06 02:29:11,493 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:29:11,494 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 36 treesize of output 18 [2022-12-06 02:29:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882537217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:11,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 02:29:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030073390] [2022-12-06 02:29:11,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:11,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:29:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:29:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:29:11,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:29:11,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 2020 transitions, 146057 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:11,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:11,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:29:11,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:17,694 INFO L130 PetriNetUnfolder]: 2406/4614 cut-off events. [2022-12-06 02:29:17,695 INFO L131 PetriNetUnfolder]: For 4362/4362 co-relation queries the response was YES. [2022-12-06 02:29:17,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170393 conditions, 4614 events. 2406/4614 cut-off events. For 4362/4362 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 34099 event pairs, 18 based on Foata normal form. 3/3611 useless extension candidates. Maximal degree in co-relation 91087. Up to 4470 conditions per place. [2022-12-06 02:29:17,735 INFO L137 encePairwiseOnDemand]: 6/20 looper letters, 1476 selfloop transitions, 72 changer transitions 563/2111 dead transitions. [2022-12-06 02:29:17,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 2111 transitions, 156863 flow [2022-12-06 02:29:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-06 02:29:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-06 02:29:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 193 transitions. [2022-12-06 02:29:17,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2838235294117647 [2022-12-06 02:29:17,737 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 635 predicate places. [2022-12-06 02:29:17,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:17,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 656 places, 2111 transitions, 156863 flow [2022-12-06 02:29:17,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 656 places, 2111 transitions, 156863 flow [2022-12-06 02:29:17,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:17,832 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:17,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 02:29:17,833 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 2111 transitions, 156863 flow [2022-12-06 02:29:17,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:17,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:17,833 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:17,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:18,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 02:29:18,037 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash -638721257, now seen corresponding path program 20 times [2022-12-06 02:29:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:18,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142845521] [2022-12-06 02:29:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:18,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:18,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142845521] [2022-12-06 02:29:18,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142845521] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:18,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704304027] [2022-12-06 02:29:18,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:29:18,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:18,467 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:18,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 02:29:18,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:29:18,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:18,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:29:18,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:18,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:18,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:18,780 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 35 treesize of output 51 [2022-12-06 02:29:18,814 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:29:18,815 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 36 treesize of output 18 [2022-12-06 02:29:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:18,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704304027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:18,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:18,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-12-06 02:29:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190579698] [2022-12-06 02:29:18,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:18,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:29:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:29:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:29:18,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:29:18,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 2111 transitions, 156863 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 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 02:29:18,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:18,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:29:18,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:24,734 INFO L130 PetriNetUnfolder]: 2488/4758 cut-off events. [2022-12-06 02:29:24,734 INFO L131 PetriNetUnfolder]: For 4462/4462 co-relation queries the response was YES. [2022-12-06 02:29:24,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180446 conditions, 4758 events. 2488/4758 cut-off events. For 4462/4462 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 35251 event pairs, 18 based on Foata normal form. 2/3718 useless extension candidates. Maximal degree in co-relation 96114. Up to 4606 conditions per place. [2022-12-06 02:29:24,776 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 1530 selfloop transitions, 66 changer transitions 575/2171 dead transitions. [2022-12-06 02:29:24,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 2171 transitions, 165627 flow [2022-12-06 02:29:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:29:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:29:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 157 transitions. [2022-12-06 02:29:24,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2706896551724138 [2022-12-06 02:29:24,778 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 663 predicate places. [2022-12-06 02:29:24,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:24,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 684 places, 2171 transitions, 165627 flow [2022-12-06 02:29:24,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 684 places, 2171 transitions, 165627 flow [2022-12-06 02:29:24,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:24,873 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:24,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-06 02:29:24,874 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 2171 transitions, 165627 flow [2022-12-06 02:29:24,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 20 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 02:29:24,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:24,874 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:24,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:25,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:25,079 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1885134113, now seen corresponding path program 21 times [2022-12-06 02:29:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:25,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138112001] [2022-12-06 02:29:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:25,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138112001] [2022-12-06 02:29:25,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138112001] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:25,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130303673] [2022-12-06 02:29:25,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:29:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:25,384 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:25,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 02:29:25,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:29:25,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:25,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 02:29:25,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:25,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:25,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:25,698 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 35 treesize of output 51 [2022-12-06 02:29:25,739 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:29:25,740 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 36 treesize of output 18 [2022-12-06 02:29:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:25,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130303673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:25,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:25,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 02:29:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774378289] [2022-12-06 02:29:25,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:25,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:29:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:29:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:29:25,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:29:25,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 2171 transitions, 165627 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:25,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:25,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:29:25,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:33,304 INFO L130 PetriNetUnfolder]: 2573/4917 cut-off events. [2022-12-06 02:29:33,304 INFO L131 PetriNetUnfolder]: For 4521/4521 co-relation queries the response was YES. [2022-12-06 02:29:33,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191399 conditions, 4917 events. 2573/4917 cut-off events. For 4521/4521 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36670 event pairs, 16 based on Foata normal form. 2/3833 useless extension candidates. Maximal degree in co-relation 102198. Up to 4761 conditions per place. [2022-12-06 02:29:33,349 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 1554 selfloop transitions, 102 changer transitions 581/2237 dead transitions. [2022-12-06 02:29:33,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 2237 transitions, 175130 flow [2022-12-06 02:29:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 02:29:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 02:29:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 184 transitions. [2022-12-06 02:29:33,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2022-12-06 02:29:33,351 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 692 predicate places. [2022-12-06 02:29:33,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:33,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 713 places, 2237 transitions, 175130 flow [2022-12-06 02:29:33,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 713 places, 2237 transitions, 175130 flow [2022-12-06 02:29:33,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:33,495 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:33,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 02:29:33,495 INFO L495 AbstractCegarLoop]: Abstraction has has 713 places, 2237 transitions, 175130 flow [2022-12-06 02:29:33,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:33,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:33,496 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:33,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:33,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 02:29:33,701 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1235494043, now seen corresponding path program 22 times [2022-12-06 02:29:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:33,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683056219] [2022-12-06 02:29:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:34,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683056219] [2022-12-06 02:29:34,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683056219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:34,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437202611] [2022-12-06 02:29:34,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:29:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:34,060 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:34,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 02:29:34,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:29:34,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:34,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 02:29:34,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:34,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:34,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:34,370 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 35 treesize of output 51 [2022-12-06 02:29:34,420 INFO L321 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2022-12-06 02:29:34,420 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 36 treesize of output 18 [2022-12-06 02:29:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:29:34,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437202611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:34,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:34,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2022-12-06 02:29:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375488778] [2022-12-06 02:29:34,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:34,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 02:29:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 02:29:34,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-12-06 02:29:34,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:29:34,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 2237 transitions, 175130 flow. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 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 02:29:34,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:34,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:29:34,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:42,660 INFO L130 PetriNetUnfolder]: 2617/4995 cut-off events. [2022-12-06 02:29:42,660 INFO L131 PetriNetUnfolder]: For 4509/4509 co-relation queries the response was YES. [2022-12-06 02:29:42,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199443 conditions, 4995 events. 2617/4995 cut-off events. For 4509/4509 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 37287 event pairs, 16 based on Foata normal form. 2/3887 useless extension candidates. Maximal degree in co-relation 104818. Up to 4839 conditions per place. [2022-12-06 02:29:42,726 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 1629 selfloop transitions, 51 changer transitions 586/2266 dead transitions. [2022-12-06 02:29:42,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 2266 transitions, 181936 flow [2022-12-06 02:29:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:29:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:29:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 118 transitions. [2022-12-06 02:29:42,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3105263157894737 [2022-12-06 02:29:42,727 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 710 predicate places. [2022-12-06 02:29:42,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:42,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 731 places, 2266 transitions, 181936 flow [2022-12-06 02:29:42,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 731 places, 2266 transitions, 181936 flow [2022-12-06 02:29:42,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:42,877 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:42,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-06 02:29:42,878 INFO L495 AbstractCegarLoop]: Abstraction has has 731 places, 2266 transitions, 181936 flow [2022-12-06 02:29:42,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 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 02:29:42,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:42,878 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:42,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:43,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 02:29:43,084 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1662212947, now seen corresponding path program 1 times [2022-12-06 02:29:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:43,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622896257] [2022-12-06 02:29:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:43,140 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 02:29:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:43,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622896257] [2022-12-06 02:29:43,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622896257] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:43,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184754597] [2022-12-06 02:29:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:43,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:43,142 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:43,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 02:29:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:43,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:29:43,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:43,340 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 02:29:43,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:43,371 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 02:29:43,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184754597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:43,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 02:29:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531951413] [2022-12-06 02:29:43,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:43,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:29:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:43,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:29:43,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:29:43,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 02:29:43,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 2266 transitions, 181936 flow. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 02:29:43,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:43,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 02:29:43,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:52,275 INFO L130 PetriNetUnfolder]: 2549/4844 cut-off events. [2022-12-06 02:29:52,275 INFO L131 PetriNetUnfolder]: For 5509/5509 co-relation queries the response was YES. [2022-12-06 02:29:52,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198061 conditions, 4844 events. 2549/4844 cut-off events. For 5509/5509 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 35650 event pairs, 12 based on Foata normal form. 0/3810 useless extension candidates. Maximal degree in co-relation 117254. Up to 4684 conditions per place. [2022-12-06 02:29:52,328 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 1554 selfloop transitions, 78 changer transitions 575/2233 dead transitions. [2022-12-06 02:29:52,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 2233 transitions, 183579 flow [2022-12-06 02:29:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:29:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:29:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 02:29:52,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 02:29:52,329 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 715 predicate places. [2022-12-06 02:29:52,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:52,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 736 places, 2233 transitions, 183579 flow [2022-12-06 02:29:52,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 736 places, 2233 transitions, 183579 flow [2022-12-06 02:29:52,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:52,448 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:52,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 02:29:52,448 INFO L495 AbstractCegarLoop]: Abstraction has has 736 places, 2233 transitions, 183579 flow [2022-12-06 02:29:52,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 02:29:52,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:52,448 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:52,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-06 02:29:52,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 02:29:52,654 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:52,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1453952649, now seen corresponding path program 23 times [2022-12-06 02:29:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428350224] [2022-12-06 02:29:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:52,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428350224] [2022-12-06 02:29:52,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428350224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:52,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073759290] [2022-12-06 02:29:52,706 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:29:52,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:52,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:52,721 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:52,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 02:29:52,848 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:29:52,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:52,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:29:52,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:52,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:29:52,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073759290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:52,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:29:52,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 02:29:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664830455] [2022-12-06 02:29:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:29:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:29:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:29:52,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 02:29:52,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 2233 transitions, 183579 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:52,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:52,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 02:29:52,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:58,567 INFO L130 PetriNetUnfolder]: 1736/3610 cut-off events. [2022-12-06 02:29:58,568 INFO L131 PetriNetUnfolder]: For 5837/5837 co-relation queries the response was YES. [2022-12-06 02:29:58,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150989 conditions, 3610 events. 1736/3610 cut-off events. For 5837/5837 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 27663 event pairs, 12 based on Foata normal form. 0/3182 useless extension candidates. Maximal degree in co-relation 74187. Up to 3458 conditions per place. [2022-12-06 02:29:58,723 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 837 selfloop transitions, 80 changer transitions 850/1776 dead transitions. [2022-12-06 02:29:58,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 1776 transitions, 149460 flow [2022-12-06 02:29:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:29:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:29:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 02:29:58,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-06 02:29:58,725 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 700 predicate places. [2022-12-06 02:29:58,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:58,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 721 places, 1776 transitions, 149460 flow [2022-12-06 02:29:58,805 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 721 places, 1776 transitions, 149460 flow [2022-12-06 02:29:58,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:58,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:58,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 02:29:58,808 INFO L495 AbstractCegarLoop]: Abstraction has has 721 places, 1776 transitions, 149460 flow [2022-12-06 02:29:58,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:58,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:58,808 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:58,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:59,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:59,010 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:29:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 416902127, now seen corresponding path program 24 times [2022-12-06 02:29:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:59,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805446183] [2022-12-06 02:29:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:59,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805446183] [2022-12-06 02:29:59,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805446183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:59,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915710208] [2022-12-06 02:29:59,065 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:29:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:59,068 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:59,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 02:29:59,191 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:29:59,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:59,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:29:59,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:59,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:29:59,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915710208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:59,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:29:59,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-12-06 02:29:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505980187] [2022-12-06 02:29:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:59,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:29:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:59,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:29:59,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-06 02:29:59,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 02:29:59,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 1776 transitions, 149460 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:59,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:59,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 02:29:59,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:03,574 INFO L130 PetriNetUnfolder]: 1159/2526 cut-off events. [2022-12-06 02:30:03,574 INFO L131 PetriNetUnfolder]: For 6159/6159 co-relation queries the response was YES. [2022-12-06 02:30:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107961 conditions, 2526 events. 1159/2526 cut-off events. For 6159/6159 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19006 event pairs, 10 based on Foata normal form. 0/2396 useless extension candidates. Maximal degree in co-relation 39099. Up to 2374 conditions per place. [2022-12-06 02:30:03,595 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 327 selfloop transitions, 0 changer transitions 914/1247 dead transitions. [2022-12-06 02:30:03,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 1247 transitions, 107241 flow [2022-12-06 02:30:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:30:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:30:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 02:30:03,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-06 02:30:03,596 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 683 predicate places. [2022-12-06 02:30:03,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:03,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 704 places, 1247 transitions, 107241 flow [2022-12-06 02:30:03,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 704 places, 1247 transitions, 107241 flow [2022-12-06 02:30:03,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:03,660 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:03,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 02:30:03,660 INFO L495 AbstractCegarLoop]: Abstraction has has 704 places, 1247 transitions, 107241 flow [2022-12-06 02:30:03,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:03,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:03,661 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:03,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 02:30:03,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:03,865 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1524221409, now seen corresponding path program 2 times [2022-12-06 02:30:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:03,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016206432] [2022-12-06 02:30:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 02:30:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016206432] [2022-12-06 02:30:03,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016206432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928437270] [2022-12-06 02:30:03,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:30:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:03,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:03,909 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:03,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 02:30:04,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:30:04,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:04,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 02:30:04,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 02:30:04,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 02:30:04,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928437270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:04,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:04,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 02:30:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396883753] [2022-12-06 02:30:04,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:04,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:30:04,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:30:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:30:04,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 02:30:04,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 1247 transitions, 107241 flow. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:04,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:04,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 02:30:04,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:05,890 INFO L130 PetriNetUnfolder]: 1066/2369 cut-off events. [2022-12-06 02:30:05,891 INFO L131 PetriNetUnfolder]: For 6692/6692 co-relation queries the response was YES. [2022-12-06 02:30:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103547 conditions, 2369 events. 1066/2369 cut-off events. For 6692/6692 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 17851 event pairs, 10 based on Foata normal form. 0/2311 useless extension candidates. Maximal degree in co-relation 40000. Up to 2219 conditions per place. [2022-12-06 02:30:05,915 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 223 selfloop transitions, 81 changer transitions 914/1223 dead transitions. [2022-12-06 02:30:05,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 1223 transitions, 107591 flow [2022-12-06 02:30:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:30:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:30:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 02:30:05,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 02:30:05,921 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 688 predicate places. [2022-12-06 02:30:05,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:05,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 709 places, 1223 transitions, 107591 flow [2022-12-06 02:30:05,994 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 709 places, 1223 transitions, 107591 flow [2022-12-06 02:30:05,994 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:05,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:05,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 02:30:05,997 INFO L495 AbstractCegarLoop]: Abstraction has has 709 places, 1223 transitions, 107591 flow [2022-12-06 02:30:05,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:05,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:05,997 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:06,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:06,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-06 02:30:06,201 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash -777279461, now seen corresponding path program 3 times [2022-12-06 02:30:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:06,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696262448] [2022-12-06 02:30:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696262448] [2022-12-06 02:30:06,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696262448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093308869] [2022-12-06 02:30:06,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:30:06,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:06,710 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:06,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 02:30:06,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:30:06,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:06,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 117 conjunts are in the unsatisfiable core [2022-12-06 02:30:06,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:30:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:30:06,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-06 02:30:06,881 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 02:30:06,912 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 02:30:07,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:07,285 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 17 treesize of output 18 [2022-12-06 02:30:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:07,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:08,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093308869] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:08,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:08,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 33 [2022-12-06 02:30:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122878577] [2022-12-06 02:30:08,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 02:30:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 02:30:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-12-06 02:30:08,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:30:08,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 1223 transitions, 107591 flow. Second operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:08,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:08,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:30:08,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:14,486 INFO L130 PetriNetUnfolder]: 1329/2888 cut-off events. [2022-12-06 02:30:14,486 INFO L131 PetriNetUnfolder]: For 9633/9633 co-relation queries the response was YES. [2022-12-06 02:30:14,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128856 conditions, 2888 events. 1329/2888 cut-off events. For 9633/9633 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 21938 event pairs, 8 based on Foata normal form. 2/2809 useless extension candidates. Maximal degree in co-relation 42133. Up to 2680 conditions per place. [2022-12-06 02:30:14,509 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 332 selfloop transitions, 134 changer transitions 1058/1524 dead transitions. [2022-12-06 02:30:14,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 1524 transitions, 136936 flow [2022-12-06 02:30:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 02:30:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 02:30:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 213 transitions. [2022-12-06 02:30:14,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27307692307692305 [2022-12-06 02:30:14,511 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 726 predicate places. [2022-12-06 02:30:14,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:14,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 747 places, 1524 transitions, 136936 flow [2022-12-06 02:30:14,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 747 places, 1524 transitions, 136936 flow [2022-12-06 02:30:14,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:16,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:30:16,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2058 [2022-12-06 02:30:16,569 INFO L495 AbstractCegarLoop]: Abstraction has has 746 places, 1523 transitions, 136846 flow [2022-12-06 02:30:16,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:16,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:16,569 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:16,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:16,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-06 02:30:16,777 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2062358163, now seen corresponding path program 1 times [2022-12-06 02:30:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:16,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489256796] [2022-12-06 02:30:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:16,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:17,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489256796] [2022-12-06 02:30:17,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489256796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:17,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327231823] [2022-12-06 02:30:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:17,420 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:17,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 02:30:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:17,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:30:17,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:17,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:17,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:17,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2022-12-06 02:30:17,919 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:30:17,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:30:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:17,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327231823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:17,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:17,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 02:30:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973417632] [2022-12-06 02:30:17,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:30:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:30:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:30:17,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:30:17,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 1523 transitions, 136846 flow. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:17,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:17,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:30:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:21,088 INFO L130 PetriNetUnfolder]: 1404/3020 cut-off events. [2022-12-06 02:30:21,088 INFO L131 PetriNetUnfolder]: For 9666/9666 co-relation queries the response was YES. [2022-12-06 02:30:21,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137828 conditions, 3020 events. 1404/3020 cut-off events. For 9666/9666 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23016 event pairs, 10 based on Foata normal form. 2/2911 useless extension candidates. Maximal degree in co-relation 43078. Up to 2812 conditions per place. [2022-12-06 02:30:21,112 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 407 selfloop transitions, 108 changer transitions 1060/1575 dead transitions. [2022-12-06 02:30:21,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 1575 transitions, 144689 flow [2022-12-06 02:30:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:30:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:30:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 167 transitions. [2022-12-06 02:30:21,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36147186147186144 [2022-12-06 02:30:21,114 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 746 predicate places. [2022-12-06 02:30:21,114 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:21,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 767 places, 1575 transitions, 144689 flow [2022-12-06 02:30:21,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 767 places, 1575 transitions, 144689 flow [2022-12-06 02:30:21,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:21,201 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:21,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 02:30:21,202 INFO L495 AbstractCegarLoop]: Abstraction has has 767 places, 1575 transitions, 144689 flow [2022-12-06 02:30:21,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:21,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:21,202 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:21,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:21,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 02:30:21,407 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash -727659315, now seen corresponding path program 2 times [2022-12-06 02:30:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:21,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985862966] [2022-12-06 02:30:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:21,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985862966] [2022-12-06 02:30:21,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985862966] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:21,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181194245] [2022-12-06 02:30:21,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:30:21,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:21,924 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:21,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 02:30:22,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:30:22,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:22,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:30:22,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:22,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:22,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:22,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 108 [2022-12-06 02:30:22,460 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:30:22,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:30:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:22,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181194245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:22,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:22,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 02:30:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028477718] [2022-12-06 02:30:22,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:22,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:30:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:30:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:30:22,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:30:22,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 1575 transitions, 144689 flow. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:22,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:22,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:30:22,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:26,304 INFO L130 PetriNetUnfolder]: 1666/3490 cut-off events. [2022-12-06 02:30:26,304 INFO L131 PetriNetUnfolder]: For 9724/9724 co-relation queries the response was YES. [2022-12-06 02:30:26,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162975 conditions, 3490 events. 1666/3490 cut-off events. For 9724/9724 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 26219 event pairs, 10 based on Foata normal form. 3/3264 useless extension candidates. Maximal degree in co-relation 44886. Up to 3282 conditions per place. [2022-12-06 02:30:26,331 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 539 selfloop transitions, 142 changer transitions 1064/1745 dead transitions. [2022-12-06 02:30:26,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 1745 transitions, 163897 flow [2022-12-06 02:30:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:30:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:30:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 202 transitions. [2022-12-06 02:30:26,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38476190476190475 [2022-12-06 02:30:26,333 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 770 predicate places. [2022-12-06 02:30:26,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:26,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 791 places, 1745 transitions, 163897 flow [2022-12-06 02:30:26,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 791 places, 1745 transitions, 163897 flow [2022-12-06 02:30:26,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:26,421 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:26,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 02:30:26,422 INFO L495 AbstractCegarLoop]: Abstraction has has 791 places, 1745 transitions, 163897 flow [2022-12-06 02:30:26,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:26,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:26,422 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:26,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:26,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-06 02:30:26,627 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash -850963659, now seen corresponding path program 3 times [2022-12-06 02:30:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:26,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994215223] [2022-12-06 02:30:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994215223] [2022-12-06 02:30:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994215223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23743726] [2022-12-06 02:30:27,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:30:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:27,020 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:27,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 02:30:27,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:30:27,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:27,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-06 02:30:27,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:27,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:30:27,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:30:27,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:30:27,184 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 02:30:27,214 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 02:30:27,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:27,442 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 17 treesize of output 18 [2022-12-06 02:30:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:27,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:28,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23743726] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:28,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:28,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 29 [2022-12-06 02:30:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089670720] [2022-12-06 02:30:28,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:28,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 02:30:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 02:30:28,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2022-12-06 02:30:28,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:30:28,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 1745 transitions, 163897 flow. Second operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:28,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:28,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:30:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:36,415 INFO L130 PetriNetUnfolder]: 1993/4140 cut-off events. [2022-12-06 02:30:36,415 INFO L131 PetriNetUnfolder]: For 10472/10472 co-relation queries the response was YES. [2022-12-06 02:30:36,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197669 conditions, 4140 events. 1993/4140 cut-off events. For 10472/10472 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31642 event pairs, 6 based on Foata normal form. 4/3793 useless extension candidates. Maximal degree in co-relation 65794. Up to 3932 conditions per place. [2022-12-06 02:30:36,456 INFO L137 encePairwiseOnDemand]: 6/21 looper letters, 741 selfloop transitions, 191 changer transitions 1109/2041 dead transitions. [2022-12-06 02:30:36,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 836 places, 2041 transitions, 195904 flow [2022-12-06 02:30:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 02:30:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 02:30:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 279 transitions. [2022-12-06 02:30:36,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2888198757763975 [2022-12-06 02:30:36,458 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 815 predicate places. [2022-12-06 02:30:36,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:36,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 836 places, 2041 transitions, 195904 flow [2022-12-06 02:30:36,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 836 places, 2041 transitions, 195904 flow [2022-12-06 02:30:36,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:36,572 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:36,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 02:30:36,574 INFO L495 AbstractCegarLoop]: Abstraction has has 836 places, 2041 transitions, 195904 flow [2022-12-06 02:30:36,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:36,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:36,574 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:36,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:36,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:36,779 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1780607501, now seen corresponding path program 4 times [2022-12-06 02:30:36,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:36,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76355091] [2022-12-06 02:30:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:37,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76355091] [2022-12-06 02:30:37,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76355091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:37,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789014269] [2022-12-06 02:30:37,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:30:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:37,312 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:37,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-06 02:30:37,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:30:37,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:37,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:30:37,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:37,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:37,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:37,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2022-12-06 02:30:37,855 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:30:37,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:30:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:37,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789014269] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:37,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:37,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2022-12-06 02:30:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675373574] [2022-12-06 02:30:37,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:30:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:30:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:30:37,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:30:37,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 836 places, 2041 transitions, 195904 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:37,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:37,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:30:37,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:44,694 INFO L130 PetriNetUnfolder]: 2081/4296 cut-off events. [2022-12-06 02:30:44,695 INFO L131 PetriNetUnfolder]: For 10500/10500 co-relation queries the response was YES. [2022-12-06 02:30:44,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209468 conditions, 4296 events. 2081/4296 cut-off events. For 10500/10500 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32846 event pairs, 8 based on Foata normal form. 4/3909 useless extension candidates. Maximal degree in co-relation 71486. Up to 4088 conditions per place. [2022-12-06 02:30:44,736 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 862 selfloop transitions, 119 changer transitions 1113/2094 dead transitions. [2022-12-06 02:30:44,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 857 places, 2094 transitions, 205213 flow [2022-12-06 02:30:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:30:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:30:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 161 transitions. [2022-12-06 02:30:44,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2022-12-06 02:30:44,737 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 836 predicate places. [2022-12-06 02:30:44,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:44,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 857 places, 2094 transitions, 205213 flow [2022-12-06 02:30:44,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 857 places, 2094 transitions, 205213 flow [2022-12-06 02:30:44,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:44,868 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:44,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-06 02:30:44,868 INFO L495 AbstractCegarLoop]: Abstraction has has 857 places, 2094 transitions, 205213 flow [2022-12-06 02:30:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:44,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:44,869 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:44,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-06 02:30:45,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 02:30:45,074 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:45,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1993299309, now seen corresponding path program 5 times [2022-12-06 02:30:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:45,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653178463] [2022-12-06 02:30:45,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:45,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:45,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653178463] [2022-12-06 02:30:45,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653178463] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:45,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811141949] [2022-12-06 02:30:45,559 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:30:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:45,568 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:45,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-06 02:30:45,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:30:45,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:45,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-06 02:30:45,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:45,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:45,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:30:45,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2022-12-06 02:30:46,078 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:30:46,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:30:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:46,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811141949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:46,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:46,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-06 02:30:46,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248408223] [2022-12-06 02:30:46,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:46,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 02:30:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 02:30:46,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-12-06 02:30:46,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:30:46,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 857 places, 2094 transitions, 205213 flow. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:46,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:46,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:30:46,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:30:54,480 INFO L130 PetriNetUnfolder]: 2265/4628 cut-off events. [2022-12-06 02:30:54,480 INFO L131 PetriNetUnfolder]: For 10545/10545 co-relation queries the response was YES. [2022-12-06 02:30:54,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230390 conditions, 4628 events. 2265/4628 cut-off events. For 10545/10545 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 35464 event pairs, 14 based on Foata normal form. 2/4141 useless extension candidates. Maximal degree in co-relation 88864. Up to 4420 conditions per place. [2022-12-06 02:30:54,524 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 939 selfloop transitions, 148 changer transitions 1115/2202 dead transitions. [2022-12-06 02:30:54,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 874 places, 2202 transitions, 220252 flow [2022-12-06 02:30:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:30:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:30:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2022-12-06 02:30:54,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3994708994708995 [2022-12-06 02:30:54,525 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 853 predicate places. [2022-12-06 02:30:54,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:30:54,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 874 places, 2202 transitions, 220252 flow [2022-12-06 02:30:54,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 874 places, 2202 transitions, 220252 flow [2022-12-06 02:30:54,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:30:54,652 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:30:54,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-06 02:30:54,653 INFO L495 AbstractCegarLoop]: Abstraction has has 874 places, 2202 transitions, 220252 flow [2022-12-06 02:30:54,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:54,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:30:54,653 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:30:54,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-06 02:30:54,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 02:30:54,857 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:30:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:30:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash 342853733, now seen corresponding path program 6 times [2022-12-06 02:30:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:30:54,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494226170] [2022-12-06 02:30:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:30:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:30:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:30:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:55,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:30:55,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494226170] [2022-12-06 02:30:55,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494226170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:30:55,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445254724] [2022-12-06 02:30:55,462 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:30:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:30:55,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:30:55,466 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:30:55,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-06 02:30:55,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:30:55,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:30:55,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-06 02:30:55,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:30:55,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:30:55,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:30:55,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:30:55,641 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 02:30:55,657 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 02:30:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:55,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:30:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:30:55,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445254724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:30:55,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:30:55,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 20 [2022-12-06 02:30:55,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425505418] [2022-12-06 02:30:55,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:30:55,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:30:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:30:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:30:55,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:30:55,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:30:55,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 2202 transitions, 220252 flow. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:30:55,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:30:55,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:30:55,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:04,132 INFO L130 PetriNetUnfolder]: 2482/5020 cut-off events. [2022-12-06 02:31:04,133 INFO L131 PetriNetUnfolder]: For 10798/10798 co-relation queries the response was YES. [2022-12-06 02:31:04,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255044 conditions, 5020 events. 2482/5020 cut-off events. For 10798/10798 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 38495 event pairs, 10 based on Foata normal form. 3/4424 useless extension candidates. Maximal degree in co-relation 96568. Up to 4812 conditions per place. [2022-12-06 02:31:04,199 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 1102 selfloop transitions, 112 changer transitions 1120/2334 dead transitions. [2022-12-06 02:31:04,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 2334 transitions, 238189 flow [2022-12-06 02:31:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:31:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:31:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 182 transitions. [2022-12-06 02:31:04,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-12-06 02:31:04,201 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 875 predicate places. [2022-12-06 02:31:04,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:04,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 896 places, 2334 transitions, 238189 flow [2022-12-06 02:31:04,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 896 places, 2334 transitions, 238189 flow [2022-12-06 02:31:04,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:04,471 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:31:04,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 02:31:04,471 INFO L495 AbstractCegarLoop]: Abstraction has has 896 places, 2334 transitions, 238189 flow [2022-12-06 02:31:04,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:04,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:04,471 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:04,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-06 02:31:04,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 02:31:04,676 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:31:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1952439699, now seen corresponding path program 7 times [2022-12-06 02:31:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:04,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226978913] [2022-12-06 02:31:04,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226978913] [2022-12-06 02:31:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226978913] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559964785] [2022-12-06 02:31:05,165 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:31:05,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:05,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:05,167 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:05,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-06 02:31:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:05,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:31:05,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:05,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:05,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:05,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 108 [2022-12-06 02:31:05,828 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:31:05,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:31:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:05,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559964785] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:05,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:05,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-12-06 02:31:05,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132858557] [2022-12-06 02:31:05,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:05,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:31:05,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:05,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:31:05,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:31:05,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:31:05,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 896 places, 2334 transitions, 238189 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:05,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:05,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:31:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:15,536 INFO L130 PetriNetUnfolder]: 2594/5220 cut-off events. [2022-12-06 02:31:15,537 INFO L131 PetriNetUnfolder]: For 10639/10639 co-relation queries the response was YES. [2022-12-06 02:31:15,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270482 conditions, 5220 events. 2594/5220 cut-off events. For 10639/10639 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 40107 event pairs, 12 based on Foata normal form. 2/4577 useless extension candidates. Maximal degree in co-relation 105024. Up to 5012 conditions per place. [2022-12-06 02:31:15,736 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 1205 selfloop transitions, 84 changer transitions 1122/2411 dead transitions. [2022-12-06 02:31:15,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 2411 transitions, 250907 flow [2022-12-06 02:31:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 02:31:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 02:31:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 149 transitions. [2022-12-06 02:31:15,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3547619047619048 [2022-12-06 02:31:15,761 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 894 predicate places. [2022-12-06 02:31:15,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:15,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 915 places, 2411 transitions, 250907 flow [2022-12-06 02:31:15,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 915 places, 2411 transitions, 250907 flow [2022-12-06 02:31:15,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:15,913 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:31:15,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 02:31:15,914 INFO L495 AbstractCegarLoop]: Abstraction has has 915 places, 2411 transitions, 250907 flow [2022-12-06 02:31:15,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:15,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:15,914 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:15,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-12-06 02:31:16,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:16,119 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:31:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash -856698477, now seen corresponding path program 8 times [2022-12-06 02:31:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:16,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79324907] [2022-12-06 02:31:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:16,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79324907] [2022-12-06 02:31:16,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79324907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:16,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579608833] [2022-12-06 02:31:16,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:31:16,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:16,573 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:16,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-06 02:31:16,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:31:16,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:31:16,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:31:16,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:16,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:17,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:17,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 108 [2022-12-06 02:31:17,110 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:31:17,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:31:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:17,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579608833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:17,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:17,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-06 02:31:17,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379388513] [2022-12-06 02:31:17,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:17,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:31:17,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:17,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:31:17,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:31:17,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:31:17,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 915 places, 2411 transitions, 250907 flow. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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 02:31:17,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:17,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:31:17,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:27,339 INFO L130 PetriNetUnfolder]: 2706/5421 cut-off events. [2022-12-06 02:31:27,339 INFO L131 PetriNetUnfolder]: For 10673/10673 co-relation queries the response was YES. [2022-12-06 02:31:27,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286374 conditions, 5421 events. 2706/5421 cut-off events. For 10673/10673 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 41737 event pairs, 10 based on Foata normal form. 3/4727 useless extension candidates. Maximal degree in co-relation 115005. Up to 5213 conditions per place. [2022-12-06 02:31:27,435 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 1254 selfloop transitions, 101 changer transitions 1125/2480 dead transitions. [2022-12-06 02:31:27,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 2480 transitions, 263085 flow [2022-12-06 02:31:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:31:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:31:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 179 transitions. [2022-12-06 02:31:27,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34095238095238095 [2022-12-06 02:31:27,437 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 918 predicate places. [2022-12-06 02:31:27,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:27,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 939 places, 2480 transitions, 263085 flow [2022-12-06 02:31:27,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 939 places, 2480 transitions, 263085 flow [2022-12-06 02:31:27,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:27,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:31:27,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 316 [2022-12-06 02:31:27,754 INFO L495 AbstractCegarLoop]: Abstraction has has 939 places, 2480 transitions, 263085 flow [2022-12-06 02:31:27,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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 02:31:27,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:27,754 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:27,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-06 02:31:27,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:27,957 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:31:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1738458571, now seen corresponding path program 9 times [2022-12-06 02:31:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:27,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478472096] [2022-12-06 02:31:27,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478472096] [2022-12-06 02:31:28,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478472096] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169184670] [2022-12-06 02:31:28,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:31:28,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:28,743 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:28,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-06 02:31:28,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:31:28,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:31:28,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-06 02:31:28,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:28,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:31:28,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:31:28,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:31:28,988 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 02:31:29,016 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 02:31:29,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:29,244 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 17 treesize of output 18 [2022-12-06 02:31:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:29,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:30,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169184670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:30,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:30,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 30 [2022-12-06 02:31:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816162072] [2022-12-06 02:31:30,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 02:31:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 02:31:30,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2022-12-06 02:31:30,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:31:30,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 2480 transitions, 263085 flow. Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 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 02:31:30,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:30,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:31:30,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:47,561 INFO L130 PetriNetUnfolder]: 2954/5915 cut-off events. [2022-12-06 02:31:47,561 INFO L131 PetriNetUnfolder]: For 10764/10764 co-relation queries the response was YES. [2022-12-06 02:31:47,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318512 conditions, 5915 events. 2954/5915 cut-off events. For 10764/10764 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 46239 event pairs, 14 based on Foata normal form. 4/5110 useless extension candidates. Maximal degree in co-relation 136318. Up to 5707 conditions per place. [2022-12-06 02:31:47,625 INFO L137 encePairwiseOnDemand]: 6/21 looper letters, 1360 selfloop transitions, 163 changer transitions 1160/2683 dead transitions. [2022-12-06 02:31:47,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 2683 transitions, 290087 flow [2022-12-06 02:31:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 02:31:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 02:31:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 300 transitions. [2022-12-06 02:31:47,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2801120448179272 [2022-12-06 02:31:47,626 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 968 predicate places. [2022-12-06 02:31:47,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:31:47,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 989 places, 2683 transitions, 290087 flow [2022-12-06 02:31:47,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 989 places, 2683 transitions, 290087 flow [2022-12-06 02:31:47,803 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:31:47,807 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:31:47,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 02:31:47,807 INFO L495 AbstractCegarLoop]: Abstraction has has 989 places, 2683 transitions, 290087 flow [2022-12-06 02:31:47,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 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 02:31:47,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:31:47,808 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:31:47,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-06 02:31:48,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:48,013 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:31:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:31:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 443670733, now seen corresponding path program 10 times [2022-12-06 02:31:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:31:48,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673888465] [2022-12-06 02:31:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:31:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:31:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:31:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:31:48,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673888465] [2022-12-06 02:31:48,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673888465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:31:48,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65158026] [2022-12-06 02:31:48,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:31:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:31:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:31:48,554 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:31:48,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-06 02:31:48,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:31:48,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:31:48,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:31:48,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:31:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:48,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:48,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:48,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 132 [2022-12-06 02:31:49,098 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-06 02:31:49,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 23 [2022-12-06 02:31:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:31:49,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65158026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:49,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:49,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-12-06 02:31:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109257122] [2022-12-06 02:31:49,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:49,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 02:31:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 02:31:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-12-06 02:31:49,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:31:49,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 2683 transitions, 290087 flow. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:49,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:49,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:31:49,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:02,458 INFO L130 PetriNetUnfolder]: 3068/6113 cut-off events. [2022-12-06 02:32:02,458 INFO L131 PetriNetUnfolder]: For 10969/10969 co-relation queries the response was YES. [2022-12-06 02:32:02,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335327 conditions, 6113 events. 3068/6113 cut-off events. For 10969/10969 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 47905 event pairs, 14 based on Foata normal form. 2/5256 useless extension candidates. Maximal degree in co-relation 144127. Up to 5905 conditions per place. [2022-12-06 02:32:02,528 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 1521 selfloop transitions, 71 changer transitions 1162/2754 dead transitions. [2022-12-06 02:32:02,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 2754 transitions, 303281 flow [2022-12-06 02:32:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 02:32:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 02:32:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 135 transitions. [2022-12-06 02:32:02,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30612244897959184 [2022-12-06 02:32:02,530 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 988 predicate places. [2022-12-06 02:32:02,530 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:02,530 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1009 places, 2754 transitions, 303281 flow [2022-12-06 02:32:02,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1009 places, 2754 transitions, 303281 flow [2022-12-06 02:32:02,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:32:02,715 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:02,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 02:32:02,716 INFO L495 AbstractCegarLoop]: Abstraction has has 1009 places, 2754 transitions, 303281 flow [2022-12-06 02:32:02,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:02,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:02,716 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:02,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-06 02:32:02,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-06 02:32:02,921 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:32:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1699874251, now seen corresponding path program 11 times [2022-12-06 02:32:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:02,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144975477] [2022-12-06 02:32:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144975477] [2022-12-06 02:32:03,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144975477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029828206] [2022-12-06 02:32:03,636 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:32:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:03,638 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:03,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-06 02:32:03,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:32:03,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:32:03,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 107 conjunts are in the unsatisfiable core [2022-12-06 02:32:03,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:03,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:32:03,820 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 02:32:03,841 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 02:32:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:04,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:04,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029828206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:04,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:04,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2022-12-06 02:32:04,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144161817] [2022-12-06 02:32:04,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:04,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 02:32:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:04,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 02:32:04,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-12-06 02:32:04,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:32:04,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 2754 transitions, 303281 flow. Second operand has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:04,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:04,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:32:04,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:20,452 INFO L130 PetriNetUnfolder]: 3253/6436 cut-off events. [2022-12-06 02:32:20,452 INFO L131 PetriNetUnfolder]: For 10784/10784 co-relation queries the response was YES. [2022-12-06 02:32:20,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359544 conditions, 6436 events. 3253/6436 cut-off events. For 10784/10784 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 50593 event pairs, 12 based on Foata normal form. 2/5501 useless extension candidates. Maximal degree in co-relation 158628. Up to 6228 conditions per place. [2022-12-06 02:32:20,530 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 1577 selfloop transitions, 133 changer transitions 1164/2874 dead transitions. [2022-12-06 02:32:20,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1040 places, 2874 transitions, 322259 flow [2022-12-06 02:32:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 02:32:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 02:32:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 193 transitions. [2022-12-06 02:32:20,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28720238095238093 [2022-12-06 02:32:20,538 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1019 predicate places. [2022-12-06 02:32:20,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:20,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1040 places, 2874 transitions, 322259 flow [2022-12-06 02:32:20,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1040 places, 2874 transitions, 322259 flow [2022-12-06 02:32:20,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:32:20,737 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:20,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 02:32:20,737 INFO L495 AbstractCegarLoop]: Abstraction has has 1040 places, 2874 transitions, 322259 flow [2022-12-06 02:32:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:20,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:20,737 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:20,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-06 02:32:20,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-06 02:32:20,947 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:32:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1353378867, now seen corresponding path program 12 times [2022-12-06 02:32:20,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:20,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571677728] [2022-12-06 02:32:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:21,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571677728] [2022-12-06 02:32:21,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571677728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:21,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752877579] [2022-12-06 02:32:21,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:32:21,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:21,724 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:21,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-06 02:32:21,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-06 02:32:21,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:32:21,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 128 conjunts are in the unsatisfiable core [2022-12-06 02:32:21,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:21,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:21,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:32:21,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:32:21,952 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 02:32:21,968 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 02:32:22,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:32:22,201 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 15 treesize of output 16 [2022-12-06 02:32:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:22,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:23,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 8))) (and (forall ((v_subst_13 Int) (v_ArrVal_2018 (Array Int Int))) (or (not (< v_subst_13 c_~N~0)) (< (+ v_subst_13 1) c_~N~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2018) c_~A~0.base))) (< (select .cse0 (+ (* v_subst_13 4) c_~A~0.offset)) (+ c_~counter~0 (select .cse0 .cse1) 1))))) (forall ((v_subst_14 Int) (v_ArrVal_2018 (Array Int Int))) (or (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2018) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse2 .cse1)) (select .cse2 (+ c_~A~0.offset (* v_subst_14 4))))) (not (< v_subst_14 c_~N~0)) (< (+ v_subst_14 1) c_~N~0))))) is different from false [2022-12-06 02:32:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:23,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752877579] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:23,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:23,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-12-06 02:32:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896783470] [2022-12-06 02:32:23,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:23,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 02:32:23,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 02:32:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=746, Unknown=1, NotChecked=56, Total=930 [2022-12-06 02:32:23,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:32:23,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1040 places, 2874 transitions, 322259 flow. Second operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:23,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:23,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:32:23,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:32:42,450 INFO L130 PetriNetUnfolder]: 3423/6772 cut-off events. [2022-12-06 02:32:42,451 INFO L131 PetriNetUnfolder]: For 10598/10598 co-relation queries the response was YES. [2022-12-06 02:32:42,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385171 conditions, 6772 events. 3423/6772 cut-off events. For 10598/10598 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 53625 event pairs, 6 based on Foata normal form. 7/5746 useless extension candidates. Maximal degree in co-relation 181322. Up to 6564 conditions per place. [2022-12-06 02:32:42,588 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 1722 selfloop transitions, 87 changer transitions 1187/2996 dead transitions. [2022-12-06 02:32:42,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1068 places, 2996 transitions, 342005 flow [2022-12-06 02:32:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 02:32:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 02:32:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 190 transitions. [2022-12-06 02:32:42,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31198686371100165 [2022-12-06 02:32:42,590 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1047 predicate places. [2022-12-06 02:32:42,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:32:42,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1068 places, 2996 transitions, 342005 flow [2022-12-06 02:32:43,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1068 places, 2996 transitions, 342005 flow [2022-12-06 02:32:43,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:32:43,027 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:32:43,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 437 [2022-12-06 02:32:43,027 INFO L495 AbstractCegarLoop]: Abstraction has has 1068 places, 2996 transitions, 342005 flow [2022-12-06 02:32:43,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:43,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:32:43,028 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:32:43,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-06 02:32:43,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-06 02:32:43,234 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:32:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:32:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 320366389, now seen corresponding path program 13 times [2022-12-06 02:32:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:32:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135505614] [2022-12-06 02:32:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:32:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:32:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:32:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135505614] [2022-12-06 02:32:43,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135505614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:32:43,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991578070] [2022-12-06 02:32:43,915 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:32:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:32:43,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:32:43,916 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:32:43,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-06 02:32:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:32:44,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:32:44,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:32:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:44,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:32:44,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:32:44,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 132 [2022-12-06 02:32:44,515 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-06 02:32:44,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 23 [2022-12-06 02:32:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:32:44,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991578070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:32:44,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:32:44,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-12-06 02:32:44,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734647903] [2022-12-06 02:32:44,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:32:44,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:32:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:32:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:32:44,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:32:44,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:32:44,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1068 places, 2996 transitions, 342005 flow. Second operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:32:44,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:32:44,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:32:44,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:05,831 INFO L130 PetriNetUnfolder]: 3569/7036 cut-off events. [2022-12-06 02:33:05,832 INFO L131 PetriNetUnfolder]: For 10869/10869 co-relation queries the response was YES. [2022-12-06 02:33:05,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407264 conditions, 7036 events. 3569/7036 cut-off events. For 10869/10869 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 55906 event pairs, 14 based on Foata normal form. 3/5928 useless extension candidates. Maximal degree in co-relation 195999. Up to 6828 conditions per place. [2022-12-06 02:33:05,924 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 1725 selfloop transitions, 164 changer transitions 1192/3081 dead transitions. [2022-12-06 02:33:05,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1107 places, 3081 transitions, 357888 flow [2022-12-06 02:33:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 02:33:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 02:33:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 236 transitions. [2022-12-06 02:33:05,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28095238095238095 [2022-12-06 02:33:05,926 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1086 predicate places. [2022-12-06 02:33:05,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:05,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1107 places, 3081 transitions, 357888 flow [2022-12-06 02:33:06,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1107 places, 3081 transitions, 357888 flow [2022-12-06 02:33:06,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:06,170 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:06,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 02:33:06,171 INFO L495 AbstractCegarLoop]: Abstraction has has 1107 places, 3081 transitions, 357888 flow [2022-12-06 02:33:06,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:06,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:06,171 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:06,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-06 02:33:06,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-06 02:33:06,377 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:33:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 792899021, now seen corresponding path program 14 times [2022-12-06 02:33:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:06,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996838365] [2022-12-06 02:33:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996838365] [2022-12-06 02:33:07,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996838365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:33:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631799173] [2022-12-06 02:33:07,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:33:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:33:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:07,559 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:33:07,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-06 02:33:07,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:33:07,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:33:07,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:33:07,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:33:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:07,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:33:08,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:33:08,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 132 [2022-12-06 02:33:08,280 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-06 02:33:08,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 23 [2022-12-06 02:33:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:08,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631799173] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:33:08,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:33:08,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-12-06 02:33:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190754026] [2022-12-06 02:33:08,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:33:08,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:33:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:08,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:33:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:33:08,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:33:08,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1107 places, 3081 transitions, 357888 flow. Second operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:08,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:08,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:33:08,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:33:29,434 INFO L130 PetriNetUnfolder]: 3735/7334 cut-off events. [2022-12-06 02:33:29,435 INFO L131 PetriNetUnfolder]: For 10930/10930 co-relation queries the response was YES. [2022-12-06 02:33:29,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431906 conditions, 7334 events. 3735/7334 cut-off events. For 10930/10930 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 58527 event pairs, 8 based on Foata normal form. 2/6145 useless extension candidates. Maximal degree in co-relation 209950. Up to 7126 conditions per place. [2022-12-06 02:33:29,526 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 1796 selfloop transitions, 193 changer transitions 1194/3183 dead transitions. [2022-12-06 02:33:29,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1144 places, 3183 transitions, 376137 flow [2022-12-06 02:33:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-06 02:33:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-06 02:33:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 231 transitions. [2022-12-06 02:33:29,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2894736842105263 [2022-12-06 02:33:29,528 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1123 predicate places. [2022-12-06 02:33:29,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:33:29,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1144 places, 3183 transitions, 376137 flow [2022-12-06 02:33:29,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1144 places, 3183 transitions, 376137 flow [2022-12-06 02:33:29,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:33:29,741 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:33:29,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 02:33:29,741 INFO L495 AbstractCegarLoop]: Abstraction has has 1144 places, 3183 transitions, 376137 flow [2022-12-06 02:33:29,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:33:29,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:33:29,742 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:33:29,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-06 02:33:29,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-06 02:33:29,945 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:33:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:33:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1402909293, now seen corresponding path program 15 times [2022-12-06 02:33:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:33:29,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307837974] [2022-12-06 02:33:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:33:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:33:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:33:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:33:30,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307837974] [2022-12-06 02:33:30,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307837974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:33:30,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739179596] [2022-12-06 02:33:30,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:33:30,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:33:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:33:30,419 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:33:30,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-06 02:33:30,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:33:30,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:33:30,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-06 02:33:30,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:33:30,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:30,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:30,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:33:30,598 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 02:33:30,625 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 02:33:30,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:30,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:33:30,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:33:30,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 41 [2022-12-06 02:33:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:30,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:33:33,848 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4))) (and (forall ((v_subst_17 Int) (v_ArrVal_2150 (Array Int Int))) (or (not (< (+ v_subst_17 1) c_~N~0)) (< (+ 2 v_subst_17) c_~N~0) (forall ((v_subst_15 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2150) c_~A~0.base))) (< (+ (select .cse0 .cse1) (select .cse0 (+ c_~A~0.offset (* v_subst_15 4)))) (let ((.cse2 (* v_subst_17 4))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset .cse2 4)) (select .cse0 (+ c_~A~0.offset .cse2)) 1)))) (not (< v_subst_15 c_~N~0)) (< (+ v_subst_15 1) c_~N~0))))) (forall ((v_subst_18 Int) (v_ArrVal_2150 (Array Int Int))) (or (< (+ 2 v_subst_18) c_~N~0) (forall ((v_subst_16 Int)) (or (< (+ v_subst_16 1) c_~N~0) (not (< v_subst_16 c_~N~0)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2150) c_~A~0.base))) (<= (let ((.cse4 (* v_subst_18 4))) (+ (select .cse3 (+ c_~A~0.offset .cse4 4)) c_~counter~0 (select .cse3 (+ c_~A~0.offset .cse4)))) (+ (select .cse3 .cse1) (select .cse3 (+ c_~A~0.offset (* v_subst_16 4)))))))) (not (< (+ v_subst_18 1) c_~N~0)))))) is different from false [2022-12-06 02:33:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:33:33,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739179596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:33:33,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:33:33,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2022-12-06 02:33:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472601780] [2022-12-06 02:33:33,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:33:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 02:33:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:33:33,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 02:33:33,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=780, Unknown=1, NotChecked=58, Total=992 [2022-12-06 02:33:33,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:33:33,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1144 places, 3183 transitions, 376137 flow. Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 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 02:33:33,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:33:33,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:33:33,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:34:07,475 INFO L130 PetriNetUnfolder]: 4721/9735 cut-off events. [2022-12-06 02:34:07,475 INFO L131 PetriNetUnfolder]: For 11960/11960 co-relation queries the response was YES. [2022-12-06 02:34:07,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583441 conditions, 9735 events. 4721/9735 cut-off events. For 11960/11960 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 85872 event pairs, 12 based on Foata normal form. 9/8071 useless extension candidates. Maximal degree in co-relation 296652. Up to 9527 conditions per place. [2022-12-06 02:34:07,598 INFO L137 encePairwiseOnDemand]: 6/21 looper letters, 2426 selfloop transitions, 741 changer transitions 1686/4853 dead transitions. [2022-12-06 02:34:07,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1198 places, 4853 transitions, 583751 flow [2022-12-06 02:34:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-06 02:34:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-06 02:34:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 296 transitions. [2022-12-06 02:34:07,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25627705627705627 [2022-12-06 02:34:07,600 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1177 predicate places. [2022-12-06 02:34:07,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:34:07,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1198 places, 4853 transitions, 583751 flow [2022-12-06 02:34:07,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1198 places, 4853 transitions, 583751 flow [2022-12-06 02:34:07,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:34:07,957 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:34:07,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-06 02:34:07,958 INFO L495 AbstractCegarLoop]: Abstraction has has 1198 places, 4853 transitions, 583751 flow [2022-12-06 02:34:07,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 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 02:34:07,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:34:07,958 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:34:07,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-12-06 02:34:08,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-06 02:34:08,164 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:34:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:34:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash 570827897, now seen corresponding path program 16 times [2022-12-06 02:34:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:34:08,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649501344] [2022-12-06 02:34:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:34:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:34:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:34:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:34:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:34:08,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649501344] [2022-12-06 02:34:08,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649501344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:34:08,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514176390] [2022-12-06 02:34:08,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:34:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:34:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:34:08,711 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:34:08,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-06 02:34:08,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:34:08,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:34:08,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-06 02:34:08,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:34:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:34:09,017 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 25 treesize of output 25 [2022-12-06 02:34:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:34:09,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:34:09,263 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ c_~A~0.offset 8))) (and (forall ((v_ArrVal_2193 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2193) c_~A~0.base))) (<= (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset) (select .cse0 .cse2)) (+ c_~counter~0 (select .cse0 .cse3))))) (forall ((v_ArrVal_2193 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2193) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse4 .cse3)) (+ (select .cse4 .cse1) (select .cse4 c_~A~0.offset) (select .cse4 .cse2))))))) is different from false [2022-12-06 02:34:09,271 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ .cse6 c_~A~0.offset))) (.cse4 (+ .cse6 c_~A~0.offset 4)) (.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ c_~A~0.offset 8))) (and (forall ((v_ArrVal_2193 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2193) c_~A~0.base))) (<= (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset) (select .cse0 .cse2)) (+ .cse3 c_~counter~0 (select .cse0 .cse4))))) (forall ((v_ArrVal_2193 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2193) c_~A~0.base))) (<= (+ .cse3 c_~counter~0 (select .cse5 .cse4)) (+ (select .cse5 .cse1) (select .cse5 c_~A~0.offset) (select .cse5 .cse2)))))))) is different from false [2022-12-06 02:34:09,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:34:09,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2022-12-06 02:34:09,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:34:09,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 49 [2022-12-06 02:34:09,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:34:09,429 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:34:09,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:34:09,463 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 02:34:09,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514176390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:34:09,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:34:09,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-12-06 02:34:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781682809] [2022-12-06 02:34:09,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:34:09,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:34:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:34:09,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:34:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=437, Unknown=2, NotChecked=86, Total=600 [2022-12-06 02:34:09,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:34:09,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1198 places, 4853 transitions, 583751 flow. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:34:09,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:34:09,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:34:09,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:35:03,024 INFO L130 PetriNetUnfolder]: 4834/9959 cut-off events. [2022-12-06 02:35:03,025 INFO L131 PetriNetUnfolder]: For 12436/12436 co-relation queries the response was YES. [2022-12-06 02:35:03,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606787 conditions, 9959 events. 4834/9959 cut-off events. For 12436/12436 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 88117 event pairs, 6 based on Foata normal form. 4/8257 useless extension candidates. Maximal degree in co-relation 310390. Up to 9751 conditions per place. [2022-12-06 02:35:03,150 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 3133 selfloop transitions, 137 changer transitions 1696/4966 dead transitions. [2022-12-06 02:35:03,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 4966 transitions, 607259 flow [2022-12-06 02:35:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:35:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:35:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2022-12-06 02:35:03,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41156462585034015 [2022-12-06 02:35:03,151 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1190 predicate places. [2022-12-06 02:35:03,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:35:03,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1211 places, 4966 transitions, 607259 flow [2022-12-06 02:35:03,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1211 places, 4966 transitions, 607259 flow [2022-12-06 02:35:03,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:35:03,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:35:03,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 490 [2022-12-06 02:35:03,641 INFO L495 AbstractCegarLoop]: Abstraction has has 1211 places, 4966 transitions, 607259 flow [2022-12-06 02:35:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:35:03,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:35:03,641 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:35:03,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-12-06 02:35:03,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:35:03,846 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:35:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:35:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1315721203, now seen corresponding path program 17 times [2022-12-06 02:35:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:35:03,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480716104] [2022-12-06 02:35:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:35:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:35:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:35:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:35:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:35:04,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480716104] [2022-12-06 02:35:04,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480716104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:35:04,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403860986] [2022-12-06 02:35:04,496 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:35:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:35:04,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:35:04,497 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:35:04,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-06 02:35:04,712 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-06 02:35:04,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:35:04,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:35:04,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:35:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:35:04,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:35:05,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:35:05,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2022-12-06 02:35:05,253 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:35:05,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2022-12-06 02:35:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:35:05,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403860986] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:35:05,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:35:05,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-12-06 02:35:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797846027] [2022-12-06 02:35:05,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:35:05,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:35:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:35:05,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:35:05,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:35:05,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 02:35:05,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1211 places, 4966 transitions, 607259 flow. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:35:05,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:35:05,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 02:35:05,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:36:07,354 INFO L130 PetriNetUnfolder]: 5090/10426 cut-off events. [2022-12-06 02:36:07,354 INFO L131 PetriNetUnfolder]: For 12935/12935 co-relation queries the response was YES. [2022-12-06 02:36:07,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645680 conditions, 10426 events. 5090/10426 cut-off events. For 12935/12935 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 92509 event pairs, 15 based on Foata normal form. 6/8611 useless extension candidates. Maximal degree in co-relation 326889. Up to 10216 conditions per place. [2022-12-06 02:36:07,590 INFO L137 encePairwiseOnDemand]: 7/21 looper letters, 3318 selfloop transitions, 144 changer transitions 1708/5170 dead transitions. [2022-12-06 02:36:07,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1255 places, 5170 transitions, 642503 flow [2022-12-06 02:36:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-06 02:36:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-06 02:36:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 253 transitions. [2022-12-06 02:36:07,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2677248677248677 [2022-12-06 02:36:07,592 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1234 predicate places. [2022-12-06 02:36:07,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:36:07,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1255 places, 5170 transitions, 642503 flow [2022-12-06 02:36:08,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1255 places, 5170 transitions, 642503 flow [2022-12-06 02:36:08,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:36:10,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:36:10,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2928 [2022-12-06 02:36:10,520 INFO L495 AbstractCegarLoop]: Abstraction has has 1254 places, 5169 transitions, 642379 flow [2022-12-06 02:36:10,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:36:10,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:36:10,520 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:36:10,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-06 02:36:10,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:36:10,725 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:36:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:36:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2107772159, now seen corresponding path program 18 times [2022-12-06 02:36:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:36:10,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203441208] [2022-12-06 02:36:10,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:36:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:36:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:36:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:36:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:36:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203441208] [2022-12-06 02:36:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203441208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:36:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549764613] [2022-12-06 02:36:11,143 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:36:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:36:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:36:11,144 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:36:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-06 02:36:11,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:36:11,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:36:11,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-06 02:36:11,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:36:11,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:36:11,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:36:11,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:36:11,325 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 02:36:11,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:36:11,429 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 29 treesize of output 27 [2022-12-06 02:36:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:36:11,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:36:11,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ c_~A~0.offset 8))) (and (forall ((v_ArrVal_2286 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2286) c_~A~0.base))) (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset) (select .cse0 .cse2))) (+ c_~counter~0 1))) (forall ((v_ArrVal_2286 (Array Int Int))) (<= c_~counter~0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2286) c_~A~0.base))) (+ (select .cse3 .cse1) (select .cse3 c_~A~0.offset) (select .cse3 .cse2))))))) is different from false [2022-12-06 02:36:11,694 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~A~0.base)) (.cse7 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse4 (+ c_~A~0.offset 8)) (.cse0 (select .cse6 (+ .cse7 c_~A~0.offset))) (.cse1 (select .cse6 (+ .cse7 c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2286 (Array Int Int))) (<= (+ .cse0 c_~counter~0 .cse1) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2286) c_~A~0.base))) (+ (select .cse2 .cse3) (select .cse2 c_~A~0.offset) (select .cse2 .cse4))))) (forall ((v_ArrVal_2286 (Array Int Int))) (< (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2286) c_~A~0.base))) (+ (select .cse5 .cse3) (select .cse5 c_~A~0.offset) (select .cse5 .cse4))) (+ .cse0 c_~counter~0 .cse1 1)))))) is different from false [2022-12-06 02:36:11,757 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 8)) (.cse1 (+ c_~A~0.offset 4)) (.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse7 .cse1)) (.cse5 (select .cse7 .cse2))) (and (forall ((v_ArrVal_2286 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2286) c_~A~0.base))) (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset) (select .cse0 .cse2))) (+ .cse3 c_~counter~0 .cse4 .cse5 1))) (forall ((v_ArrVal_2286 (Array Int Int))) (<= (+ .cse3 c_~counter~0 .cse4 .cse5) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2286) c_~A~0.base))) (+ (select .cse6 .cse1) (select .cse6 c_~A~0.offset) (select .cse6 .cse2)))))))) is different from false [2022-12-06 02:36:11,762 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 02:36:11,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549764613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:36:11,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:36:11,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-12-06 02:36:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127386604] [2022-12-06 02:36:11,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:36:11,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:36:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:36:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:36:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=522, Unknown=7, NotChecked=144, Total=756 [2022-12-06 02:36:11,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 02:36:11,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1254 places, 5169 transitions, 642379 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:36:11,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:36:11,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 02:36:11,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:37:16,467 INFO L130 PetriNetUnfolder]: 5447/11109 cut-off events. [2022-12-06 02:37:16,468 INFO L131 PetriNetUnfolder]: For 15241/15241 co-relation queries the response was YES. [2022-12-06 02:37:16,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698874 conditions, 11109 events. 5447/11109 cut-off events. For 15241/15241 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 98933 event pairs, 6 based on Foata normal form. 4/9215 useless extension candidates. Maximal degree in co-relation 313281. Up to 10893 conditions per place. [2022-12-06 02:37:16,624 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 3521 selfloop transitions, 281 changer transitions 1730/5532 dead transitions. [2022-12-06 02:37:16,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1267 places, 5532 transitions, 698384 flow [2022-12-06 02:37:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:37:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:37:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-12-06 02:37:16,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2022-12-06 02:37:16,625 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1246 predicate places. [2022-12-06 02:37:16,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:37:16,626 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1267 places, 5532 transitions, 698384 flow [2022-12-06 02:37:17,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1267 places, 5532 transitions, 698384 flow [2022-12-06 02:37:17,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:37:17,224 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:37:17,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 599 [2022-12-06 02:37:17,225 INFO L495 AbstractCegarLoop]: Abstraction has has 1267 places, 5532 transitions, 698384 flow [2022-12-06 02:37:17,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:37:17,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:37:17,225 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:37:17,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-06 02:37:17,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:37:17,431 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:37:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:37:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1743062869, now seen corresponding path program 1 times [2022-12-06 02:37:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:37:17,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350114275] [2022-12-06 02:37:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:37:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:37:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:37:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:37:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:37:17,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350114275] [2022-12-06 02:37:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350114275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:37:17,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619393390] [2022-12-06 02:37:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:37:17,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:37:17,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:37:17,491 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:37:17,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-06 02:37:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:37:17,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 02:37:17,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:37:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:37:17,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:37:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:37:17,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619393390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:37:17,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:37:17,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 02:37:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432377729] [2022-12-06 02:37:17,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:37:17,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:37:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:37:17,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:37:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:37:17,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 02:37:17,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1267 places, 5532 transitions, 698384 flow. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:37:17,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:37:17,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 02:37:17,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:31,018 INFO L130 PetriNetUnfolder]: 5504/11138 cut-off events. [2022-12-06 02:38:31,018 INFO L131 PetriNetUnfolder]: For 18842/18842 co-relation queries the response was YES. [2022-12-06 02:38:31,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711451 conditions, 11138 events. 5504/11138 cut-off events. For 18842/18842 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 97409 event pairs, 12 based on Foata normal form. 0/9244 useless extension candidates. Maximal degree in co-relation 372302. Up to 10916 conditions per place. [2022-12-06 02:38:31,213 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 3527 selfloop transitions, 217 changer transitions 1695/5486 dead transitions. [2022-12-06 02:38:31,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1269 places, 5486 transitions, 703232 flow [2022-12-06 02:38:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:38:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:38:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 02:38:31,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 02:38:31,214 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1248 predicate places. [2022-12-06 02:38:31,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:31,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1269 places, 5486 transitions, 703232 flow [2022-12-06 02:38:31,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1269 places, 5486 transitions, 703232 flow [2022-12-06 02:38:31,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:31,789 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:31,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-06 02:38:31,790 INFO L495 AbstractCegarLoop]: Abstraction has has 1269 places, 5486 transitions, 703232 flow [2022-12-06 02:38:31,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:38:31,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:31,790 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:31,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:31,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-06 02:38:31,995 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1322442037, now seen corresponding path program 19 times [2022-12-06 02:38:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:31,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236182782] [2022-12-06 02:38:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:32,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:32,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236182782] [2022-12-06 02:38:32,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236182782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:32,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887558943] [2022-12-06 02:38:32,489 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:38:32,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:32,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:32,490 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:32,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-06 02:38:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:32,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-06 02:38:32,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:32,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:32,737 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 30 treesize of output 30 [2022-12-06 02:38:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:32,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:33,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:33,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2022-12-06 02:38:33,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:33,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 49 [2022-12-06 02:38:33,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:38:33,323 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:38:33,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 23 [2022-12-06 02:38:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:33,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887558943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:33,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:33,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-12-06 02:38:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652705963] [2022-12-06 02:38:33,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:33,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:38:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:38:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=556, Unknown=7, NotChecked=0, Total=650 [2022-12-06 02:38:33,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 02:38:33,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1269 places, 5486 transitions, 703232 flow. Second operand has 26 states, 25 states have (on average 1.64) internal successors, (41), 25 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 02:38:33,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:33,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 02:38:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:46,308 INFO L130 PetriNetUnfolder]: 5601/11325 cut-off events. [2022-12-06 02:39:46,308 INFO L131 PetriNetUnfolder]: For 18881/18881 co-relation queries the response was YES. [2022-12-06 02:39:46,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734763 conditions, 11325 events. 5601/11325 cut-off events. For 18881/18881 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 99467 event pairs, 10 based on Foata normal form. 4/9403 useless extension candidates. Maximal degree in co-relation 387489. Up to 11103 conditions per place. [2022-12-06 02:39:46,475 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 3667 selfloop transitions, 205 changer transitions 1705/5577 dead transitions. [2022-12-06 02:39:46,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1281 places, 5577 transitions, 726079 flow [2022-12-06 02:39:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:39:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:39:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-12-06 02:39:46,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3951048951048951 [2022-12-06 02:39:46,477 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1260 predicate places. [2022-12-06 02:39:46,477 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:46,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1281 places, 5577 transitions, 726079 flow [2022-12-06 02:39:47,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1281 places, 5577 transitions, 726079 flow [2022-12-06 02:39:47,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:47,045 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:47,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 569 [2022-12-06 02:39:47,046 INFO L495 AbstractCegarLoop]: Abstraction has has 1281 places, 5577 transitions, 726079 flow [2022-12-06 02:39:47,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.64) internal successors, (41), 25 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 02:39:47,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:47,046 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:47,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:47,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-06 02:39:47,252 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1434870913, now seen corresponding path program 20 times [2022-12-06 02:39:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130633684] [2022-12-06 02:39:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:47,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130633684] [2022-12-06 02:39:47,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130633684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:47,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55084692] [2022-12-06 02:39:47,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:39:47,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:47,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:47,808 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:47,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-06 02:39:47,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:39:47,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:47,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-06 02:39:47,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:48,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:48,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:39:48,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 107 [2022-12-06 02:39:48,510 INFO L321 Elim1Store]: treesize reduction 84, result has 13.4 percent of original size [2022-12-06 02:39:48,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2022-12-06 02:39:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:48,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55084692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:48,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:48,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-12-06 02:39:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533757069] [2022-12-06 02:39:48,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:48,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:39:48,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:48,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:39:48,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:39:48,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 02:39:48,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1281 places, 5577 transitions, 726079 flow. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:39:48,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:48,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 02:39:48,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:18,295 INFO L130 PetriNetUnfolder]: 6747/13391 cut-off events. [2022-12-06 02:41:18,296 INFO L131 PetriNetUnfolder]: For 20493/20493 co-relation queries the response was YES. [2022-12-06 02:41:18,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882269 conditions, 13391 events. 6747/13391 cut-off events. For 20493/20493 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 118329 event pairs, 14 based on Foata normal form. 6/11097 useless extension candidates. Maximal degree in co-relation 400047. Up to 13161 conditions per place. [2022-12-06 02:41:18,581 INFO L137 encePairwiseOnDemand]: 8/22 looper letters, 4330 selfloop transitions, 476 changer transitions 1730/6536 dead transitions. [2022-12-06 02:41:18,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1359 places, 6536 transitions, 863829 flow [2022-12-06 02:41:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-12-06 02:41:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-12-06 02:41:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 387 transitions. [2022-12-06 02:41:18,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22266973532796316 [2022-12-06 02:41:18,583 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 1338 predicate places. [2022-12-06 02:41:18,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:18,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1359 places, 6536 transitions, 863829 flow [2022-12-06 02:41:19,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 1359 places, 6536 transitions, 863829 flow [2022-12-06 02:41:19,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:19,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] L75-4-->L76-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_23| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_int_73| (store |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_74| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_25| |v_ULTIMATE.start_main_#t~pre11#1_23|)))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_15|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_25|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, #memory_int=|v_#memory_int_73|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre9#1, #memory_int] and [464] L49-4-->L49-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_13| |v_thread1Thread1of1ForFork1_plus_~b#1_13|))) (and (= |v_thread1Thread1of1ForFork1_plus_#res#1_13| .cse0) (< |v_thread1Thread1of1ForFork1_~i~0#1_36| v_~N~0_50) (= v_~counter~0_104 |v_thread1Thread1of1ForFork1_plus_#in~a#1_13|) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_36| 1) |v_thread1Thread1of1ForFork1_~i~0#1_35|) (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_13| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (select (select |v_#memory_int_97| v_~A~0.base_51) (+ (* |v_thread1Thread1of1ForFork1_~i~0#1_36| 4) v_~A~0.offset_51)) |v_thread1Thread1of1ForFork1_plus_#in~b#1_13|) (= |v_thread1Thread1of1ForFork1_plus_~b#1_13| |v_thread1Thread1of1ForFork1_plus_#in~b#1_13|) (<= 0 (+ v_~counter~0_103 2147483648)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_13| v_~counter~0_103) (<= v_~counter~0_103 2147483647) (= |v_thread1Thread1of1ForFork1_plus_~a#1_13| |v_thread1Thread1of1ForFork1_plus_#in~a#1_13|))) InVars {~counter~0=v_~counter~0_104, ~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_36|, #memory_int=|v_#memory_int_97|, ~N~0=v_~N~0_50} OutVars{~counter~0=v_~counter~0_103, ~A~0.base=v_~A~0.base_51, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_13|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_13|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_13|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_13|, ~N~0=v_~N~0_50, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_19|, ~A~0.offset=v_~A~0.offset_51, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_35|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, #memory_int=|v_#memory_int_97|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_13|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_13|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] [2022-12-06 02:41:19,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:41:19,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-06 02:41:19,316 INFO L495 AbstractCegarLoop]: Abstraction has has 1359 places, 6536 transitions, 863831 flow [2022-12-06 02:41:19,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:19,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:19,316 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:19,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-12-06 02:41:19,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:19,521 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:19,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1681341369, now seen corresponding path program 21 times [2022-12-06 02:41:19,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:19,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158544098] [2022-12-06 02:41:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:19,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158544098] [2022-12-06 02:41:19,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158544098] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:19,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612252807] [2022-12-06 02:41:19,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:41:19,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:19,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:19,976 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:19,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-06 02:41:20,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 02:41:20,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:20,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-06 02:41:20,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:20,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:20,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:20,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 02:41:20,248 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 02:41:20,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:20,322 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 14 treesize of output 16 [2022-12-06 02:41:20,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:20,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:41:20,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:41:20,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 41 [2022-12-06 02:41:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:20,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:23,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (forall ((v_subst_19 Int) (v_ArrVal_2465 (Array Int Int))) (or (< (+ 2 v_subst_19) c_~N~0) (not (< (+ v_subst_19 1) c_~N~0)) (forall ((v_subst_22 Int)) (or (< (+ v_subst_22 1) c_~N~0) (not (< v_subst_22 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2465) c_~A~0.base))) (< (let ((.cse1 (* v_subst_19 4))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset 4 .cse1)))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* v_subst_22 4))) (select .cse0 .cse2) 1))))))) (forall ((v_ArrVal_2465 (Array Int Int)) (v_subst_20 Int)) (or (not (< (+ v_subst_20 1) c_~N~0)) (< (+ 2 v_subst_20) c_~N~0) (forall ((v_subst_21 Int)) (or (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2465) c_~A~0.base))) (<= (+ (select .cse3 (+ (* v_subst_21 4) c_~A~0.offset)) c_~counter~0 (select .cse3 .cse2)) (let ((.cse4 (* v_subst_20 4))) (+ (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset .cse4 4)) (select .cse3 (+ c_~A~0.offset .cse4)))))) (< (+ v_subst_21 1) c_~N~0) (not (< v_subst_21 c_~N~0)))))))) is different from false [2022-12-06 02:41:25,472 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ .cse6 c_~A~0.offset))) (.cse2 (+ .cse6 c_~A~0.offset 4))) (and (forall ((v_ArrVal_2465 (Array Int Int)) (v_subst_20 Int)) (or (not (< (+ v_subst_20 1) c_~N~0)) (< (+ 2 v_subst_20) c_~N~0) (forall ((v_subst_21 Int)) (or (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2465) c_~A~0.base))) (<= (+ .cse0 (select .cse1 (+ (* v_subst_21 4) c_~A~0.offset)) (select .cse1 .cse2) c_~counter~0) (let ((.cse3 (* v_subst_20 4))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset .cse3 4)) (select .cse1 (+ c_~A~0.offset .cse3)))))) (< (+ v_subst_21 1) c_~N~0) (not (< v_subst_21 c_~N~0)))))) (forall ((v_subst_19 Int) (v_ArrVal_2465 (Array Int Int))) (or (< (+ 2 v_subst_19) c_~N~0) (forall ((v_subst_22 Int)) (or (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2465) c_~A~0.base))) (< (let ((.cse5 (* v_subst_19 4))) (+ (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse4 (+ c_~A~0.offset 4 .cse5)))) (+ .cse0 (select .cse4 .cse2) c_~counter~0 (select .cse4 (+ c_~A~0.offset (* v_subst_22 4))) 1))) (< (+ v_subst_22 1) c_~N~0) (not (< v_subst_22 c_~N~0)))) (not (< (+ v_subst_19 1) c_~N~0))))))) is different from false [2022-12-06 02:41:27,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse3 (+ c_~A~0.offset 4))) (and (forall ((v_subst_19 Int) (v_ArrVal_2465 (Array Int Int))) (or (< (+ 2 v_subst_19) c_~N~0) (forall ((v_subst_22 Int)) (or (< (+ v_subst_22 1) c_~N~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2465) c_~A~0.base))) (< (let ((.cse1 (* v_subst_19 4))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 (+ c_~A~0.offset 4 .cse1)))) (+ .cse2 c_~counter~0 (select .cse0 (+ c_~A~0.offset (* v_subst_22 4))) (select .cse0 .cse3) 1))) (not (< v_subst_22 c_~N~0)))) (not (< (+ v_subst_19 1) c_~N~0)))) (forall ((v_ArrVal_2465 (Array Int Int)) (v_subst_20 Int)) (or (not (< (+ v_subst_20 1) c_~N~0)) (forall ((v_subst_21 Int)) (or (< (+ v_subst_21 1) c_~N~0) (not (< v_subst_21 c_~N~0)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2465) c_~A~0.base))) (<= (+ (select .cse4 (+ (* v_subst_21 4) c_~A~0.offset)) .cse2 c_~counter~0 (select .cse4 .cse3)) (let ((.cse5 (* v_subst_20 4))) (+ (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset .cse5 4)) (select .cse4 (+ c_~A~0.offset .cse5)))))))) (< (+ 2 v_subst_20) c_~N~0))))) is different from false [2022-12-06 02:41:27,559 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 02:41:27,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612252807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:27,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:27,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2022-12-06 02:41:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967341150] [2022-12-06 02:41:27,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:27,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-06 02:41:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-06 02:41:27,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=819, Unknown=3, NotChecked=180, Total=1122 [2022-12-06 02:41:27,568 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:41:27,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1359 places, 6536 transitions, 863831 flow. Second operand has 34 states, 33 states have (on average 1.606060606060606) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:41:27,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:27,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:41:27,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:41:37,131 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:41:37,132 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:41:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 02:41:37,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:41:37,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-06 02:41:37,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:37,365 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (34states, 0/23 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 76399 conditions, 1163 events (503/1162 cut-off events. For 10865/10865 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 10123 event pairs, 0 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 16747. Up to 982 conditions per place.). [2022-12-06 02:41:37,366 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:41:37,367 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:41:37,367 INFO L458 BasicCegarLoop]: Path program histogram: [24, 21, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:37,371 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:41:37,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:41:37,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:41:37 BasicIcfg [2022-12-06 02:41:37,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:41:37,377 INFO L158 Benchmark]: Toolchain (without parser) took 844758.50ms. Allocated memory was 177.2MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 153.0MB in the beginning and 687.8MB in the end (delta: -534.8MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 02:41:37,377 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:41:37,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.86ms. Allocated memory is still 177.2MB. Free memory was 152.7MB in the beginning and 140.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:41:37,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.47ms. Allocated memory is still 177.2MB. Free memory was 140.8MB in the beginning and 139.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:41:37,378 INFO L158 Benchmark]: Boogie Preprocessor took 18.99ms. Allocated memory is still 177.2MB. Free memory was 139.0MB in the beginning and 137.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:41:37,378 INFO L158 Benchmark]: RCFGBuilder took 471.92ms. Allocated memory is still 177.2MB. Free memory was 137.3MB in the beginning and 112.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 02:41:37,378 INFO L158 Benchmark]: TraceAbstraction took 843997.70ms. Allocated memory was 177.2MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 111.8MB in the beginning and 687.8MB in the end (delta: -576.0MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 02:41:37,384 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.10ms. Allocated memory is still 177.2MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.86ms. Allocated memory is still 177.2MB. Free memory was 152.7MB in the beginning and 140.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.47ms. Allocated memory is still 177.2MB. Free memory was 140.8MB in the beginning and 139.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.99ms. Allocated memory is still 177.2MB. Free memory was 139.0MB in the beginning and 137.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 471.92ms. Allocated memory is still 177.2MB. Free memory was 137.3MB in the beginning and 112.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 843997.70ms. Allocated memory was 177.2MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 111.8MB in the beginning and 687.8MB in the end (delta: -576.0MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 95 PlacesBefore, 21 PlacesAfterwards, 97 TransitionsBefore, 17 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 55 TrivialYvCompositions, 19 ConcurrentYvCompositions, 6 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 281, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 281, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 281, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 281, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 281, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 281, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 281, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 281, unknown conditional: 0, unknown unconditional: 281] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 444, Positive conditional cache size: 0, Positive unconditional cache size: 444, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 38 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.9s, 27 PlacesBefore, 26 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 34 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, 29 PlacesBefore, 29 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 4 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, 32 PlacesBefore, 32 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 115 TransitionsBefore, 115 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, 53 PlacesBefore, 53 PlacesAfterwards, 127 TransitionsBefore, 127 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, 59 PlacesBefore, 59 PlacesAfterwards, 141 TransitionsBefore, 141 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, 65 PlacesBefore, 65 PlacesAfterwards, 162 TransitionsBefore, 162 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, 71 PlacesBefore, 71 PlacesAfterwards, 170 TransitionsBefore, 170 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, 77 PlacesBefore, 77 PlacesAfterwards, 186 TransitionsBefore, 186 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.8s, 82 PlacesBefore, 81 PlacesAfterwards, 318 TransitionsBefore, 317 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, 85 PlacesBefore, 85 PlacesAfterwards, 294 TransitionsBefore, 294 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, 89 PlacesBefore, 89 PlacesAfterwards, 282 TransitionsBefore, 282 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, 93 PlacesBefore, 93 PlacesAfterwards, 247 TransitionsBefore, 247 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, 116 PlacesBefore, 115 PlacesAfterwards, 355 TransitionsBefore, 354 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, 154 PlacesBefore, 154 PlacesAfterwards, 512 TransitionsBefore, 512 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, 204 PlacesBefore, 204 PlacesAfterwards, 772 TransitionsBefore, 772 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, 238 PlacesBefore, 238 PlacesAfterwards, 863 TransitionsBefore, 863 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, 269 PlacesBefore, 269 PlacesAfterwards, 1015 TransitionsBefore, 1015 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, 293 PlacesBefore, 293 PlacesAfterwards, 1079 TransitionsBefore, 1079 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, 319 PlacesBefore, 319 PlacesAfterwards, 1133 TransitionsBefore, 1133 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, 351 PlacesBefore, 351 PlacesAfterwards, 1248 TransitionsBefore, 1248 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, 372 PlacesBefore, 372 PlacesAfterwards, 1295 TransitionsBefore, 1295 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, 404 PlacesBefore, 404 PlacesAfterwards, 1382 TransitionsBefore, 1382 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, 425 PlacesBefore, 425 PlacesAfterwards, 1446 TransitionsBefore, 1446 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 452 PlacesBefore, 452 PlacesAfterwards, 1514 TransitionsBefore, 1514 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, 473 PlacesBefore, 473 PlacesAfterwards, 1541 TransitionsBefore, 1541 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, 486 PlacesBefore, 486 PlacesAfterwards, 1579 TransitionsBefore, 1579 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, 512 PlacesBefore, 512 PlacesAfterwards, 1731 TransitionsBefore, 1731 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, 536 PlacesBefore, 536 PlacesAfterwards, 1748 TransitionsBefore, 1748 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, 570 PlacesBefore, 570 PlacesAfterwards, 1833 TransitionsBefore, 1833 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, 602 PlacesBefore, 602 PlacesAfterwards, 1958 TransitionsBefore, 1958 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, 623 PlacesBefore, 623 PlacesAfterwards, 2020 TransitionsBefore, 2020 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, 656 PlacesBefore, 656 PlacesAfterwards, 2111 TransitionsBefore, 2111 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, 684 PlacesBefore, 684 PlacesAfterwards, 2171 TransitionsBefore, 2171 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, 713 PlacesBefore, 713 PlacesAfterwards, 2237 TransitionsBefore, 2237 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, 731 PlacesBefore, 731 PlacesAfterwards, 2266 TransitionsBefore, 2266 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, 736 PlacesBefore, 736 PlacesAfterwards, 2233 TransitionsBefore, 2233 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, 721 PlacesBefore, 721 PlacesAfterwards, 1776 TransitionsBefore, 1776 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, 704 PlacesBefore, 704 PlacesAfterwards, 1247 TransitionsBefore, 1247 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, 709 PlacesBefore, 709 PlacesAfterwards, 1223 TransitionsBefore, 1223 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.0s, 747 PlacesBefore, 746 PlacesAfterwards, 1524 TransitionsBefore, 1523 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, 767 PlacesBefore, 767 PlacesAfterwards, 1575 TransitionsBefore, 1575 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, 791 PlacesBefore, 791 PlacesAfterwards, 1745 TransitionsBefore, 1745 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, 836 PlacesBefore, 836 PlacesAfterwards, 2041 TransitionsBefore, 2041 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, 857 PlacesBefore, 857 PlacesAfterwards, 2094 TransitionsBefore, 2094 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, 874 PlacesBefore, 874 PlacesAfterwards, 2202 TransitionsBefore, 2202 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, 896 PlacesBefore, 896 PlacesAfterwards, 2334 TransitionsBefore, 2334 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, 915 PlacesBefore, 915 PlacesAfterwards, 2411 TransitionsBefore, 2411 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, 939 PlacesBefore, 939 PlacesAfterwards, 2480 TransitionsBefore, 2480 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, 989 PlacesBefore, 989 PlacesAfterwards, 2683 TransitionsBefore, 2683 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, 1009 PlacesBefore, 1009 PlacesAfterwards, 2754 TransitionsBefore, 2754 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, 1040 PlacesBefore, 1040 PlacesAfterwards, 2874 TransitionsBefore, 2874 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, 1068 PlacesBefore, 1068 PlacesAfterwards, 2996 TransitionsBefore, 2996 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, 1107 PlacesBefore, 1107 PlacesAfterwards, 3081 TransitionsBefore, 3081 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, 1144 PlacesBefore, 1144 PlacesAfterwards, 3183 TransitionsBefore, 3183 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, 1198 PlacesBefore, 1198 PlacesAfterwards, 4853 TransitionsBefore, 4853 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, 1211 PlacesBefore, 1211 PlacesAfterwards, 4966 TransitionsBefore, 4966 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.3s, 1255 PlacesBefore, 1254 PlacesAfterwards, 5170 TransitionsBefore, 5169 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, 1267 PlacesBefore, 1267 PlacesAfterwards, 5532 TransitionsBefore, 5532 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, 1269 PlacesBefore, 1269 PlacesAfterwards, 5486 TransitionsBefore, 5486 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, 1281 PlacesBefore, 1281 PlacesAfterwards, 5577 TransitionsBefore, 5577 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.1s, 1359 PlacesBefore, 1359 PlacesAfterwards, 6536 TransitionsBefore, 6536 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (34states, 0/23 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 76399 conditions, 1163 events (503/1162 cut-off events. For 10865/10865 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 10123 event pairs, 0 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 16747. Up to 982 conditions per place.). - TimeoutResultAtElement [Line: 76]: 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 (34states, 0/23 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 76399 conditions, 1163 events (503/1162 cut-off events. For 10865/10865 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 10123 event pairs, 0 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 16747. Up to 982 conditions per place.). - TimeoutResultAtElement [Line: 75]: 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 (34states, 0/23 universal loopers) in iteration 66,while PetriNetUnfolder was constructing finite prefix that currently has 76399 conditions, 1163 events (503/1162 cut-off events. For 10865/10865 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 10123 event pairs, 0 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 16747. Up to 982 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 119 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: 843.9s, OverallIterations: 66, TraceHistogramMax: 3, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 742.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8434 SdHoareTripleChecker+Valid, 34.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8434 mSDsluCounter, 2142 SdHoareTripleChecker+Invalid, 29.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1535 IncrementalHoareTripleChecker+Unchecked, 1813 mSDsCounter, 1796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54812 IncrementalHoareTripleChecker+Invalid, 58143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1796 mSolverCounterUnsat, 329 mSDtfsCounter, 54812 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3313 GetRequests, 1180 SyntacticMatches, 177 SemanticMatches, 1956 ConstructedPredicates, 17 IntricatePredicates, 4 DeprecatedPredicates, 22498 ImplicationChecksByTransitivity, 53.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=863831occurred in iteration=65, InterpolantAutomatonStates: 1454, 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.7s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 58.1s InterpolantComputationTime, 2237 NumberOfCodeBlocks, 2237 NumberOfCodeBlocksAsserted, 198 NumberOfCheckSat, 3066 ConstructedInterpolants, 94 QuantifiedInterpolants, 59602 SizeOfPredicates, 1701 NumberOfNonLiveVariables, 15187 ConjunctsInSsa, 4341 ConjunctsInUnsatCore, 184 InterpolantComputations, 9 PerfectInterpolantSequences, 110/1409 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