/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-more-mts.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:56:43,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:56:43,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:56:43,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:56:43,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:56:43,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:56:43,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:56:43,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:56:43,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:56:43,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:56:43,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:56:43,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:56:43,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:56:43,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:56:43,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:56:43,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:56:43,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:56:43,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:56:43,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:56:43,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:56:43,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:56:43,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:56:43,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:56:43,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:56:43,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:56:43,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:56:43,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:56:43,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:56:43,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:56:43,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:56:43,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:56:43,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:56:43,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:56:43,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:56:43,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:56:43,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:56:43,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:56:43,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:56:43,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:56:43,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:56:43,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:56:43,949 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:56:43,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:56:43,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:56:43,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:56:43,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:56:43,984 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:56:43,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:56:43,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:56:43,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:56:43,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:56:43,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:56:43,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:56:43,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:56:43,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:56:43,987 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:56:43,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:56:43,987 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:56:43,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:56:43,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:56:43,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:56:43,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:56:43,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:56:43,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:56:43,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:56:43,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:56:43,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:56:43,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:56:43,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:56:43,989 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:56:43,989 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:56:44,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:56:44,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:56:44,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:56:44,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:56:44,336 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:56:44,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2022-12-06 02:56:45,482 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:56:45,744 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:56:45,746 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2022-12-06 02:56:45,758 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b7e1c84/62973ad6cc3e472b947bc6bf58e18ea7/FLAG7e9d4703f [2022-12-06 02:56:45,780 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b7e1c84/62973ad6cc3e472b947bc6bf58e18ea7 [2022-12-06 02:56:45,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:56:45,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:56:45,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:56:45,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:56:45,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:56:45,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:56:45" (1/1) ... [2022-12-06 02:56:45,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254090a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:45, skipping insertion in model container [2022-12-06 02:56:45,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:56:45" (1/1) ... [2022-12-06 02:56:45,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:56:45,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:56:45,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:56:45,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:56:46,010 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-more-mts.wvr.c[2533,2546] [2022-12-06 02:56:46,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:56:46,032 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:56:46,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:56:46,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:56:46,075 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-more-mts.wvr.c[2533,2546] [2022-12-06 02:56:46,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:56:46,092 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:56:46,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46 WrapperNode [2022-12-06 02:56:46,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:56:46,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:56:46,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:56:46,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:56:46,101 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:56:46" (1/1) ... [2022-12-06 02:56:46,109 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:56:46" (1/1) ... [2022-12-06 02:56:46,139 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 225 [2022-12-06 02:56:46,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:56:46,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:56:46,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:56:46,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:56:46,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,186 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:56:46,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:56:46,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:56:46,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:56:46,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (1/1) ... [2022-12-06 02:56:46,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:56:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:56:46,236 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:56:46,264 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:56:46,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:56:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:56:46,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:56:46,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:56:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:56:46,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:56:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:56:46,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:56:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:56:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:56:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:56:46,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:56:46,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:56:46,286 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:56:46,425 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:56:46,426 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:56:46,709 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:56:46,883 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:56:46,883 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 02:56:46,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:56:46 BoogieIcfgContainer [2022-12-06 02:56:46,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:56:46,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:56:46,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:56:46,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:56:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:56:45" (1/3) ... [2022-12-06 02:56:46,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d78f1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:56:46, skipping insertion in model container [2022-12-06 02:56:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:56:46" (2/3) ... [2022-12-06 02:56:46,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d78f1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:56:46, skipping insertion in model container [2022-12-06 02:56:46,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:56:46" (3/3) ... [2022-12-06 02:56:46,895 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-12-06 02:56:46,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:56:46,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:56:46,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:56:47,001 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:56:47,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 203 transitions, 430 flow [2022-12-06 02:56:47,240 INFO L130 PetriNetUnfolder]: 18/200 cut-off events. [2022-12-06 02:56:47,240 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:56:47,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 200 events. 18/200 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 296 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-06 02:56:47,248 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 203 transitions, 430 flow [2022-12-06 02:56:47,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 190 transitions, 398 flow [2022-12-06 02:56:47,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:47,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 190 transitions, 398 flow [2022-12-06 02:56:47,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 190 transitions, 398 flow [2022-12-06 02:56:47,348 INFO L130 PetriNetUnfolder]: 18/190 cut-off events. [2022-12-06 02:56:47,348 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:56:47,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 18/190 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 291 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-06 02:56:47,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 190 transitions, 398 flow [2022-12-06 02:56:47,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 7140 [2022-12-06 02:56:55,278 INFO L203 LiptonReduction]: Total number of compositions: 164 [2022-12-06 02:56:55,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:56:55,309 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;@4ef6e82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:56:55,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:56:55,324 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 02:56:55,324 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:56:55,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:55,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:55,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:56:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1980545478, now seen corresponding path program 1 times [2022-12-06 02:56:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:55,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587357325] [2022-12-06 02:56:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:55,955 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:56:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:55,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587357325] [2022-12-06 02:56:55,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587357325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:56:55,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:56:55,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:56:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117963778] [2022-12-06 02:56:55,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:56:55,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:56:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:55,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:56:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:56:55,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 02:56:55,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:56:55,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:55,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 02:56:55,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:56,180 INFO L130 PetriNetUnfolder]: 619/873 cut-off events. [2022-12-06 02:56:56,181 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 02:56:56,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 873 events. 619/873 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3369 event pairs, 95 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 1491. Up to 688 conditions per place. [2022-12-06 02:56:56,193 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-06 02:56:56,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-06 02:56:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:56:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:56:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 02:56:56,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-06 02:56:56,208 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-12-06 02:56:56,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:56,209 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 44 transitions, 203 flow [2022-12-06 02:56:56,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 44 transitions, 203 flow [2022-12-06 02:56:56,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 02:56:56,217 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:56,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 02:56:56,219 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 44 transitions, 203 flow [2022-12-06 02:56:56,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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:56:56,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:56,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:56:56,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:56:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2108477278, now seen corresponding path program 1 times [2022-12-06 02:56:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:56,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443249176] [2022-12-06 02:56:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:56,390 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:56:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:56,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443249176] [2022-12-06 02:56:56,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443249176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:56:56,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:56:56,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:56:56,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489882004] [2022-12-06 02:56:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:56:56,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:56:56,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:56,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:56:56,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:56:56,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-06 02:56:56,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 44 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:56,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:56,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-06 02:56:56,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:56,543 INFO L130 PetriNetUnfolder]: 619/874 cut-off events. [2022-12-06 02:56:56,543 INFO L131 PetriNetUnfolder]: For 89/105 co-relation queries the response was YES. [2022-12-06 02:56:56,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 874 events. 619/874 cut-off events. For 89/105 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3416 event pairs, 95 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 2200. Up to 861 conditions per place. [2022-12-06 02:56:56,549 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 39 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2022-12-06 02:56:56,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 291 flow [2022-12-06 02:56:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:56:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:56:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 02:56:56,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-06 02:56:56,552 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-06 02:56:56,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:56,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 45 transitions, 291 flow [2022-12-06 02:56:56,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 45 transitions, 291 flow [2022-12-06 02:56:56,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 02:56:57,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:56:57,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1193 [2022-12-06 02:56:57,745 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 44 transitions, 285 flow [2022-12-06 02:56:57,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:57,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:57,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:57,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:56:57,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:56:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1552437279, now seen corresponding path program 1 times [2022-12-06 02:56:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:57,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314319566] [2022-12-06 02:56:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:57,837 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:56:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:57,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314319566] [2022-12-06 02:56:57,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314319566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:56:57,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:56:57,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:56:57,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869278214] [2022-12-06 02:56:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:56:57,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:56:57,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:57,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:56:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:56:57,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 02:56:57,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 44 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:57,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:57,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 02:56:57,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:58,044 INFO L130 PetriNetUnfolder]: 717/1001 cut-off events. [2022-12-06 02:56:58,044 INFO L131 PetriNetUnfolder]: For 399/435 co-relation queries the response was YES. [2022-12-06 02:56:58,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1001 events. 717/1001 cut-off events. For 399/435 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3935 event pairs, 63 based on Foata normal form. 1/722 useless extension candidates. Maximal degree in co-relation 3796. Up to 950 conditions per place. [2022-12-06 02:56:58,054 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 52 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2022-12-06 02:56:58,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 481 flow [2022-12-06 02:56:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:56:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:56:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 02:56:58,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2022-12-06 02:56:58,058 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-06 02:56:58,058 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:58,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 58 transitions, 481 flow [2022-12-06 02:56:58,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 58 transitions, 481 flow [2022-12-06 02:56:58,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 02:56:58,065 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:58,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:56:58,066 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 58 transitions, 481 flow [2022-12-06 02:56:58,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:58,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:58,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:58,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:56:58,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:56:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 458843866, now seen corresponding path program 1 times [2022-12-06 02:56:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:58,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598755181] [2022-12-06 02:56:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:58,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:56:58,177 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:56:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:56:58,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598755181] [2022-12-06 02:56:58,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598755181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:56:58,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:56:58,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:56:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831128528] [2022-12-06 02:56:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:56:58,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 02:56:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:56:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 02:56:58,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 02:56:58,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:56:58,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 58 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:58,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:56:58,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:56:58,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:56:58,514 INFO L130 PetriNetUnfolder]: 1145/1653 cut-off events. [2022-12-06 02:56:58,514 INFO L131 PetriNetUnfolder]: For 2312/2312 co-relation queries the response was YES. [2022-12-06 02:56:58,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7772 conditions, 1653 events. 1145/1653 cut-off events. For 2312/2312 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6499 event pairs, 154 based on Foata normal form. 0/1337 useless extension candidates. Maximal degree in co-relation 7438. Up to 1441 conditions per place. [2022-12-06 02:56:58,527 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 117 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2022-12-06 02:56:58,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 138 transitions, 1413 flow [2022-12-06 02:56:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:56:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:56:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-06 02:56:58,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 02:56:58,533 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2022-12-06 02:56:58,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:56:58,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 138 transitions, 1413 flow [2022-12-06 02:56:58,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 138 transitions, 1413 flow [2022-12-06 02:56:58,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 8 [2022-12-06 02:56:58,547 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:56:58,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 02:56:58,549 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 138 transitions, 1413 flow [2022-12-06 02:56:58,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:56:58,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:56:58,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:56:58,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:56:58,550 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:56:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:56:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1679687614, now seen corresponding path program 1 times [2022-12-06 02:56:58,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:56:58,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046641761] [2022-12-06 02:56:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:56:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:56:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:00,061 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:57:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046641761] [2022-12-06 02:57:00,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046641761] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573703706] [2022-12-06 02:57:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:00,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:00,066 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:57:00,267 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:57:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:00,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-06 02:57:00,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:00,431 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:57:00,501 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:57:00,568 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:57:00,638 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:57:00,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:57:00,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:57:00,986 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 94 treesize of output 53 [2022-12-06 02:57:01,211 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:57:01,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:02,264 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~sum~0 c_~mts2~0)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (< c_~mts3~0 .cse0) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse1 (+ c_~mts1~0 (select .cse3 c_~A~0.offset))) (.cse2 (+ (select .cse3 .cse4) c_~mts3~0))) (or (= .cse1 .cse2) (not (<= .cse1 2147483647)) (< .cse1 0) (< .cse2 0)))))) (or (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse5 (+ c_~mts1~0 (select .cse7 c_~A~0.offset))) (.cse6 (select .cse7 .cse4))) (or (not (<= .cse5 2147483647)) (< .cse5 0) (= .cse5 (+ c_~sum~0 .cse6 c_~mts2~0)) (< (+ .cse6 c_~mts3~0) 0))))) (<= .cse0 c_~mts3~0)) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse8 2147483648))) (<= (+ c_~sum~0 (select .cse9 .cse4) c_~mts2~0) 0) (not (< (+ c_~mts1~0 .cse8) 0)))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse10 (select .cse12 c_~A~0.offset)) (.cse11 (+ (select .cse12 .cse4) c_~mts3~0))) (or (not (<= 0 (+ c_~mts1~0 .cse10 2147483648))) (= .cse11 0) (not (< (+ c_~mts1~0 .cse10) 0)) (< .cse11 0))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse4))) (let ((.cse13 (+ c_~mts1~0 (select .cse16 c_~A~0.offset))) (.cse14 (+ c_~sum~0 .cse15 c_~mts2~0))) (or (not (<= .cse13 2147483647)) (< .cse13 0) (<= .cse14 0) (not (< (+ .cse15 c_~mts3~0) 0)) (= .cse13 .cse14)))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse17 (+ c_~mts1~0 (select .cse19 c_~A~0.offset))) (.cse18 (select .cse19 .cse4))) (or (not (<= .cse17 2147483647)) (< .cse17 0) (< 0 (+ c_~sum~0 .cse18 c_~mts2~0)) (= .cse17 0) (not (< (+ .cse18 c_~mts3~0) 0)))))))) is different from false [2022-12-06 02:57:02,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse13 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) c_~mts2~0) 0) (not (< (+ c_~mts1~0 .cse2) 0)) (not (<= 0 (+ c_~mts1~0 .cse2 2147483648))))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse1)) (.cse3 (+ c_~mts1~0 (select .cse5 c_~A~0.offset)))) (or (< .cse3 0) (< 0 (+ c_~sum~0 .cse4 c_~mts2~0)) (= .cse3 0) (not (< (+ c_~mts3~0 .cse4) 0)) (not (<= .cse3 2147483647)))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse1))) (let ((.cse7 (+ c_~sum~0 .cse8 c_~mts2~0)) (.cse6 (+ c_~mts1~0 (select .cse9 c_~A~0.offset)))) (or (< .cse6 0) (<= .cse7 0) (= .cse7 .cse6) (not (< (+ c_~mts3~0 .cse8) 0)) (not (<= .cse6 2147483647))))))) (or (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse11 (+ c_~mts3~0 (select .cse12 .cse1))) (.cse10 (+ c_~mts1~0 (select .cse12 c_~A~0.offset)))) (or (< .cse10 0) (= .cse11 .cse10) (< .cse11 0) (not (<= .cse10 2147483647)))))) (< c_~mts3~0 .cse13)) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse15 (+ c_~mts3~0 (select .cse16 .cse1))) (.cse14 (select .cse16 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse14) 0)) (< .cse15 0) (= .cse15 0) (not (<= 0 (+ c_~mts1~0 .cse14 2147483648))))))) (or (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_133) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse1)) (.cse17 (+ c_~mts1~0 (select .cse19 c_~A~0.offset)))) (or (< .cse17 0) (= (+ c_~sum~0 .cse18 c_~mts2~0) .cse17) (< (+ c_~mts3~0 .cse18) 0) (not (<= .cse17 2147483647)))))) (<= .cse13 c_~mts3~0)))) is different from false [2022-12-06 02:57:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:57:05,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573703706] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:05,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:05,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-12-06 02:57:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034462784] [2022-12-06 02:57:05,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:05,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 02:57:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:05,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 02:57:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=621, Unknown=2, NotChecked=106, Total=870 [2022-12-06 02:57:05,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 02:57:05,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 138 transitions, 1413 flow. Second operand has 30 states, 30 states have (on average 3.2) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:57:05,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:05,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 02:57:05,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:09,285 INFO L130 PetriNetUnfolder]: 2068/2986 cut-off events. [2022-12-06 02:57:09,286 INFO L131 PetriNetUnfolder]: For 5080/5116 co-relation queries the response was YES. [2022-12-06 02:57:09,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16839 conditions, 2986 events. 2068/2986 cut-off events. For 5080/5116 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13010 event pairs, 70 based on Foata normal form. 20/2442 useless extension candidates. Maximal degree in co-relation 14531. Up to 2591 conditions per place. [2022-12-06 02:57:09,314 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 280 selfloop transitions, 75 changer transitions 4/361 dead transitions. [2022-12-06 02:57:09,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 361 transitions, 4400 flow [2022-12-06 02:57:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:57:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:57:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2022-12-06 02:57:09,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 02:57:09,320 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2022-12-06 02:57:09,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:09,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 361 transitions, 4400 flow [2022-12-06 02:57:09,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 361 transitions, 4400 flow [2022-12-06 02:57:09,342 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 02:57:13,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:57:13,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4010 [2022-12-06 02:57:13,330 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 360 transitions, 4388 flow [2022-12-06 02:57:13,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2) internal successors, (96), 30 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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:57:13,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:13,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:57:13,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:57:13,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:13,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:57:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash -41318900, now seen corresponding path program 1 times [2022-12-06 02:57:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:13,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468246933] [2022-12-06 02:57:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:15,038 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:57:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468246933] [2022-12-06 02:57:15,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468246933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567587874] [2022-12-06 02:57:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:15,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:15,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:15,040 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:57:15,043 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:57:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:15,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 02:57:15,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:15,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:57:15,198 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:57:15,271 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:57:15,334 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:57:15,692 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:57:15,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 125 treesize of output 85 [2022-12-06 02:57:16,030 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:57:16,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:17,561 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~sum~0 c_~mts2~0))) (and (or (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse1 (+ c_~mts3~0 (select .cse2 .cse3))) (.cse0 (+ c_~mts1~0 (select .cse2 c_~A~0.offset)))) (or (not (<= .cse0 2147483647)) (< .cse0 0) (< .cse1 0) (= .cse1 .cse0))))) (< c_~mts3~0 .cse4)) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse5 (+ c_~mts1~0 (select .cse7 c_~A~0.offset))) (.cse6 (select .cse7 .cse3))) (or (not (<= .cse5 2147483647)) (= .cse5 0) (= (+ c_~sum~0 c_~mts2~0 .cse6) .cse5) (< .cse5 0) (not (< (+ c_~mts3~0 .cse6) 0)))))) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse3))) (or (<= (+ c_~sum~0 c_~mts2~0 .cse8) 0) (not (= (+ c_~mts1~0 (select .cse9 c_~A~0.offset)) 0)) (not (< (+ c_~mts3~0 .cse8) 0)))))) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse3))) (let ((.cse12 (+ c_~mts3~0 .cse11)) (.cse10 (+ c_~mts1~0 (select .cse13 c_~A~0.offset)))) (or (not (<= .cse10 2147483647)) (= (+ c_~sum~0 c_~mts2~0 .cse11) .cse10) (< .cse10 0) (< .cse12 0) (= .cse12 .cse10)))))) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse14 (select .cse16 c_~A~0.offset)) (.cse15 (+ c_~mts3~0 (select .cse16 .cse3)))) (or (not (<= 0 (+ c_~mts1~0 .cse14 2147483648))) (= .cse15 0) (not (< (+ c_~mts1~0 .cse14) 0)) (< .cse15 0))))) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse17 (select .cse19 c_~A~0.offset)) (.cse18 (select .cse19 .cse3))) (or (not (<= 0 (+ c_~mts1~0 .cse17 2147483648))) (not (< (+ c_~mts1~0 .cse17) 0)) (<= (+ c_~sum~0 c_~mts2~0 .cse18) 0) (not (< (+ c_~mts3~0 .cse18) 0)))))) (or (and (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse20 (+ c_~mts1~0 (select .cse22 c_~A~0.offset))) (.cse21 (+ c_~mts3~0 (select .cse22 .cse3)))) (or (not (<= .cse20 2147483647)) (not (= .cse21 .cse20)) (< .cse21 0))))) (forall ((v_ArrVal_188 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse23 (select .cse24 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse23 2147483648))) (not (< (+ c_~mts1~0 .cse23) 0)) (< (+ c_~mts3~0 (select .cse24 .cse3)) 0)))))) (<= .cse4 c_~mts3~0)))) is different from false [2022-12-06 02:57:17,839 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse16 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse4))) (let ((.cse0 (+ c_~mts1~0 (select .cse3 c_~A~0.offset))) (.cse1 (+ c_~mts3~0 .cse2))) (or (not (<= .cse0 2147483647)) (= .cse1 .cse0) (< .cse0 0) (= (+ c_~sum~0 .cse2 c_~mts2~0) .cse0) (< .cse1 0)))))) (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse4)) (.cse6 (+ c_~mts1~0 (select .cse7 c_~A~0.offset)))) (or (not (< (+ c_~mts3~0 .cse5) 0)) (= .cse6 0) (not (<= .cse6 2147483647)) (< .cse6 0) (= (+ c_~sum~0 .cse5 c_~mts2~0) .cse6))))) (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse8 (select .cse10 c_~A~0.offset)) (.cse9 (+ c_~mts3~0 (select .cse10 .cse4)))) (or (not (<= 0 (+ c_~mts1~0 .cse8 2147483648))) (not (< (+ c_~mts1~0 .cse8) 0)) (= .cse9 0) (< .cse9 0))))) (or (and (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse12 (+ c_~mts1~0 (select .cse13 c_~A~0.offset))) (.cse11 (+ c_~mts3~0 (select .cse13 .cse4)))) (or (not (= .cse11 .cse12)) (not (<= .cse12 2147483647)) (< .cse11 0))))) (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse14 (select .cse15 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse14 2147483648))) (not (< (+ c_~mts1~0 .cse14) 0)) (< (+ c_~mts3~0 (select .cse15 .cse4)) 0)))))) (<= .cse16 c_~mts3~0)) (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse4)) (.cse18 (select .cse19 c_~A~0.offset))) (or (not (< (+ c_~mts3~0 .cse17) 0)) (<= (+ c_~sum~0 .cse17 c_~mts2~0) 0) (not (<= 0 (+ c_~mts1~0 .cse18 2147483648))) (not (< (+ c_~mts1~0 .cse18) 0)))))) (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse21 (select .cse20 .cse4))) (or (not (= (+ c_~mts1~0 (select .cse20 c_~A~0.offset)) 0)) (not (< (+ c_~mts3~0 .cse21) 0)) (<= (+ c_~sum~0 .cse21 c_~mts2~0) 0))))) (or (forall ((v_ArrVal_188 (Array Int Int)) (v_ArrVal_187 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_187) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_188) c_~A~0.base))) (let ((.cse22 (+ c_~mts1~0 (select .cse24 c_~A~0.offset))) (.cse23 (+ c_~mts3~0 (select .cse24 .cse4)))) (or (not (<= .cse22 2147483647)) (= .cse23 .cse22) (< .cse22 0) (< .cse23 0))))) (< c_~mts3~0 .cse16)))) is different from false [2022-12-06 02:57:17,973 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:57:17,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567587874] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:17,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:17,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 02:57:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642333882] [2022-12-06 02:57:17,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:17,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:57:17,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:17,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:57:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=497, Unknown=2, NotChecked=94, Total=702 [2022-12-06 02:57:17,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:57:17,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 360 transitions, 4388 flow. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:57:17,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:17,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:57:17,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:20,473 INFO L130 PetriNetUnfolder]: 2720/3951 cut-off events. [2022-12-06 02:57:20,473 INFO L131 PetriNetUnfolder]: For 8557/8637 co-relation queries the response was YES. [2022-12-06 02:57:20,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26148 conditions, 3951 events. 2720/3951 cut-off events. For 8557/8637 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18673 event pairs, 80 based on Foata normal form. 26/3191 useless extension candidates. Maximal degree in co-relation 23217. Up to 3490 conditions per place. [2022-12-06 02:57:20,504 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 425 selfloop transitions, 91 changer transitions 14/532 dead transitions. [2022-12-06 02:57:20,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 532 transitions, 7584 flow [2022-12-06 02:57:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:57:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:57:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 180 transitions. [2022-12-06 02:57:20,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 02:57:20,507 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2022-12-06 02:57:20,507 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:20,507 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 532 transitions, 7584 flow [2022-12-06 02:57:20,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 532 transitions, 7584 flow [2022-12-06 02:57:20,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 02:57:20,553 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:20,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 02:57:20,554 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 532 transitions, 7584 flow [2022-12-06 02:57:20,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:57:20,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:20,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:57:20,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:57:20,754 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,SelfDestructingSolverStorable5 [2022-12-06 02:57:20,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:57:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:20,756 INFO L85 PathProgramCache]: Analyzing trace with hash 437977956, now seen corresponding path program 2 times [2022-12-06 02:57:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:20,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212532983] [2022-12-06 02:57:20,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:20,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:22,171 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:57:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:22,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212532983] [2022-12-06 02:57:22,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212532983] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:22,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820475075] [2022-12-06 02:57:22,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:57:22,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:22,174 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:57:22,177 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:57:22,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:57:22,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:22,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 02:57:22,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:22,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:57:22,342 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:57:22,425 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:57:22,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:57:22,743 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 51 treesize of output 45 [2022-12-06 02:57:22,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:57:22,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:57:22,988 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 94 treesize of output 53 [2022-12-06 02:57:23,121 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:57:23,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:23,562 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_243 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse1))) (or (not (< (+ c_~mts3~0 .cse0) 0)) (< (+ c_~sum~0 .cse0 c_~mts2~0) 1)))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_243 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse1)) 0))) (forall ((v_ArrVal_243 (Array Int Int))) (let ((.cse2 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse1)))) (or (< .cse2 0) (= .cse2 c_~mts1~0)))) (or (forall ((v_ArrVal_243 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse1)) 0))) (= c_~mts1~0 0)))) is different from false [2022-12-06 02:57:24,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1))) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_242 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< (+ .cse0 c_~mts1~0) 0)) (forall ((v_ArrVal_243 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3))) (or (< (+ c_~sum~0 .cse1 c_~mts2~0) 1) (not (< (+ c_~mts3~0 .cse1) 0))))) (not (<= 0 (+ .cse0 c_~mts1~0 2147483648))))))) (or (forall ((v_ArrVal_243 (Array Int Int)) (v_ArrVal_242 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse4 (+ (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~mts1~0))) (or (< .cse4 0) (not (<= .cse4 2147483647)) (< (+ c_~mts3~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3)) 0))))) .cse6) (forall ((v_ArrVal_242 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse7 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (not (< (+ .cse7 c_~mts1~0) 0)) (forall ((v_ArrVal_243 (Array Int Int))) (let ((.cse8 (+ c_~mts3~0 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3)))) (or (< .cse8 0) (= .cse8 0)))) (not (<= 0 (+ .cse7 c_~mts1~0 2147483648))))))) (or .cse6 (forall ((v_ArrVal_243 (Array Int Int)) (v_ArrVal_242 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse10 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (not (< (+ .cse10 c_~mts1~0) 0)) (< (+ c_~mts3~0 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3)) 0) (not (<= 0 (+ .cse10 c_~mts1~0 2147483648)))))))) (forall ((v_ArrVal_242 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse12 (+ (select (select .cse14 c_~A~0.base) c_~A~0.offset) c_~mts1~0))) (or (< .cse12 0) (not (<= .cse12 2147483647)) (forall ((v_ArrVal_243 (Array Int Int))) (let ((.cse13 (+ c_~mts3~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3)))) (or (< .cse13 0) (= .cse13 .cse12)))))))) (forall ((v_ArrVal_242 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse15 (+ (select (select .cse17 c_~A~0.base) c_~A~0.offset) c_~mts1~0))) (or (< .cse15 0) (forall ((v_ArrVal_243 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3))) (or (< (+ c_~sum~0 .cse16 c_~mts2~0) 1) (not (< (+ c_~mts3~0 .cse16) 0))))) (not (<= .cse15 2147483647)))))) (forall ((v_ArrVal_242 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242))) (let ((.cse18 (+ (select (select .cse19 c_~A~0.base) c_~A~0.offset) c_~mts1~0))) (or (< .cse18 0) (not (<= .cse18 2147483647)) (= .cse18 0) (forall ((v_ArrVal_243 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_243) c_~A~0.base) .cse3)) 0))))))))) is different from false [2022-12-06 02:57:24,563 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:57:24,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820475075] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:24,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:24,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 02:57:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609142654] [2022-12-06 02:57:24,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:24,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:57:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:57:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=508, Unknown=2, NotChecked=94, Total=702 [2022-12-06 02:57:24,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:57:24,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 532 transitions, 7584 flow. Second operand has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:57:24,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:24,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:57:24,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:26,982 INFO L130 PetriNetUnfolder]: 3056/4436 cut-off events. [2022-12-06 02:57:26,982 INFO L131 PetriNetUnfolder]: For 13050/13170 co-relation queries the response was YES. [2022-12-06 02:57:26,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33501 conditions, 4436 events. 3056/4436 cut-off events. For 13050/13170 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21459 event pairs, 94 based on Foata normal form. 23/3568 useless extension candidates. Maximal degree in co-relation 28172. Up to 3906 conditions per place. [2022-12-06 02:57:27,015 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 496 selfloop transitions, 81 changer transitions 15/594 dead transitions. [2022-12-06 02:57:27,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 594 transitions, 9660 flow [2022-12-06 02:57:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:57:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:57:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2022-12-06 02:57:27,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 02:57:27,018 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2022-12-06 02:57:27,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:27,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 594 transitions, 9660 flow [2022-12-06 02:57:27,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 594 transitions, 9660 flow [2022-12-06 02:57:27,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 02:57:27,051 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:27,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 02:57:27,052 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 594 transitions, 9660 flow [2022-12-06 02:57:27,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:57:27,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:27,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:57:27,061 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:57:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:27,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:57:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2144738048, now seen corresponding path program 3 times [2022-12-06 02:57:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:27,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016414217] [2022-12-06 02:57:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:57:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:28,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016414217] [2022-12-06 02:57:28,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016414217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:28,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715993324] [2022-12-06 02:57:28,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:57:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:28,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:28,358 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:57:28,361 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:57:28,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:57:28,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:28,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-06 02:57:28,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:28,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:57:28,522 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:57:28,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:57:28,682 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:57:29,191 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:57:29,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 115 treesize of output 85 [2022-12-06 02:57:29,465 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:57:29,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:30,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (+ c_~sum~0 c_~mts2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse0 (+ c_~mts3~0 (select .cse2 .cse3))) (.cse1 (select .cse2 c_~A~0.offset))) (or (< .cse0 0) (not (< (+ c_~mts1~0 .cse1) 0)) (= .cse0 0) (not (<= 0 (+ c_~mts1~0 .cse1 2147483648))))))) (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse4 (+ c_~mts1~0 (select .cse6 c_~A~0.offset))) (.cse5 (select .cse6 .cse3))) (or (= .cse4 0) (not (< (+ c_~mts3~0 .cse5) 0)) (not (<= .cse4 2147483647)) (< .cse4 0) (= .cse4 (+ c_~sum~0 c_~mts2~0 .cse5)))))) (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse3)) (.cse8 (select .cse9 c_~A~0.offset))) (or (<= (+ c_~sum~0 c_~mts2~0 .cse7) 0) (not (< (+ c_~mts1~0 .cse8) 0)) (not (< (+ c_~mts3~0 .cse7) 0)) (not (<= 0 (+ c_~mts1~0 .cse8 2147483648))))))) (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse3))) (or (<= (+ c_~sum~0 c_~mts2~0 .cse10) 0) (not (= (+ c_~mts1~0 (select .cse11 c_~A~0.offset)) 0)) (not (< (+ c_~mts3~0 .cse10) 0)))))) (or (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse13 (+ c_~mts1~0 (select .cse14 c_~A~0.offset))) (.cse12 (+ c_~mts3~0 (select .cse14 .cse3)))) (or (< .cse12 0) (not (<= .cse13 2147483647)) (< .cse13 0) (= .cse13 .cse12))))) (< c_~mts3~0 .cse15)) (or (and (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse17 (+ c_~mts1~0 (select .cse18 c_~A~0.offset))) (.cse16 (+ c_~mts3~0 (select .cse18 .cse3)))) (or (< .cse16 0) (not (<= .cse17 2147483647)) (not (= .cse17 .cse16)))))) (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse20 (select .cse19 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse19 .cse3)) 0) (not (< (+ c_~mts1~0 .cse20) 0)) (not (<= 0 (+ c_~mts1~0 .cse20 2147483648)))))))) (<= .cse15 c_~mts3~0)) (forall ((v_ArrVal_298 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse3))) (let ((.cse21 (+ c_~mts3~0 .cse23)) (.cse22 (+ c_~mts1~0 (select .cse24 c_~A~0.offset)))) (or (< .cse21 0) (not (<= .cse22 2147483647)) (< .cse22 0) (= .cse22 .cse21) (= .cse22 (+ c_~sum~0 c_~mts2~0 .cse23))))))))) is different from false [2022-12-06 02:57:31,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse13 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset)) (.cse0 (select .cse2 .cse3))) (or (<= (+ c_~sum~0 .cse0 c_~mts2~0) 0) (not (<= 0 (+ c_~mts1~0 .cse1 2147483648))) (not (< (+ c_~mts1~0 .cse1) 0)) (not (< (+ c_~mts3~0 .cse0) 0)))))) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse6 .cse3))) (.cse5 (select .cse6 c_~A~0.offset))) (or (= .cse4 0) (< .cse4 0) (not (<= 0 (+ c_~mts1~0 .cse5 2147483648))) (not (< (+ c_~mts1~0 .cse5) 0)))))) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse3))) (let ((.cse7 (+ c_~mts1~0 (select .cse10 c_~A~0.offset))) (.cse8 (+ c_~mts3~0 .cse9))) (or (< .cse7 0) (= .cse7 .cse8) (not (<= .cse7 2147483647)) (= .cse7 (+ c_~sum~0 .cse9 c_~mts2~0)) (< .cse8 0)))))) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse3))) (or (<= (+ c_~sum~0 .cse11 c_~mts2~0) 0) (not (< (+ c_~mts3~0 .cse11) 0)) (not (= (+ c_~mts1~0 (select .cse12 c_~A~0.offset)) 0)))))) (or (< c_~mts3~0 .cse13) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse14 (+ c_~mts1~0 (select .cse16 c_~A~0.offset))) (.cse15 (+ c_~mts3~0 (select .cse16 .cse3)))) (or (< .cse14 0) (= .cse14 .cse15) (not (<= .cse14 2147483647)) (< .cse15 0)))))) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse17 (+ c_~mts1~0 (select .cse19 c_~A~0.offset))) (.cse18 (select .cse19 .cse3))) (or (< .cse17 0) (not (<= .cse17 2147483647)) (= .cse17 (+ c_~sum~0 .cse18 c_~mts2~0)) (= .cse17 0) (not (< (+ c_~mts3~0 .cse18) 0)))))) (or (and (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse21 (select .cse20 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse20 .cse3)) 0) (not (<= 0 (+ c_~mts1~0 .cse21 2147483648))) (not (< (+ c_~mts1~0 .cse21) 0)))))) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_298) c_~A~0.base))) (let ((.cse22 (+ c_~mts1~0 (select .cse24 c_~A~0.offset))) (.cse23 (+ c_~mts3~0 (select .cse24 .cse3)))) (or (not (<= .cse22 2147483647)) (not (= .cse22 .cse23)) (< .cse23 0)))))) (<= .cse13 c_~mts3~0)))) is different from false [2022-12-06 02:57:31,259 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:57:31,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715993324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:31,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:31,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 02:57:31,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435578281] [2022-12-06 02:57:31,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:31,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:57:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:31,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:57:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=495, Unknown=2, NotChecked=94, Total=702 [2022-12-06 02:57:31,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:57:31,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 594 transitions, 9660 flow. Second operand has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:57:31,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:31,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:57:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:33,370 INFO L130 PetriNetUnfolder]: 3289/4782 cut-off events. [2022-12-06 02:57:33,370 INFO L131 PetriNetUnfolder]: For 8041/8041 co-relation queries the response was YES. [2022-12-06 02:57:33,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40766 conditions, 4782 events. 3289/4782 cut-off events. For 8041/8041 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23134 event pairs, 138 based on Foata normal form. 1/3818 useless extension candidates. Maximal degree in co-relation 33189. Up to 4206 conditions per place. [2022-12-06 02:57:33,405 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 577 selfloop transitions, 76 changer transitions 16/669 dead transitions. [2022-12-06 02:57:33,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 669 transitions, 12087 flow [2022-12-06 02:57:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:57:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:57:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2022-12-06 02:57:33,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2022-12-06 02:57:33,408 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2022-12-06 02:57:33,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:33,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 669 transitions, 12087 flow [2022-12-06 02:57:33,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 669 transitions, 12087 flow [2022-12-06 02:57:33,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:33,444 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:33,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 02:57:33,444 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 669 transitions, 12087 flow [2022-12-06 02:57:33,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:57:33,445 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:33,445 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:57:33,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:57:33,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:33,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:57:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -23405578, now seen corresponding path program 4 times [2022-12-06 02:57:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:33,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218867097] [2022-12-06 02:57:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:34,759 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:57:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218867097] [2022-12-06 02:57:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218867097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616691583] [2022-12-06 02:57:34,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:57:34,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:34,764 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:57:34,767 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:57:34,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:57:34,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:34,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 02:57:34,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:34,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:57:34,896 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:57:34,957 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:57:35,008 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:57:35,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:57:35,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 119 treesize of output 101 [2022-12-06 02:57:35,784 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:57:35,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:37,757 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset))) (let ((.cse3 (+ c_~mts1~0 .cse1))) (or (forall ((~M~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (+ c_~mts3~0 .cse0) 0) (< (+ c_~sum~0 .cse0 c_~mts2~0) (+ c_~mts1~0 .cse1 1)) (< 0 ~M~0) (< ~M~0 0)))) (not (<= .cse3 2147483647)) (< .cse3 0)))))) (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (let ((.cse4 (+ c_~mts1~0 .cse6))) (or (not (<= .cse4 2147483647)) (< .cse4 0) (forall ((~M~0 Int)) (let ((.cse5 (select .cse7 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (+ c_~sum~0 .cse5 c_~mts2~0) (+ c_~mts1~0 .cse6 1)) (< 0 ~M~0) (< ~M~0 0) (not (< (+ c_~mts3~0 .cse5) 0)))))))))) (or (forall ((~M~0 Int) (v_ArrVal_353 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse9 (select .cse8 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) 0) (< 0 ~M~0) (< ~M~0 0) (not (< (+ c_~mts1~0 .cse9) 0)) (not (<= 0 (+ c_~mts1~0 .cse9 2147483648))))))) (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1))) (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse10 (+ c_~mts1~0 (select .cse12 c_~A~0.offset)))) (or (not (<= .cse10 2147483647)) (< .cse10 0) (forall ((~M~0 Int)) (let ((.cse11 (+ c_~mts3~0 (select .cse12 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< .cse11 0) (< 0 ~M~0) (< ~M~0 0) (= .cse10 .cse11)))))))) (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse13 (select .cse15 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse13) 0)) (not (<= 0 (+ c_~mts1~0 .cse13 2147483648))) (forall ((~M~0 Int)) (let ((.cse14 (+ c_~mts3~0 (select .cse15 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< .cse14 0) (< 0 ~M~0) (= .cse14 0) (< ~M~0 0)))))))) (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse16 (select .cse18 c_~A~0.offset))) (or (<= 0 (+ c_~mts1~0 .cse16)) (< (+ c_~mts1~0 .cse16 2147483648) 0) (forall ((~M~0 Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (< (+ c_~sum~0 .cse17 c_~mts2~0) 1) (not (< (+ c_~mts3~0 .cse17) 0))))))))) (forall ((v_ArrVal_353 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse19 (+ c_~mts1~0 (select .cse20 c_~A~0.offset)))) (or (= .cse19 0) (not (<= .cse19 2147483647)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (not (< (+ c_~mts3~0 (select .cse20 (+ c_~A~0.offset (* ~M~0 4)))) 0)))) (< .cse19 0)))))) is different from false [2022-12-06 02:57:38,127 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (not (<= 0 (+ .cse0 c_~mts1~0 2147483648))) (not (< (+ .cse0 c_~mts1~0) 0)) (forall ((~M~0 Int)) (let ((.cse1 (+ c_~mts3~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< .cse1 0) (= .cse1 0) (< 0 ~M~0) (< ~M~0 0)))))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (let ((.cse3 (+ .cse5 c_~mts1~0))) (or (< .cse3 0) (forall ((~M~0 Int)) (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (+ c_~mts3~0 .cse4) 0) (< 0 ~M~0) (< (+ c_~sum~0 .cse4 c_~mts2~0) (+ .cse5 c_~mts1~0 1)) (< ~M~0 0)))) (not (<= .cse3 2147483647))))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse7 (+ (select .cse9 c_~A~0.offset) c_~mts1~0))) (or (< .cse7 0) (forall ((~M~0 Int)) (let ((.cse8 (+ c_~mts3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< .cse8 0) (< 0 ~M~0) (< ~M~0 0) (= .cse7 .cse8)))) (not (<= .cse7 2147483647)))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (let ((.cse10 (+ .cse12 c_~mts1~0))) (or (< .cse10 0) (not (<= .cse10 2147483647)) (forall ((~M~0 Int)) (let ((.cse11 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< (+ c_~sum~0 .cse11 c_~mts2~0) (+ .cse12 c_~mts1~0 1)) (< ~M~0 0) (not (< (+ c_~mts3~0 .cse11) 0)))))))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((~M~0 Int) (v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse14 (+ c_~A~0.offset (* ~M~0 4)))) 0) (not (<= 0 (+ .cse15 c_~mts1~0 2147483648))) (< 0 ~M~0) (not (< (+ .cse15 c_~mts1~0) 0)) (< ~M~0 0)))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse16 (+ (select .cse17 c_~A~0.offset) c_~mts1~0))) (or (< .cse16 0) (= .cse16 0) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (not (< (+ c_~mts3~0 (select .cse17 (+ c_~A~0.offset (* ~M~0 4)))) 0)))) (not (<= .cse16 2147483647)))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_353) c_~A~0.base))) (let ((.cse18 (select .cse20 c_~A~0.offset))) (or (<= 0 (+ .cse18 c_~mts1~0)) (< (+ .cse18 c_~mts1~0 2147483648) 0) (forall ((~M~0 Int)) (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< (+ c_~mts3~0 .cse19) 0)) (< (+ c_~sum~0 .cse19 c_~mts2~0) 1))))))))) is different from false [2022-12-06 02:57:38,300 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:57:38,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616691583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:38,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:38,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-06 02:57:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11230697] [2022-12-06 02:57:38,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 02:57:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 02:57:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=871, Unknown=2, NotChecked=126, Total=1190 [2022-12-06 02:57:38,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:57:38,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 669 transitions, 12087 flow. Second operand has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 34 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:57:38,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:38,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:57:38,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:49,933 INFO L130 PetriNetUnfolder]: 4250/6339 cut-off events. [2022-12-06 02:57:49,933 INFO L131 PetriNetUnfolder]: For 7843/7843 co-relation queries the response was YES. [2022-12-06 02:57:49,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61004 conditions, 6339 events. 4250/6339 cut-off events. For 7843/7843 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 33511 event pairs, 186 based on Foata normal form. 3/5119 useless extension candidates. Maximal degree in co-relation 47575. Up to 5689 conditions per place. [2022-12-06 02:57:49,977 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 850 selfloop transitions, 242 changer transitions 60/1152 dead transitions. [2022-12-06 02:57:49,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1152 transitions, 23178 flow [2022-12-06 02:57:49,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 02:57:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 02:57:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 300 transitions. [2022-12-06 02:57:49,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31746031746031744 [2022-12-06 02:57:49,980 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2022-12-06 02:57:49,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:49,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 1152 transitions, 23178 flow [2022-12-06 02:57:50,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 1152 transitions, 23178 flow [2022-12-06 02:57:50,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:50,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:50,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 02:57:50,036 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 1152 transitions, 23178 flow [2022-12-06 02:57:50,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 34 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:57:50,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:50,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:57:50,043 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:57:50,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:50,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:57:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1179521794, now seen corresponding path program 5 times [2022-12-06 02:57:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:50,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853750] [2022-12-06 02:57:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:51,450 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:57:51,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853750] [2022-12-06 02:57:51,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:51,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906320206] [2022-12-06 02:57:51,450 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:57:51,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:51,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:51,452 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:57:51,454 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:57:51,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:57:51,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:51,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 02:57:51,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:52,166 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-06 02:57:52,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 115 treesize of output 85 [2022-12-06 02:57:52,357 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:57:52,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:57:52,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:57:52,760 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 211 treesize of output 135 [2022-12-06 02:57:53,334 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:57:53,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906320206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:57:53,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:57:53,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2022-12-06 02:57:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536355505] [2022-12-06 02:57:53,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:57:53,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:57:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:57:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:57:53,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-12-06 02:57:53,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:57:53,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1152 transitions, 23178 flow. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:57:53,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:57:53,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:57:53,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:57:57,101 INFO L130 PetriNetUnfolder]: 4878/7326 cut-off events. [2022-12-06 02:57:57,101 INFO L131 PetriNetUnfolder]: For 8996/8996 co-relation queries the response was YES. [2022-12-06 02:57:57,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77779 conditions, 7326 events. 4878/7326 cut-off events. For 8996/8996 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 40645 event pairs, 79 based on Foata normal form. 3/5890 useless extension candidates. Maximal degree in co-relation 60375. Up to 6596 conditions per place. [2022-12-06 02:57:57,162 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 1075 selfloop transitions, 267 changer transitions 80/1422 dead transitions. [2022-12-06 02:57:57,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 1422 transitions, 31344 flow [2022-12-06 02:57:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:57:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:57:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 182 transitions. [2022-12-06 02:57:57,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35477582846003897 [2022-12-06 02:57:57,165 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2022-12-06 02:57:57,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:57:57,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 1422 transitions, 31344 flow [2022-12-06 02:57:57,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 1422 transitions, 31344 flow [2022-12-06 02:57:57,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:57:57,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:57:57,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-06 02:57:57,246 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 1422 transitions, 31344 flow [2022-12-06 02:57:57,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:57:57,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:57:57,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:57:57,255 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:57:57,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:57,453 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:57:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:57:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1658956378, now seen corresponding path program 6 times [2022-12-06 02:57:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:57:57,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929988777] [2022-12-06 02:57:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:57:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:57:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:57:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:57:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:57:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929988777] [2022-12-06 02:57:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929988777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:57:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648754214] [2022-12-06 02:57:58,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:57:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:57:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:57:58,442 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:57:58,445 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:57:58,554 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:57:58,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:57:58,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 02:57:58,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:57:58,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:57:58,596 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:57:58,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:57:58,942 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 51 treesize of output 45 [2022-12-06 02:57:59,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:57:59,067 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 51 treesize of output 45 [2022-12-06 02:57:59,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:57:59,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:57:59,315 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 94 treesize of output 53 [2022-12-06 02:57:59,540 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:57:59,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:01,022 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:58:01,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648754214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:01,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:01,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-06 02:58:01,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927304291] [2022-12-06 02:58:01,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:01,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 02:58:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 02:58:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=535, Unknown=11, NotChecked=0, Total=650 [2022-12-06 02:58:01,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 02:58:01,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 1422 transitions, 31344 flow. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:58:01,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:01,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 02:58:01,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:04,371 INFO L130 PetriNetUnfolder]: 5475/8190 cut-off events. [2022-12-06 02:58:04,371 INFO L131 PetriNetUnfolder]: For 12738/12738 co-relation queries the response was YES. [2022-12-06 02:58:04,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94622 conditions, 8190 events. 5475/8190 cut-off events. For 12738/12738 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 46023 event pairs, 86 based on Foata normal form. 1/6557 useless extension candidates. Maximal degree in co-relation 71967. Up to 7364 conditions per place. [2022-12-06 02:58:04,420 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 1224 selfloop transitions, 227 changer transitions 86/1569 dead transitions. [2022-12-06 02:58:04,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 1569 transitions, 37721 flow [2022-12-06 02:58:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:58:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:58:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-12-06 02:58:04,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2022-12-06 02:58:04,422 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2022-12-06 02:58:04,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:04,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 1569 transitions, 37721 flow [2022-12-06 02:58:04,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 1569 transitions, 37721 flow [2022-12-06 02:58:04,492 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:04,497 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:04,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 02:58:04,498 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 1569 transitions, 37721 flow [2022-12-06 02:58:04,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:58:04,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:04,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:58:04,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 02:58:04,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:04,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:58:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1246950786, now seen corresponding path program 7 times [2022-12-06 02:58:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:04,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681307551] [2022-12-06 02:58:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:05,698 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:58:05,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:05,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681307551] [2022-12-06 02:58:05,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681307551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158412221] [2022-12-06 02:58:05,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:58:05,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:05,700 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:58:05,702 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:58:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:05,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 02:58:05,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:05,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:58:05,835 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:58:05,880 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:58:05,920 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:58:06,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:58:06,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 119 treesize of output 101 [2022-12-06 02:58:06,800 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:58:06,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:08,540 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((~M~0 Int) (v_ArrVal_507 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (<= 0 (+ c_~mts1~0 .cse0 2147483648))) (not (< (+ c_~mts1~0 .cse0) 0)) (< (+ c_~mts3~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) 0) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse3 (select .cse4 c_~A~0.offset))) (let ((.cse5 (+ c_~mts1~0 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse2 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (+ c_~sum~0 .cse2 c_~mts2~0) (+ c_~mts1~0 .cse3 1)) (not (< ~M~0 c_~N~0)) (not (< (+ c_~mts3~0 .cse2) 0)) (< (+ ~M~0 1) c_~N~0)))) (< .cse5 0) (not (<= .cse5 2147483647))))))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (let ((.cse9 (+ c_~mts1~0 .cse7))) (or (forall ((~M~0 Int)) (let ((.cse6 (select .cse8 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (+ c_~sum~0 .cse6 c_~mts2~0) (+ c_~mts1~0 .cse7 1)) (not (< ~M~0 c_~N~0)) (< (+ c_~mts3~0 .cse6) 0) (< (+ ~M~0 1) c_~N~0)))) (< .cse9 0) (not (<= .cse9 2147483647))))))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse11 (+ c_~mts1~0 (select .cse10 c_~A~0.offset)))) (or (forall ((~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (not (< (+ c_~mts3~0 (select .cse10 (+ c_~A~0.offset (* ~M~0 4)))) 0)) (< (+ ~M~0 1) c_~N~0))) (< .cse11 0) (not (<= .cse11 2147483647)) (= .cse11 0))))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse12 (select .cse14 c_~A~0.offset))) (or (not (<= 0 (+ c_~mts1~0 .cse12 2147483648))) (not (< (+ c_~mts1~0 .cse12) 0)) (forall ((~M~0 Int)) (let ((.cse13 (+ c_~mts3~0 (select .cse14 (+ c_~A~0.offset (* ~M~0 4)))))) (or (not (< ~M~0 c_~N~0)) (= .cse13 0) (< .cse13 0) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse15 (select .cse17 c_~A~0.offset))) (or (<= 0 (+ c_~mts1~0 .cse15)) (forall ((~M~0 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< (+ c_~sum~0 .cse16 c_~mts2~0) 1) (not (< (+ c_~mts3~0 .cse16) 0)) (< (+ ~M~0 1) c_~N~0)))) (< (+ c_~mts1~0 .cse15 2147483648) 0))))) (forall ((v_ArrVal_507 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse18 (+ c_~mts1~0 (select .cse20 c_~A~0.offset)))) (or (< .cse18 0) (not (<= .cse18 2147483647)) (forall ((~M~0 Int)) (let ((.cse19 (+ c_~mts3~0 (select .cse20 (+ c_~A~0.offset (* ~M~0 4)))))) (or (not (< ~M~0 c_~N~0)) (= .cse19 .cse18) (< .cse19 0) (< (+ ~M~0 1) c_~N~0)))))))))) is different from false [2022-12-06 02:58:08,898 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset))) (or (< (+ .cse0 c_~mts1~0 2147483648) 0) (<= 0 (+ .cse0 c_~mts1~0)) (forall ((~M~0 Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< (+ c_~mts3~0 .cse1) 0)) (< (+ c_~sum~0 .cse1 c_~mts2~0) 1) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_506 (Array Int Int)) (~M~0 Int) (v_ArrVal_507 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse4 (select .cse3 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4)))) 0) (not (< ~M~0 c_~N~0)) (not (<= 0 (+ .cse4 c_~mts1~0 2147483648))) (< (+ ~M~0 1) c_~N~0) (not (< (+ .cse4 c_~mts1~0) 0))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse7 (select .cse6 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse5 (+ c_~mts3~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< .cse5 0) (not (< ~M~0 c_~N~0)) (= .cse5 0) (< (+ ~M~0 1) c_~N~0)))) (not (<= 0 (+ .cse7 c_~mts1~0 2147483648))) (not (< (+ .cse7 c_~mts1~0) 0)))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse8 (+ (select .cse9 c_~A~0.offset) c_~mts1~0))) (or (= .cse8 0) (< .cse8 0) (forall ((~M~0 Int)) (or (not (< (+ c_~mts3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) 0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) (not (<= .cse8 2147483647)))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset))) (let ((.cse10 (+ .cse12 c_~mts1~0))) (or (< .cse10 0) (forall ((~M~0 Int)) (let ((.cse11 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (+ c_~mts3~0 .cse11) 0) (not (< ~M~0 c_~N~0)) (< (+ c_~sum~0 .cse11 c_~mts2~0) (+ .cse12 c_~mts1~0 1)) (< (+ ~M~0 1) c_~N~0)))) (not (<= .cse10 2147483647))))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse14 (+ (select .cse16 c_~A~0.offset) c_~mts1~0))) (or (< .cse14 0) (forall ((~M~0 Int)) (let ((.cse15 (+ c_~mts3~0 (select .cse16 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< .cse15 0) (not (< ~M~0 c_~N~0)) (= .cse15 .cse14) (< (+ ~M~0 1) c_~N~0)))) (not (<= .cse14 2147483647)))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_507) c_~A~0.base))) (let ((.cse19 (select .cse20 c_~A~0.offset))) (let ((.cse17 (+ .cse19 c_~mts1~0))) (or (< .cse17 0) (forall ((~M~0 Int)) (let ((.cse18 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< (+ c_~mts3~0 .cse18) 0)) (not (< ~M~0 c_~N~0)) (< (+ c_~sum~0 .cse18 c_~mts2~0) (+ .cse19 c_~mts1~0 1)) (< (+ ~M~0 1) c_~N~0)))) (not (<= .cse17 2147483647))))))))) is different from false [2022-12-06 02:58:09,100 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:58:09,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158412221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:09,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:09,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 28 [2022-12-06 02:58:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824062744] [2022-12-06 02:58:09,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:09,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 02:58:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 02:58:09,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=625, Unknown=2, NotChecked=106, Total=870 [2022-12-06 02:58:09,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:58:09,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 1569 transitions, 37721 flow. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:58:09,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:09,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:58:09,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:17,466 INFO L130 PetriNetUnfolder]: 7274/11019 cut-off events. [2022-12-06 02:58:17,466 INFO L131 PetriNetUnfolder]: For 14742/14742 co-relation queries the response was YES. [2022-12-06 02:58:17,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138138 conditions, 11019 events. 7274/11019 cut-off events. For 14742/14742 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 66197 event pairs, 38 based on Foata normal form. 3/8771 useless extension candidates. Maximal degree in co-relation 100039. Up to 9884 conditions per place. [2022-12-06 02:58:17,536 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 1626 selfloop transitions, 687 changer transitions 144/2457 dead transitions. [2022-12-06 02:58:17,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 2457 transitions, 63728 flow [2022-12-06 02:58:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-06 02:58:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-06 02:58:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 375 transitions. [2022-12-06 02:58:17,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3306878306878307 [2022-12-06 02:58:17,538 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2022-12-06 02:58:17,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:17,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 2457 transitions, 63728 flow [2022-12-06 02:58:17,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 2457 transitions, 63728 flow [2022-12-06 02:58:17,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:17,630 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:58:17,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 02:58:17,631 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 2457 transitions, 63728 flow [2022-12-06 02:58:17,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:58:17,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:17,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:58:17,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:58:17,832 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,SelfDestructingSolverStorable11 [2022-12-06 02:58:17,832 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:58:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1278689394, now seen corresponding path program 8 times [2022-12-06 02:58:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:17,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007259800] [2022-12-06 02:58:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:18,808 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:58:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007259800] [2022-12-06 02:58:18,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007259800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606604588] [2022-12-06 02:58:18,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:58:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:18,810 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:58:18,811 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:58:18,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:58:18,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:58:18,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-06 02:58:18,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:18,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 02:58:18,980 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:58:19,044 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:58:19,106 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:58:19,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:58:19,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 149 treesize of output 105 [2022-12-06 02:58:19,975 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:58:19,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:22,796 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:58:22,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606604588] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:22,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:22,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-12-06 02:58:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070437557] [2022-12-06 02:58:22,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:22,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 02:58:22,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 02:58:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=785, Unknown=9, NotChecked=0, Total=930 [2022-12-06 02:58:22,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:58:22,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 2457 transitions, 63728 flow. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:58:22,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:22,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:58:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:58:28,918 WARN L233 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 216 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:58:31,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:58:41,231 WARN L233 SmtUtils]: Spent 9.67s on a formula simplification. DAG size of input: 170 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 02:58:51,468 INFO L130 PetriNetUnfolder]: 8683/13055 cut-off events. [2022-12-06 02:58:51,469 INFO L131 PetriNetUnfolder]: For 13630/13630 co-relation queries the response was YES. [2022-12-06 02:58:51,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176749 conditions, 13055 events. 8683/13055 cut-off events. For 13630/13630 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 79575 event pairs, 30 based on Foata normal form. 3/10385 useless extension candidates. Maximal degree in co-relation 121357. Up to 11737 conditions per place. [2022-12-06 02:58:51,680 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 2315 selfloop transitions, 726 changer transitions 155/3196 dead transitions. [2022-12-06 02:58:51,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 3196 transitions, 88807 flow [2022-12-06 02:58:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 02:58:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 02:58:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 263 transitions. [2022-12-06 02:58:51,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30439814814814814 [2022-12-06 02:58:51,685 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2022-12-06 02:58:51,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:58:51,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 3196 transitions, 88807 flow [2022-12-06 02:58:51,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 3196 transitions, 88807 flow [2022-12-06 02:58:51,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:58:55,233 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:58:55,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3549 [2022-12-06 02:58:55,234 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 3195 transitions, 88779 flow [2022-12-06 02:58:55,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:58:55,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:58:55,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:58:55,243 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:58:55,435 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,SelfDestructingSolverStorable12 [2022-12-06 02:58:55,436 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:58:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:58:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2092497304, now seen corresponding path program 1 times [2022-12-06 02:58:55,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:58:55,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377630634] [2022-12-06 02:58:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:55,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:58:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:58:55,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:58:55,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377630634] [2022-12-06 02:58:55,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377630634] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:58:55,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018559317] [2022-12-06 02:58:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:58:55,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:58:55,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:58:55,556 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:58:55,562 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:58:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:58:55,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:58:55,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:58:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:58:55,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:58:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:58:55,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018559317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:58:55,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:58:55,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 02:58:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693684292] [2022-12-06 02:58:55,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:58:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:58:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:58:55,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:58:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:58:55,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 02:58:55,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 3195 transitions, 88779 flow. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:58:55,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:58:55,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 02:58:55,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:59:03,101 INFO L130 PetriNetUnfolder]: 10225/15417 cut-off events. [2022-12-06 02:59:03,101 INFO L131 PetriNetUnfolder]: For 17981/17981 co-relation queries the response was YES. [2022-12-06 02:59:03,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224186 conditions, 15417 events. 10225/15417 cut-off events. For 17981/17981 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 97411 event pairs, 49 based on Foata normal form. 0/12298 useless extension candidates. Maximal degree in co-relation 145860. Up to 14054 conditions per place. [2022-12-06 02:59:03,214 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 3402 selfloop transitions, 152 changer transitions 160/3729 dead transitions. [2022-12-06 02:59:03,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 3729 transitions, 111134 flow [2022-12-06 02:59:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:59:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:59:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-06 02:59:03,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2022-12-06 02:59:03,216 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 194 predicate places. [2022-12-06 02:59:03,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:59:03,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 3729 transitions, 111134 flow [2022-12-06 02:59:03,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 3729 transitions, 111134 flow [2022-12-06 02:59:03,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:59:03,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:59:03,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-06 02:59:03,372 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 3729 transitions, 111134 flow [2022-12-06 02:59:03,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 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:59:03,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:59:03,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:59:03,378 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:59:03,574 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,SelfDestructingSolverStorable13 [2022-12-06 02:59:03,575 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:59:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:59:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash 673749024, now seen corresponding path program 2 times [2022-12-06 02:59:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:59:03,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909160778] [2022-12-06 02:59:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:59:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:59:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:59:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:59:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909160778] [2022-12-06 02:59:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909160778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:59:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295720030] [2022-12-06 02:59:03,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:59:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:59:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:59:03,676 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:59:03,702 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:59:03,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:59:03,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:59:03,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:59:03,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:59:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:03,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:59:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:03,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295720030] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:59:03,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:59:03,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 02:59:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74523785] [2022-12-06 02:59:03,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:59:03,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:59:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:59:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:59:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:59:03,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 02:59:03,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 3729 transitions, 111134 flow. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 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:59:03,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:59:03,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 02:59:03,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:59:14,925 INFO L130 PetriNetUnfolder]: 12179/18311 cut-off events. [2022-12-06 02:59:14,925 INFO L131 PetriNetUnfolder]: For 25698/25698 co-relation queries the response was YES. [2022-12-06 02:59:14,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285540 conditions, 18311 events. 12179/18311 cut-off events. For 25698/25698 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 118120 event pairs, 48 based on Foata normal form. 0/14678 useless extension candidates. Maximal degree in co-relation 169696. Up to 16875 conditions per place. [2022-12-06 02:59:15,082 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 4646 selfloop transitions, 995 changer transitions 175/5831 dead transitions. [2022-12-06 02:59:15,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 5831 transitions, 186282 flow [2022-12-06 02:59:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:59:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:59:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 207 transitions. [2022-12-06 02:59:15,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46205357142857145 [2022-12-06 02:59:15,084 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 209 predicate places. [2022-12-06 02:59:15,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:59:15,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 5831 transitions, 186282 flow [2022-12-06 02:59:15,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 5831 transitions, 186282 flow [2022-12-06 02:59:15,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:59:15,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:59:15,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-06 02:59:15,450 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 5831 transitions, 186282 flow [2022-12-06 02:59:15,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 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:59:15,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:59:15,450 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:59:15,455 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:59:15,655 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,SelfDestructingSolverStorable14 [2022-12-06 02:59:15,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:59:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:59:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1022502892, now seen corresponding path program 3 times [2022-12-06 02:59:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:59:15,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361778788] [2022-12-06 02:59:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:59:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:59:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:59:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:59:15,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361778788] [2022-12-06 02:59:15,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361778788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:59:15,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276060607] [2022-12-06 02:59:15,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:59:15,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:59:15,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:59:15,765 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:59:15,796 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:59:15,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:59:15,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:59:15,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:59:15,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:59:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:15,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:59:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:16,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276060607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:59:16,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:59:16,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 02:59:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431267122] [2022-12-06 02:59:16,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:59:16,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:59:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:59:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:59:16,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:59:16,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 02:59:16,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 5831 transitions, 186282 flow. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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:59:16,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:59:16,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 02:59:16,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:59:37,287 INFO L130 PetriNetUnfolder]: 13647/20445 cut-off events. [2022-12-06 02:59:37,287 INFO L131 PetriNetUnfolder]: For 27650/27650 co-relation queries the response was YES. [2022-12-06 02:59:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339376 conditions, 20445 events. 13647/20445 cut-off events. For 27650/27650 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 133203 event pairs, 22 based on Foata normal form. 0/16546 useless extension candidates. Maximal degree in co-relation 198496. Up to 18959 conditions per place. [2022-12-06 02:59:37,456 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 5270 selfloop transitions, 1250 changer transitions 175/6710 dead transitions. [2022-12-06 02:59:37,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 6710 transitions, 227869 flow [2022-12-06 02:59:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:59:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 02:59:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 232 transitions. [2022-12-06 02:59:37,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-06 02:59:37,458 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2022-12-06 02:59:37,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:59:37,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 6710 transitions, 227869 flow [2022-12-06 02:59:37,668 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 258 places, 6710 transitions, 227869 flow [2022-12-06 02:59:37,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:59:37,681 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:59:37,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 02:59:37,682 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 6710 transitions, 227869 flow [2022-12-06 02:59:37,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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:59:37,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:59:37,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:59:37,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:59:37,882 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,SelfDestructingSolverStorable15 [2022-12-06 02:59:37,882 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:59:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:59:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2037175288, now seen corresponding path program 4 times [2022-12-06 02:59:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:59:37,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049554965] [2022-12-06 02:59:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:59:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:59:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:59:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:37,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:59:37,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049554965] [2022-12-06 02:59:37,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049554965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:59:37,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332158370] [2022-12-06 02:59:37,985 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:59:37,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:59:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:59:37,988 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:59:37,994 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:59:38,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:59:38,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:59:38,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 02:59:38,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:59:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:38,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:59:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:59:38,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332158370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:59:38,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:59:38,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 02:59:38,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767905467] [2022-12-06 02:59:38,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:59:38,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:59:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:59:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:59:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:59:38,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 02:59:38,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 6710 transitions, 227869 flow. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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:59:38,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:59:38,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 02:59:38,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:00:04,381 INFO L130 PetriNetUnfolder]: 13663/20443 cut-off events. [2022-12-06 03:00:04,382 INFO L131 PetriNetUnfolder]: For 32189/32189 co-relation queries the response was YES. [2022-12-06 03:00:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359501 conditions, 20443 events. 13663/20443 cut-off events. For 32189/32189 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 132928 event pairs, 23 based on Foata normal form. 0/16590 useless extension candidates. Maximal degree in co-relation 210390. Up to 18957 conditions per place. [2022-12-06 03:00:04,576 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 5532 selfloop transitions, 993 changer transitions 160/6700 dead transitions. [2022-12-06 03:00:04,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 6700 transitions, 240869 flow [2022-12-06 03:00:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:00:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:00:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2022-12-06 03:00:04,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 03:00:04,578 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2022-12-06 03:00:04,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:00:04,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 6700 transitions, 240869 flow [2022-12-06 03:00:04,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 6700 transitions, 240869 flow [2022-12-06 03:00:04,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:00:04,834 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:00:04,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 03:00:04,834 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 6700 transitions, 240869 flow [2022-12-06 03:00:04,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:00:04,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:00:04,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:00:04,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 03:00:05,039 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,SelfDestructingSolverStorable16 [2022-12-06 03:00:05,039 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:00:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:00:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1428910750, now seen corresponding path program 5 times [2022-12-06 03:00:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:00:05,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399438228] [2022-12-06 03:00:05,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:00:05,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:00:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:00:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:00:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:00:05,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399438228] [2022-12-06 03:00:05,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399438228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:00:05,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623880978] [2022-12-06 03:00:05,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:00:05,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:00:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:00:05,149 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:00:05,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 03:00:05,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:00:05,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:00:05,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:00:05,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:00:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:00:05,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:00:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:00:05,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623880978] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:00:05,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:00:05,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-06 03:00:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282389354] [2022-12-06 03:00:05,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:00:05,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 03:00:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:00:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 03:00:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-06 03:00:05,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:00:05,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 6700 transitions, 240869 flow. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:00:05,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:00:05,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:00:05,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:00:35,987 INFO L130 PetriNetUnfolder]: 14829/22247 cut-off events. [2022-12-06 03:00:35,987 INFO L131 PetriNetUnfolder]: For 35288/35288 co-relation queries the response was YES. [2022-12-06 03:00:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413535 conditions, 22247 events. 14829/22247 cut-off events. For 35288/35288 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 146746 event pairs, 24 based on Foata normal form. 0/18024 useless extension candidates. Maximal degree in co-relation 222284. Up to 20761 conditions per place. [2022-12-06 03:00:36,209 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 5884 selfloop transitions, 1366 changer transitions 167/7432 dead transitions. [2022-12-06 03:00:36,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 7432 transitions, 282155 flow [2022-12-06 03:00:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 03:00:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 03:00:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2022-12-06 03:00:36,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 03:00:36,211 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 246 predicate places. [2022-12-06 03:00:36,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:00:36,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 7432 transitions, 282155 flow [2022-12-06 03:00:36,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 7432 transitions, 282155 flow [2022-12-06 03:00:36,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:00:36,484 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:00:36,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-06 03:00:36,485 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 7432 transitions, 282155 flow [2022-12-06 03:00:36,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:00:36,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:00:36,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:00:36,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 03:00:36,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:00:36,688 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:00:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:00:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2021939724, now seen corresponding path program 6 times [2022-12-06 03:00:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:00:36,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249404067] [2022-12-06 03:00:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:00:36,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:00:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:00:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:00:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:00:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249404067] [2022-12-06 03:00:36,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249404067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:00:36,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396164656] [2022-12-06 03:00:36,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:00:36,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:00:36,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:00:36,792 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:00:36,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 03:00:36,915 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 03:00:36,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:00:36,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:00:36,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:00:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:00:36,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:00:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:00:37,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396164656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:00:37,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:00:37,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 03:00:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902229218] [2022-12-06 03:00:37,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:00:37,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:00:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:00:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:00:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:00:37,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:00:37,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 7432 transitions, 282155 flow. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:00:37,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:00:37,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:00:37,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:01:16,840 INFO L130 PetriNetUnfolder]: 15560/23392 cut-off events. [2022-12-06 03:01:16,841 INFO L131 PetriNetUnfolder]: For 42575/42575 co-relation queries the response was YES. [2022-12-06 03:01:16,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458217 conditions, 23392 events. 15560/23392 cut-off events. For 42575/42575 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 156178 event pairs, 23 based on Foata normal form. 0/18943 useless extension candidates. Maximal degree in co-relation 234178. Up to 21906 conditions per place. [2022-12-06 03:01:17,072 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 6248 selfloop transitions, 1445 changer transitions 182/7890 dead transitions. [2022-12-06 03:01:17,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 7890 transitions, 315462 flow [2022-12-06 03:01:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:01:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:01:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 218 transitions. [2022-12-06 03:01:17,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2022-12-06 03:01:17,086 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 263 predicate places. [2022-12-06 03:01:17,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:01:17,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 295 places, 7890 transitions, 315462 flow [2022-12-06 03:01:17,379 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 295 places, 7890 transitions, 315462 flow [2022-12-06 03:01:17,379 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:01:17,393 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:01:17,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-06 03:01:17,394 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 7890 transitions, 315462 flow [2022-12-06 03:01:17,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:01:17,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:01:17,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:01:17,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 03:01:17,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:01:17,598 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:01:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:01:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1319233462, now seen corresponding path program 7 times [2022-12-06 03:01:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:01:17,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938457578] [2022-12-06 03:01:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:01:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:01:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:01:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:01:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:01:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938457578] [2022-12-06 03:01:17,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938457578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:01:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142566349] [2022-12-06 03:01:17,716 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 03:01:17,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:01:17,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:01:17,720 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:01:17,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 03:01:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:01:17,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:01:17,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:01:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:01:17,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:01:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:01:18,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142566349] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:01:18,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:01:18,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 03:01:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442360014] [2022-12-06 03:01:18,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:01:18,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 03:01:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:01:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 03:01:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 03:01:18,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:01:18,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 7890 transitions, 315462 flow. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:01:18,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:01:18,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:01:18,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:02:08,554 INFO L130 PetriNetUnfolder]: 15695/23601 cut-off events. [2022-12-06 03:02:08,554 INFO L131 PetriNetUnfolder]: For 47774/47774 co-relation queries the response was YES. [2022-12-06 03:02:08,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485618 conditions, 23601 events. 15695/23601 cut-off events. For 47774/47774 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 157723 event pairs, 23 based on Foata normal form. 0/19146 useless extension candidates. Maximal degree in co-relation 246072. Up to 22089 conditions per place. [2022-12-06 03:02:08,777 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 6662 selfloop transitions, 1119 changer transitions 182/7978 dead transitions. [2022-12-06 03:02:08,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 7978 transitions, 334932 flow [2022-12-06 03:02:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 03:02:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 03:02:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-12-06 03:02:08,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 03:02:08,779 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 272 predicate places. [2022-12-06 03:02:08,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:02:08,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 7978 transitions, 334932 flow [2022-12-06 03:02:09,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 7978 transitions, 334932 flow [2022-12-06 03:02:09,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:02:09,098 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:02:09,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 03:02:09,099 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 7978 transitions, 334932 flow [2022-12-06 03:02:09,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:02:09,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:02:09,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:02:09,108 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 03:02:09,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:02:09,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:02:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:02:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2010069142, now seen corresponding path program 8 times [2022-12-06 03:02:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:02:09,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290992360] [2022-12-06 03:02:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:02:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:02:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:02:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:02:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290992360] [2022-12-06 03:02:09,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290992360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:02:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102961600] [2022-12-06 03:02:09,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 03:02:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:02:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:02:09,400 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:02:09,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 03:02:09,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 03:02:09,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:02:09,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:02:09,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:02:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:09,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:02:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102961600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:02:09,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:02:09,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 03:02:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488590242] [2022-12-06 03:02:09,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:02:09,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:02:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:02:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:02:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:02:09,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:02:09,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 7978 transitions, 334932 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:02:09,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:02:09,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:02:09,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:02:57,036 INFO L130 PetriNetUnfolder]: 16279/24449 cut-off events. [2022-12-06 03:02:57,037 INFO L131 PetriNetUnfolder]: For 56353/56353 co-relation queries the response was YES. [2022-12-06 03:02:57,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527298 conditions, 24449 events. 16279/24449 cut-off events. For 56353/56353 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 163844 event pairs, 22 based on Foata normal form. 0/19830 useless extension candidates. Maximal degree in co-relation 257966. Up to 22937 conditions per place. [2022-12-06 03:02:57,287 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 6573 selfloop transitions, 1504 changer transitions 167/8259 dead transitions. [2022-12-06 03:02:57,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 8259 transitions, 363273 flow [2022-12-06 03:02:57,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 03:02:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 03:02:57,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 223 transitions. [2022-12-06 03:02:57,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44246031746031744 [2022-12-06 03:02:57,289 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 289 predicate places. [2022-12-06 03:02:57,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:02:57,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 8259 transitions, 363273 flow [2022-12-06 03:02:57,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 8259 transitions, 363273 flow [2022-12-06 03:02:57,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:02:57,713 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:02:57,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 425 [2022-12-06 03:02:57,714 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 8259 transitions, 363273 flow [2022-12-06 03:02:57,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:02:57,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:02:57,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:02:57,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 03:02:57,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:02:57,921 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:02:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:02:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -345735076, now seen corresponding path program 9 times [2022-12-06 03:02:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:02:57,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474619144] [2022-12-06 03:02:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:02:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:02:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:02:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:58,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:02:58,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474619144] [2022-12-06 03:02:58,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474619144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:02:58,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195562242] [2022-12-06 03:02:58,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 03:02:58,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:02:58,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:02:58,020 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:02:58,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 03:02:58,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 03:02:58,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:02:58,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:02:58,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:02:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:58,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:02:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:02:58,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195562242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:02:58,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:02:58,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 03:02:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195892079] [2022-12-06 03:02:58,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:02:58,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:02:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:02:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:02:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:02:58,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:02:58,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 8259 transitions, 363273 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:02:58,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:02:58,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:02:58,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:03:49,507 INFO L130 PetriNetUnfolder]: 16241/24411 cut-off events. [2022-12-06 03:03:49,507 INFO L131 PetriNetUnfolder]: For 63478/63478 co-relation queries the response was YES. [2022-12-06 03:03:49,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550515 conditions, 24411 events. 16241/24411 cut-off events. For 63478/63478 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 163777 event pairs, 22 based on Foata normal form. 0/19830 useless extension candidates. Maximal degree in co-relation 269860. Up to 22899 conditions per place. [2022-12-06 03:03:49,907 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 6625 selfloop transitions, 1444 changer transitions 166/8250 dead transitions. [2022-12-06 03:03:49,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 8250 transitions, 379347 flow [2022-12-06 03:03:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 03:03:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 03:03:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 237 transitions. [2022-12-06 03:03:49,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44548872180451127 [2022-12-06 03:03:49,909 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2022-12-06 03:03:49,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:03:49,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 8250 transitions, 379347 flow [2022-12-06 03:03:50,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 8250 transitions, 379347 flow [2022-12-06 03:03:50,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:03:50,278 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:03:50,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 370 [2022-12-06 03:03:50,279 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 8250 transitions, 379347 flow [2022-12-06 03:03:50,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:03:50,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:03:50,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:03:50,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 03:03:50,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:03:50,480 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:03:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:03:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -82776646, now seen corresponding path program 10 times [2022-12-06 03:03:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:03:50,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626327742] [2022-12-06 03:03:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:03:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:03:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:03:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:03:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:03:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626327742] [2022-12-06 03:03:50,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626327742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:03:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715015545] [2022-12-06 03:03:50,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:03:50,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:03:50,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:03:50,576 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:03:50,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 03:03:50,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:03:50,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:03:50,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 03:03:50,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:03:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:03:50,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:03:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:03:50,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715015545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:03:50,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:03:50,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 03:03:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226175066] [2022-12-06 03:03:50,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:03:50,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 03:03:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:03:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 03:03:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 03:03:50,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:03:50,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 8250 transitions, 379347 flow. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:03:50,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:03:50,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:03:50,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:04:43,569 INFO L130 PetriNetUnfolder]: 16173/24275 cut-off events. [2022-12-06 03:04:43,569 INFO L131 PetriNetUnfolder]: For 69197/69197 co-relation queries the response was YES. [2022-12-06 03:04:43,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571315 conditions, 24275 events. 16173/24275 cut-off events. For 69197/69197 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 162359 event pairs, 48 based on Foata normal form. 0/19752 useless extension candidates. Maximal degree in co-relation 281754. Up to 22763 conditions per place. [2022-12-06 03:04:43,827 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 6249 selfloop transitions, 1760 changer transitions 150/8174 dead transitions. [2022-12-06 03:04:43,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 8174 transitions, 392124 flow [2022-12-06 03:04:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 03:04:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 03:04:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 273 transitions. [2022-12-06 03:04:43,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 03:04:43,829 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 329 predicate places. [2022-12-06 03:04:43,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:04:43,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 361 places, 8174 transitions, 392124 flow [2022-12-06 03:04:44,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 361 places, 8174 transitions, 392124 flow [2022-12-06 03:04:44,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:04:44,211 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:04:44,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 03:04:44,212 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 8174 transitions, 392124 flow [2022-12-06 03:04:44,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:44,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:04:44,212 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:04:44,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 03:04:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:04:44,413 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:04:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:04:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -956959902, now seen corresponding path program 9 times [2022-12-06 03:04:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:04:44,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387148834] [2022-12-06 03:04:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:04:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:04:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:04:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:04:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:04:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387148834] [2022-12-06 03:04:44,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387148834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:04:44,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:04:44,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 03:04:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830501821] [2022-12-06 03:04:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:04:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:04:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:04:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:04:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 03:04:44,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 03:04:44,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 8174 transitions, 392124 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:04:44,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:04:44,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 03:04:44,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:05:31,475 INFO L130 PetriNetUnfolder]: 13876/21352 cut-off events. [2022-12-06 03:05:31,475 INFO L131 PetriNetUnfolder]: For 74644/74644 co-relation queries the response was YES. [2022-12-06 03:05:31,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522443 conditions, 21352 events. 13876/21352 cut-off events. For 74644/74644 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 146370 event pairs, 20 based on Foata normal form. 0/18213 useless extension candidates. Maximal degree in co-relation 254039. Up to 19840 conditions per place. [2022-12-06 03:05:31,760 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 6615 selfloop transitions, 433 changer transitions 318/7494 dead transitions. [2022-12-06 03:05:31,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 7494 transitions, 374365 flow [2022-12-06 03:05:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:05:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:05:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 03:05:31,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-06 03:05:31,762 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 330 predicate places. [2022-12-06 03:05:31,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:05:31,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 362 places, 7494 transitions, 374365 flow [2022-12-06 03:05:32,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 362 places, 7494 transitions, 374365 flow [2022-12-06 03:05:32,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:05:32,085 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:05:32,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-06 03:05:32,086 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 7494 transitions, 374365 flow [2022-12-06 03:05:32,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:05:32,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:05:32,086 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:05:32,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 03:05:32,087 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:05:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:05:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1493692345, now seen corresponding path program 10 times [2022-12-06 03:05:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:05:32,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086739206] [2022-12-06 03:05:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:05:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:05:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:05:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:05:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:05:32,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086739206] [2022-12-06 03:05:32,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086739206] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:05:32,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267372072] [2022-12-06 03:05:32,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 03:05:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:05:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:05:32,168 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:05:32,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 03:05:32,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 03:05:32,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:05:32,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 03:05:32,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:05:32,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2022-12-06 03:05:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:05:32,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 03:05:32,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267372072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:05:32,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 03:05:32,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-06 03:05:32,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645378014] [2022-12-06 03:05:32,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:05:32,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 03:05:32,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:05:32,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 03:05:32,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:05:32,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 03:05:32,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 7494 transitions, 374365 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 03:05:32,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:05:32,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 03:05:32,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:06:03,330 INFO L130 PetriNetUnfolder]: 10754/16771 cut-off events. [2022-12-06 03:06:03,330 INFO L131 PetriNetUnfolder]: For 76002/76002 co-relation queries the response was YES. [2022-12-06 03:06:03,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425606 conditions, 16771 events. 10754/16771 cut-off events. For 76002/76002 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 113713 event pairs, 18 based on Foata normal form. 0/14544 useless extension candidates. Maximal degree in co-relation 263976. Up to 15370 conditions per place. [2022-12-06 03:06:03,490 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 5260 selfloop transitions, 73 changer transitions 458/5962 dead transitions. [2022-12-06 03:06:03,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 5962 transitions, 309567 flow [2022-12-06 03:06:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 03:06:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 03:06:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 03:06:03,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2022-12-06 03:06:03,492 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 311 predicate places. [2022-12-06 03:06:03,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:06:03,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 5962 transitions, 309567 flow [2022-12-06 03:06:03,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 5962 transitions, 309567 flow [2022-12-06 03:06:03,805 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:06:03,812 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:06:03,813 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-06 03:06:03,813 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 5962 transitions, 309567 flow [2022-12-06 03:06:03,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 03:06:03,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:06:03,813 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:06:03,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 03:06:04,015 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 03:06:04,016 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:06:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:06:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash 152856352, now seen corresponding path program 11 times [2022-12-06 03:06:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:06:04,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522141571] [2022-12-06 03:06:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:06:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:06:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:06:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:06:04,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:06:04,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522141571] [2022-12-06 03:06:04,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522141571] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:06:04,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899737202] [2022-12-06 03:06:04,101 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 03:06:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:06:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:06:04,102 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:06:04,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 03:06:04,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 03:06:04,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:06:04,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 03:06:04,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:06:04,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2022-12-06 03:06:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:06:04,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 03:06:04,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-12-06 03:06:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:06:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899737202] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 03:06:04,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 03:06:04,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 03:06:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301993027] [2022-12-06 03:06:04,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 03:06:04,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 03:06:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:06:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 03:06:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-06 03:06:04,327 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 03:06:04,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 5962 transitions, 309567 flow. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:06:04,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:06:04,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 03:06:04,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:06:28,153 INFO L130 PetriNetUnfolder]: 12061/18634 cut-off events. [2022-12-06 03:06:28,154 INFO L131 PetriNetUnfolder]: For 85940/85940 co-relation queries the response was YES. [2022-12-06 03:06:28,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491048 conditions, 18634 events. 12061/18634 cut-off events. For 85940/85940 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 123718 event pairs, 32 based on Foata normal form. 0/16227 useless extension candidates. Maximal degree in co-relation 324207. Up to 17233 conditions per place. [2022-12-06 03:06:28,355 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 5341 selfloop transitions, 872 changer transitions 458/6839 dead transitions. [2022-12-06 03:06:28,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 6839 transitions, 368457 flow [2022-12-06 03:06:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 03:06:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 03:06:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 03:06:28,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2022-12-06 03:06:28,360 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 316 predicate places. [2022-12-06 03:06:28,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:06:28,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 348 places, 6839 transitions, 368457 flow [2022-12-06 03:06:28,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 348 places, 6839 transitions, 368457 flow [2022-12-06 03:06:28,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:06:28,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:06:28,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 466 [2022-12-06 03:06:28,826 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 6839 transitions, 368457 flow [2022-12-06 03:06:28,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 03:06:28,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:06:28,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:06:28,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 03:06:29,032 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 03:06:29,032 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:06:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:06:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1744871174, now seen corresponding path program 1 times [2022-12-06 03:06:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:06:29,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909191020] [2022-12-06 03:06:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:06:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:06:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:06:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 03:06:29,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:06:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909191020] [2022-12-06 03:06:29,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909191020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 03:06:29,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 03:06:29,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 03:06:29,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195979655] [2022-12-06 03:06:29,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 03:06:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 03:06:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 03:06:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 03:06:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 03:06:29,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 03:06:29,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 6839 transitions, 368457 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 03:06:29,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 03:06:29,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 03:06:29,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 03:06:54,373 INFO L130 PetriNetUnfolder]: 10167/15767 cut-off events. [2022-12-06 03:06:54,373 INFO L131 PetriNetUnfolder]: For 86771/86771 co-relation queries the response was YES. [2022-12-06 03:06:54,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429832 conditions, 15767 events. 10167/15767 cut-off events. For 86771/86771 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 101753 event pairs, 14 based on Foata normal form. 0/13821 useless extension candidates. Maximal degree in co-relation 336209. Up to 14481 conditions per place. [2022-12-06 03:06:54,562 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 4635 selfloop transitions, 0 changer transitions 1187/5831 dead transitions. [2022-12-06 03:06:54,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 5831 transitions, 325437 flow [2022-12-06 03:06:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 03:06:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 03:06:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 03:06:54,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2022-12-06 03:06:54,564 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 307 predicate places. [2022-12-06 03:06:54,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 03:06:54,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 5831 transitions, 325437 flow [2022-12-06 03:06:54,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 5831 transitions, 325437 flow [2022-12-06 03:06:54,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 03:06:54,945 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 03:06:54,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-06 03:06:54,945 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 5831 transitions, 325437 flow [2022-12-06 03:06:54,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 03:06:54,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 03:06:54,946 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 03:06:54,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 03:06:54,946 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 03:06:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 03:06:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1045762787, now seen corresponding path program 12 times [2022-12-06 03:06:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 03:06:54,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231872843] [2022-12-06 03:06:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 03:06:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 03:06:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 03:06:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 03:06:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 03:06:57,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231872843] [2022-12-06 03:06:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231872843] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 03:06:57,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307853499] [2022-12-06 03:06:57,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 03:06:57,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 03:06:57,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 03:06:57,337 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 03:06:57,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 03:06:57,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 03:06:57,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 03:06:57,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 109 conjunts are in the unsatisfiable core [2022-12-06 03:06:57,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 03:06:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:06:57,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 03:06:57,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:06:57,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 03:06:57,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 03:06:57,714 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 20 treesize of output 22 [2022-12-06 03:06:59,334 INFO L321 Elim1Store]: treesize reduction 106, result has 79.1 percent of original size [2022-12-06 03:06:59,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 308 treesize of output 528 Received shutdown request... [2022-12-06 03:10:10,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 03:10:10,785 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:10:10,786 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 03:10:10,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 03:10:10,981 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,SelfDestructingSolverStorable27 [2022-12-06 03:10:10,981 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. [2022-12-06 03:10:10,983 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 03:10:10,983 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 03:10:10,983 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 03:10:10,984 INFO L458 BasicCegarLoop]: Path program histogram: [12, 10, 1, 1, 1, 1, 1, 1] [2022-12-06 03:10:10,986 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 03:10:10,986 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 03:10:10,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 03:10:10 BasicIcfg [2022-12-06 03:10:10,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 03:10:10,989 INFO L158 Benchmark]: Toolchain (without parser) took 805205.67ms. Allocated memory was 182.5MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 159.5MB in the beginning and 618.5MB in the end (delta: -459.0MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 03:10:10,989 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 03:10:10,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.48ms. Allocated memory is still 182.5MB. Free memory was 159.5MB in the beginning and 147.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 03:10:10,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.61ms. Allocated memory is still 182.5MB. Free memory was 147.5MB in the beginning and 144.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 03:10:10,990 INFO L158 Benchmark]: Boogie Preprocessor took 49.35ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 143.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 03:10:10,990 INFO L158 Benchmark]: RCFGBuilder took 696.54ms. Allocated memory is still 182.5MB. Free memory was 143.3MB in the beginning and 107.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 03:10:10,990 INFO L158 Benchmark]: TraceAbstraction took 804099.11ms. Allocated memory was 182.5MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 107.1MB in the beginning and 618.5MB in the end (delta: -511.4MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-06 03:10:10,992 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.11ms. Allocated memory is still 182.5MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.48ms. Allocated memory is still 182.5MB. Free memory was 159.5MB in the beginning and 147.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.61ms. Allocated memory is still 182.5MB. Free memory was 147.5MB in the beginning and 144.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.35ms. Allocated memory is still 182.5MB. Free memory was 144.9MB in the beginning and 143.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 696.54ms. Allocated memory is still 182.5MB. Free memory was 143.3MB in the beginning and 107.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 804099.11ms. Allocated memory was 182.5MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 107.1MB in the beginning and 618.5MB in the end (delta: -511.4MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 182 PlacesBefore, 32 PlacesAfterwards, 190 TransitionsBefore, 26 TransitionsAfterwards, 7140 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 82 ConcurrentYvCompositions, 14 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 4509, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4211, independent: 4192, independent conditional: 0, independent unconditional: 4192, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4211, independent: 4192, independent conditional: 0, independent unconditional: 4192, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4534, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 7813, Positive cache size: 7794, Positive conditional cache size: 0, Positive unconditional cache size: 7794, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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, 34 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 126 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.2s, 36 PlacesBefore, 35 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 126 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, 38 PlacesBefore, 38 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 114 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, 44 PlacesBefore, 44 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 8 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: 4.0s, 55 PlacesBefore, 54 PlacesAfterwards, 361 TransitionsBefore, 360 TransitionsAfterwards, 10 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, 68 PlacesBefore, 68 PlacesAfterwards, 532 TransitionsBefore, 532 TransitionsAfterwards, 10 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, 76 PlacesBefore, 76 PlacesAfterwards, 594 TransitionsBefore, 594 TransitionsAfterwards, 10 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, 88 PlacesBefore, 88 PlacesAfterwards, 669 TransitionsBefore, 669 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, 122 PlacesBefore, 122 PlacesAfterwards, 1152 TransitionsBefore, 1152 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 140 PlacesBefore, 140 PlacesAfterwards, 1422 TransitionsBefore, 1422 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, 150 PlacesBefore, 150 PlacesAfterwards, 1569 TransitionsBefore, 1569 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, 191 PlacesBefore, 191 PlacesAfterwards, 2457 TransitionsBefore, 2457 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 221 PlacesBefore, 220 PlacesAfterwards, 3196 TransitionsBefore, 3195 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, 226 PlacesBefore, 226 PlacesAfterwards, 3729 TransitionsBefore, 3729 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, 241 PlacesBefore, 241 PlacesAfterwards, 5831 TransitionsBefore, 5831 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, 258 PlacesBefore, 258 PlacesAfterwards, 6710 TransitionsBefore, 6710 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, 267 PlacesBefore, 267 PlacesAfterwards, 6700 TransitionsBefore, 6700 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, 278 PlacesBefore, 278 PlacesAfterwards, 7432 TransitionsBefore, 7432 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 295 PlacesBefore, 295 PlacesAfterwards, 7890 TransitionsBefore, 7890 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, 304 PlacesBefore, 304 PlacesAfterwards, 7978 TransitionsBefore, 7978 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, 321 PlacesBefore, 321 PlacesAfterwards, 8259 TransitionsBefore, 8259 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, 339 PlacesBefore, 339 PlacesAfterwards, 8250 TransitionsBefore, 8250 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, 361 PlacesBefore, 361 PlacesAfterwards, 8174 TransitionsBefore, 8174 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, 362 PlacesBefore, 362 PlacesAfterwards, 7494 TransitionsBefore, 7494 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, 343 PlacesBefore, 343 PlacesAfterwards, 5962 TransitionsBefore, 5962 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, 348 PlacesBefore, 348 PlacesAfterwards, 6839 TransitionsBefore, 6839 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, 339 PlacesBefore, 339 PlacesAfterwards, 5831 TransitionsBefore, 5831 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-8-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 270 locations, 4 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: 803.9s, OverallIterations: 28, TraceHistogramMax: 2, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 536.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 3969 SdHoareTripleChecker+Valid, 24.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3969 mSDsluCounter, 853 SdHoareTripleChecker+Invalid, 22.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1379 IncrementalHoareTripleChecker+Unchecked, 731 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18027 IncrementalHoareTripleChecker+Invalid, 19736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 122 mSDtfsCounter, 18027 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1294 GetRequests, 641 SyntacticMatches, 42 SemanticMatches, 611 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 5125 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392124occurred in iteration=23, InterpolantAutomatonStates: 382, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 1437 ConstructedInterpolants, 73 QuantifiedInterpolants, 51032 SizeOfPredicates, 367 NumberOfNonLiveVariables, 5300 ConjunctsInSsa, 705 ConjunctsInUnsatCore, 68 InterpolantComputations, 7 PerfectInterpolantSequences, 52/146 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