/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:38:30,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:38:30,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:38:30,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:38:30,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:38:30,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:38:30,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:38:30,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:38:30,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:38:30,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:38:30,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:38:30,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:38:30,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:38:30,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:38:30,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:38:30,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:38:30,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:38:30,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:38:30,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:38:30,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:38:30,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:38:30,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:38:30,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:38:30,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:38:30,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:38:30,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:38:30,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:38:30,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:38:30,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:38:30,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:38:30,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:38:30,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:38:30,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:38:30,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:38:30,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:38:30,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:38:30,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:38:30,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:38:30,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:38:30,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:38:30,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:38:30,626 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-05 22:38:30,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:38:30,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:38:30,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:38:30,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:38:30,651 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:38:30,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:38:30,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:38:30,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:38:30,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:38:30,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:38:30,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:38:30,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:38:30,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:38:30,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:38:30,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:38:30,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:38:30,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:30,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:38:30,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:38:30,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:38:30,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:38:30,655 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:38:30,655 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 [2022-12-05 22:38:30,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:38:30,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:38:30,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:38:30,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:38:30,968 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:38:30,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2022-12-05 22:38:31,876 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:38:32,104 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:38:32,104 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2022-12-05 22:38:32,117 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326e70dc8/fd5cac3489474a488c09efe5be504453/FLAG57233a78d [2022-12-05 22:38:32,126 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326e70dc8/fd5cac3489474a488c09efe5be504453 [2022-12-05 22:38:32,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:38:32,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:38:32,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:38:32,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:38:32,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e9b324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32, skipping insertion in model container [2022-12-05 22:38:32,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:38:32,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:38:32,410 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2022-12-05 22:38:32,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,438 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:38:32,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2022-12-05 22:38:32,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,514 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:38:32,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32 WrapperNode [2022-12-05 22:38:32,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:32,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:38:32,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:38:32,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,563 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-05 22:38:32,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:32,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:38:32,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:38:32,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:38:32,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,596 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:38:32,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:38:32,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:38:32,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:38:32,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:32,628 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-05 22:38:32,641 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-05 22:38:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:38:32,656 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:38:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:38:32,656 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:38:32,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:38:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:38:32,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:38:32,658 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:38:32,760 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:38:32,761 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:38:32,914 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:38:32,918 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:38:32,919 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 22:38:32,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:32 BoogieIcfgContainer [2022-12-05 22:38:32,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:38:32,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:38:32,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:38:32,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:38:32,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:38:32" (1/3) ... [2022-12-05 22:38:32,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280c4fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:32, skipping insertion in model container [2022-12-05 22:38:32,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32" (2/3) ... [2022-12-05 22:38:32,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280c4fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:32, skipping insertion in model container [2022-12-05 22:38:32,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:32" (3/3) ... [2022-12-05 22:38:32,926 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2022-12-05 22:38:32,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:38:32,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:38:32,938 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:38:32,984 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:38:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,073 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 22:38:33,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:33,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,144 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 22:38:33,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-05 22:38:35,992 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-05 22:38:36,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:38:36,007 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;@5b3f62af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:38:36,007 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:38:36,009 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-05 22:38:36,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:36,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-05 22:38:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:36,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574259526] [2022-12-05 22:38:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,266 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-05 22:38:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:36,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574259526] [2022-12-05 22:38:36,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574259526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:36,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:36,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:38:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026217941] [2022-12-05 22:38:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:36,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:36,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:36,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:36,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:36,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:36,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:36,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:36,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:36,345 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:36,345 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:38:36,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-05 22:38:36,347 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-05 22:38:36,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 22:38:36,355 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-05 22:38:36,357 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-05 22:38:36,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:36,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:36,360 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-05 22:38:36,364 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-05 22:38:36,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:36,364 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,366 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:36,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:36,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,382 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-05 22:38:36,382 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:36,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-05 22:38:36,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 22:38:36,383 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:36,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 22:38:36,387 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:36,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:38:36,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-05 22:38:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:36,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52255250] [2022-12-05 22:38:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:36,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:36,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52255250] [2022-12-05 22:38:36,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52255250] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:36,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534729635] [2022-12-05 22:38:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:36,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:36,480 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-05 22:38:36,516 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-05 22:38:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:36,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:36,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:36,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534729635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:36,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:36,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566591887] [2022-12-05 22:38:36,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:36,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:36,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:36,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:38:36,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:36,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:36,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:38:36,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:36,700 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:36,700 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:36,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:36,701 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:36,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:36,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-05 22:38:36,708 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:36,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:36,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:36,709 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:36,710 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:36,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:36,710 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,711 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:36,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:36,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,713 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:36,713 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:36,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:36,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:36,921 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:36,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-05 22:38:36,922 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:36,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:36,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,930 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-05 22:38:37,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-05 22:38:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031858] [2022-12-05 22:38:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772031858] [2022-12-05 22:38:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772031858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013400696] [2022-12-05 22:38:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:37,177 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-05 22:38:37,203 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-05 22:38:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:37,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:37,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:37,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013400696] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:37,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:37,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702593480] [2022-12-05 22:38:37,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:37,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:37,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:37,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:37,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:37,333 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:37,333 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:37,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-05 22:38:37,338 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:37,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:37,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:37,340 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:37,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:37,345 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:37,346 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:37,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:37,346 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,346 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:37,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:37,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,349 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:37,349 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:37,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:37,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:37,556 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:37,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-05 22:38:37,557 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:37,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:37,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-05 22:38:37,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-05 22:38:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712270311] [2022-12-05 22:38:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712270311] [2022-12-05 22:38:37,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712270311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751617653] [2022-12-05 22:38:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:37,792 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-05 22:38:37,794 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-05 22:38:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:37,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:37,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:37,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751617653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:37,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:37,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368347903] [2022-12-05 22:38:37,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:37,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:37,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:37,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:37,911 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:37,911 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:37,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-05 22:38:37,912 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:37,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:37,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:37,913 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:37,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:37,915 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:37,915 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:37,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:37,915 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,916 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:37,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:37,916 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,918 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:37,918 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:37,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:37,918 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,918 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:38,091 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:38,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-05 22:38:38,092 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:38,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,098 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-05 22:38:38,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149165, now seen corresponding path program 1 times [2022-12-05 22:38:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261216166] [2022-12-05 22:38:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:38,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261216166] [2022-12-05 22:38:38,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261216166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81658157] [2022-12-05 22:38:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,338 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-05 22:38:38,340 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-05 22:38:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:38,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81658157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985440667] [2022-12-05 22:38:38,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:38,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,440 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:38,440 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-05 22:38:38,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-05 22:38:38,441 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:38,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:38,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:38,443 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:38,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:38,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:38,444 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:38,445 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:38,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,445 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,445 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,447 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:38,448 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:38,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:38,585 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:38,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-05 22:38:38,586 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:38,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:38,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149103, now seen corresponding path program 1 times [2022-12-05 22:38:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250785190] [2022-12-05 22:38:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250785190] [2022-12-05 22:38:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250785190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282404437] [2022-12-05 22:38:38,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,823 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-05 22:38:38,825 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-05 22:38:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:38,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:38,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282404437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:38,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396518228] [2022-12-05 22:38:38,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:38,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:38,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,930 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:38,930 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:38,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 377 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:38,931 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:38,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:38,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:38,933 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:38,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:38,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:38,935 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:38,937 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:38,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,937 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,938 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,940 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:38,940 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:38,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:39,057 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:39,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-05 22:38:39,058 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:39,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:39,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:39,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:39,067 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-05 22:38:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:39,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149041, now seen corresponding path program 1 times [2022-12-05 22:38:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871047725] [2022-12-05 22:38:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871047725] [2022-12-05 22:38:39,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871047725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017106836] [2022-12-05 22:38:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:39,293 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-05 22:38:39,295 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-05 22:38:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:39,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:39,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:39,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017106836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:39,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:39,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934737139] [2022-12-05 22:38:39,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:39,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:39,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:39,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:39,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:39,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:39,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:39,393 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:39,393 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:39,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:39,394 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:39,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:39,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:39,395 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:39,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:39,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:39,396 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:39,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:39,396 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:39,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:39,396 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:39,397 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:39,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:39,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:39,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:39,399 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:39,399 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:39,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:39,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:39,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:39,528 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:39,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-05 22:38:39,529 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:39,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:39,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:39,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:39,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-05 22:38:39,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,733 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148979, now seen corresponding path program 1 times [2022-12-05 22:38:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395248338] [2022-12-05 22:38:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:39,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395248338] [2022-12-05 22:38:39,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395248338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:39,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143994893] [2022-12-05 22:38:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:39,840 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-05 22:38:39,842 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-05 22:38:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:38:39,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:39,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:40,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143994893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:40,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:40,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-05 22:38:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645706456] [2022-12-05 22:38:40,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:40,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:38:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:40,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:38:40,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:38:40,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:40,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:40,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:40,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:40,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:42,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:42,260 INFO L130 PetriNetUnfolder]: 265/405 cut-off events. [2022-12-05 22:38:42,260 INFO L131 PetriNetUnfolder]: For 379/379 co-relation queries the response was YES. [2022-12-05 22:38:42,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 405 events. 265/405 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1299 event pairs, 28 based on Foata normal form. 25/334 useless extension candidates. Maximal degree in co-relation 1095. Up to 167 conditions per place. [2022-12-05 22:38:42,262 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 46 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-05 22:38:42,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 65 transitions, 338 flow [2022-12-05 22:38:42,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:38:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:38:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-05 22:38:42,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 22:38:42,264 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 8 states and 68 transitions. [2022-12-05 22:38:42,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 65 transitions, 338 flow [2022-12-05 22:38:42,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 65 transitions, 294 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:42,265 INFO L231 Difference]: Finished difference. Result has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:42,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=27, PETRI_TRANSITIONS=33} [2022-12-05 22:38:42,266 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-05 22:38:42,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:42,266 INFO L89 Accepts]: Start accepts. Operand has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:42,266 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:42,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:42,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:42,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:42,270 INFO L130 PetriNetUnfolder]: 35/76 cut-off events. [2022-12-05 22:38:42,270 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-12-05 22:38:42,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 76 events. 35/76 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 210 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 175. Up to 41 conditions per place. [2022-12-05 22:38:42,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:42,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-05 22:38:42,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:42,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:42,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:42,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:42,605 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:42,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-05 22:38:42,606 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 32 transitions, 174 flow [2022-12-05 22:38:42,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:42,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:42,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:42,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:42,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:42,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148917, now seen corresponding path program 1 times [2022-12-05 22:38:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:42,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43104479] [2022-12-05 22:38:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43104479] [2022-12-05 22:38:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43104479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:42,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:42,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:38:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693130510] [2022-12-05 22:38:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:42,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:38:42,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 32 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:42,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:42,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:38:42,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:42,868 INFO L130 PetriNetUnfolder]: 170/268 cut-off events. [2022-12-05 22:38:42,868 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-05 22:38:42,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 268 events. 170/268 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 819 event pairs, 63 based on Foata normal form. 8/276 useless extension candidates. Maximal degree in co-relation 766. Up to 155 conditions per place. [2022-12-05 22:38:42,869 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 6 changer transitions 1/32 dead transitions. [2022-12-05 22:38:42,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 218 flow [2022-12-05 22:38:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 22:38:42,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-05 22:38:42,870 INFO L175 Difference]: Start difference. First operand has 26 places, 32 transitions, 174 flow. Second operand 3 states and 26 transitions. [2022-12-05 22:38:42,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 218 flow [2022-12-05 22:38:42,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 204 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:42,872 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 129 flow [2022-12-05 22:38:42,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-05 22:38:42,883 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 8 predicate places. [2022-12-05 22:38:42,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:42,883 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 129 flow [2022-12-05 22:38:42,883 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:42,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:42,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 129 flow [2022-12-05 22:38:42,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 129 flow [2022-12-05 22:38:42,888 INFO L130 PetriNetUnfolder]: 26/58 cut-off events. [2022-12-05 22:38:42,888 INFO L131 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2022-12-05 22:38:42,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 58 events. 26/58 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 134. Up to 33 conditions per place. [2022-12-05 22:38:42,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 129 flow [2022-12-05 22:38:42,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 22:38:42,890 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:42,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:38:42,891 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 129 flow [2022-12-05 22:38:42,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:42,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:42,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:42,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:38:42,891 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1106078484, now seen corresponding path program 1 times [2022-12-05 22:38:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:42,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499658047] [2022-12-05 22:38:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499658047] [2022-12-05 22:38:43,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499658047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582356892] [2022-12-05 22:38:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:43,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:43,035 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-05 22:38:43,036 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-05 22:38:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:43,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:43,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:43,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:43,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582356892] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:43,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:43,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:43,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471228612] [2022-12-05 22:38:43,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:43,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:43,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:43,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:43,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:38:43,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 129 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:43,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:43,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:38:43,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:45,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:47,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:49,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:50,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:53,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:54,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:54,859 INFO L130 PetriNetUnfolder]: 350/539 cut-off events. [2022-12-05 22:38:54,859 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2022-12-05 22:38:54,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 539 events. 350/539 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1934 event pairs, 25 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1556. Up to 219 conditions per place. [2022-12-05 22:38:54,862 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-05 22:38:54,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 101 transitions, 604 flow [2022-12-05 22:38:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:38:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:38:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-05 22:38:54,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-05 22:38:54,865 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 129 flow. Second operand 12 states and 100 transitions. [2022-12-05 22:38:54,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 101 transitions, 604 flow [2022-12-05 22:38:54,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 101 transitions, 576 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 22:38:54,868 INFO L231 Difference]: Finished difference. Result has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:54,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=37, PETRI_TRANSITIONS=55} [2022-12-05 22:38:54,869 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-05 22:38:54,869 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:54,869 INFO L89 Accepts]: Start accepts. Operand has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:54,870 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:54,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:54,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:54,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:54,880 INFO L130 PetriNetUnfolder]: 52/109 cut-off events. [2022-12-05 22:38:54,880 INFO L131 PetriNetUnfolder]: For 127/131 co-relation queries the response was YES. [2022-12-05 22:38:54,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 109 events. 52/109 cut-off events. For 127/131 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 348 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 339. Up to 72 conditions per place. [2022-12-05 22:38:54,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:54,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-05 22:38:54,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L705-6-->L687-5: Formula: (and (= (+ (* v_~prev~0_164 13) (* 21 v_~next~0_87) (* 21 v_~cur~0_135)) (* 34 v_~prev~0_163)) (= v_~cur~0_134 v_~next~0_87) (= (+ (* 34 v_~cur~0_135) (* 21 v_~prev~0_163) (* 21 v_~prev~0_164)) (* 13 v_~next~0_87)) (= v_~p~0_39 (+ v_~p~0_40 1)) (< v_~p~0_40 7) (= (+ v_~j~0_115 v_~i~0_102) v_~i~0_101) (< v_~x~0_149 17) (= (+ 16 v_~x~0_150) v_~x~0_149)) InVars {~j~0=v_~j~0_115, ~prev~0=v_~prev~0_164, ~i~0=v_~i~0_102, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_135, ~x~0=v_~x~0_150} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_93|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_87, ~prev~0=v_~prev~0_163, ~i~0=v_~i~0_101, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_134, ~x~0=v_~x~0_149} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14) (< v_~x~0_22 16)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-05 22:38:55,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14) (< v_~x~0_22 16)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-05 22:38:55,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [350] L705-6-->L687-5: Formula: (and (= v_~cur~0_152 v_~next~0_97) (= (+ v_~j~0_125 v_~i~0_110) v_~i~0_109) (= v_~p~0_43 (+ v_~p~0_44 1)) (< v_~x~0_167 17) (= (+ 16 v_~x~0_168) v_~x~0_167) (= (* 13 v_~next~0_97) (+ (* 34 v_~cur~0_153) (* 21 v_~prev~0_181) (* 21 v_~prev~0_182))) (= (+ (* v_~prev~0_182 13) (* 21 v_~next~0_97) (* 21 v_~cur~0_153)) (* 34 v_~prev~0_181)) (< v_~p~0_44 7)) InVars {~j~0=v_~j~0_125, ~prev~0=v_~prev~0_182, ~i~0=v_~i~0_110, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_153, ~x~0=v_~x~0_168} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_103|, ~j~0=v_~j~0_125, ~next~0=v_~next~0_97, ~prev~0=v_~prev~0_181, ~i~0=v_~i~0_109, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_30|, ~p~0=v_~p~0_43, ~cur~0=v_~cur~0_152, ~x~0=v_~x~0_167} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:38:55,226 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:55,227 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-05 22:38:55,227 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 55 transitions, 403 flow [2022-12-05 22:38:55,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:55,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:55,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:55,236 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-05 22:38:55,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-05 22:38:55,435 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1421156962, now seen corresponding path program 1 times [2022-12-05 22:38:55,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:55,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402369482] [2022-12-05 22:38:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:55,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:55,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402369482] [2022-12-05 22:38:55,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402369482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:55,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:55,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:38:55,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012460435] [2022-12-05 22:38:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:55,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:55,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:55,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:38:55,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 55 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:55,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:55,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:38:55,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:55,529 INFO L130 PetriNetUnfolder]: 285/446 cut-off events. [2022-12-05 22:38:55,529 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-05 22:38:55,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 446 events. 285/446 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1566 event pairs, 111 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1520. Up to 251 conditions per place. [2022-12-05 22:38:55,531 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-05 22:38:55,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 511 flow [2022-12-05 22:38:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 22:38:55,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 22:38:55,532 INFO L175 Difference]: Start difference. First operand has 37 places, 55 transitions, 403 flow. Second operand 3 states and 30 transitions. [2022-12-05 22:38:55,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 511 flow [2022-12-05 22:38:55,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 439 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:55,536 INFO L231 Difference]: Finished difference. Result has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:55,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=37, PETRI_TRANSITIONS=50} [2022-12-05 22:38:55,536 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-05 22:38:55,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:55,537 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:55,537 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:55,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:55,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:55,542 INFO L130 PetriNetUnfolder]: 43/92 cut-off events. [2022-12-05 22:38:55,542 INFO L131 PetriNetUnfolder]: For 142/151 co-relation queries the response was YES. [2022-12-05 22:38:55,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 43/92 cut-off events. For 142/151 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 279 event pairs, 0 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 258. Up to 45 conditions per place. [2022-12-05 22:38:55,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:55,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-05 22:38:55,546 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:55,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 22:38:55,547 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:55,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:55,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:55,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:55,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:38:55,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:55,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1105035954, now seen corresponding path program 1 times [2022-12-05 22:38:55,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:55,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984811298] [2022-12-05 22:38:55,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984811298] [2022-12-05 22:38:55,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984811298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:55,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361914918] [2022-12-05 22:38:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:55,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:55,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:55,661 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-05 22:38:55,663 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-05 22:38:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:55,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:38:55,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:55,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:56,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361914918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:56,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:56,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113729696] [2022-12-05 22:38:56,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:56,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:56,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:56,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:56,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:56,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:56,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 50 transitions, 321 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:56,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:56,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:56,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:57,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:38:58,203 INFO L130 PetriNetUnfolder]: 497/766 cut-off events. [2022-12-05 22:38:58,204 INFO L131 PetriNetUnfolder]: For 1304/1304 co-relation queries the response was YES. [2022-12-05 22:38:58,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 766 events. 497/766 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3088 event pairs, 28 based on Foata normal form. 20/772 useless extension candidates. Maximal degree in co-relation 2431. Up to 279 conditions per place. [2022-12-05 22:38:58,206 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 58 selfloop transitions, 65 changer transitions 0/123 dead transitions. [2022-12-05 22:38:58,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 850 flow [2022-12-05 22:38:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:38:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:38:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-05 22:38:58,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-05 22:38:58,207 INFO L175 Difference]: Start difference. First operand has 37 places, 50 transitions, 321 flow. Second operand 10 states and 96 transitions. [2022-12-05 22:38:58,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 850 flow [2022-12-05 22:38:58,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 123 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:58,212 INFO L231 Difference]: Finished difference. Result has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:58,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=635, PETRI_PLACES=47, PETRI_TRANSITIONS=79} [2022-12-05 22:38:58,213 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 29 predicate places. [2022-12-05 22:38:58,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:58,213 INFO L89 Accepts]: Start accepts. Operand has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:58,213 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:58,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:58,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:58,222 INFO L130 PetriNetUnfolder]: 77/160 cut-off events. [2022-12-05 22:38:58,222 INFO L131 PetriNetUnfolder]: For 390/399 co-relation queries the response was YES. [2022-12-05 22:38:58,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 160 events. 77/160 cut-off events. For 390/399 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 652 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 588. Up to 96 conditions per place. [2022-12-05 22:38:58,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:58,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-05 22:38:58,223 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:58,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 22:38:58,224 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:58,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:58,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:58,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-05 22:38:58,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:58,428 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1106192688, now seen corresponding path program 1 times [2022-12-05 22:38:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:58,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616980875] [2022-12-05 22:38:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:58,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616980875] [2022-12-05 22:38:58,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616980875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:58,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:58,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:38:58,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615958381] [2022-12-05 22:38:58,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:58,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:38:58,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:58,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:38:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:38:58,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:58,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 79 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:58,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:58,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:58,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:58,541 INFO L130 PetriNetUnfolder]: 382/627 cut-off events. [2022-12-05 22:38:58,541 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2022-12-05 22:38:58,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 627 events. 382/627 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2627 event pairs, 163 based on Foata normal form. 67/683 useless extension candidates. Maximal degree in co-relation 2205. Up to 359 conditions per place. [2022-12-05 22:38:58,544 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-05 22:38:58,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 703 flow [2022-12-05 22:38:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 22:38:58,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-05 22:38:58,545 INFO L175 Difference]: Start difference. First operand has 47 places, 79 transitions, 635 flow. Second operand 4 states and 29 transitions. [2022-12-05 22:38:58,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 703 flow [2022-12-05 22:38:58,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 665 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:58,550 INFO L231 Difference]: Finished difference. Result has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:58,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=45, PETRI_TRANSITIONS=63} [2022-12-05 22:38:58,551 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-05 22:38:58,551 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:58,551 INFO L89 Accepts]: Start accepts. Operand has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:58,551 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:58,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:58,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:58,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:58,558 INFO L130 PetriNetUnfolder]: 52/131 cut-off events. [2022-12-05 22:38:58,559 INFO L131 PetriNetUnfolder]: For 259/267 co-relation queries the response was YES. [2022-12-05 22:38:58,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 131 events. 52/131 cut-off events. For 259/267 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 566 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 427. Up to 53 conditions per place. [2022-12-05 22:38:58,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:58,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-05 22:38:58,560 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:58,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 22:38:58,561 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:58,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:58,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:58,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:58,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:38:58,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:38:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1429430494, now seen corresponding path program 1 times [2022-12-05 22:38:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:58,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119594702] [2022-12-05 22:38:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:58,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119594702] [2022-12-05 22:38:58,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119594702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537700778] [2022-12-05 22:38:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:58,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:58,646 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-05 22:38:58,648 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-05 22:38:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:58,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:58,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:58,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537700778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:58,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:58,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433549772] [2022-12-05 22:38:58,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:58,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:58,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:58,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:38:58,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 63 transitions, 509 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:58,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:58,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:38:58,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:00,506 INFO L130 PetriNetUnfolder]: 412/689 cut-off events. [2022-12-05 22:39:00,506 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2022-12-05 22:39:00,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 689 events. 412/689 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3055 event pairs, 39 based on Foata normal form. 26/701 useless extension candidates. Maximal degree in co-relation 2326. Up to 427 conditions per place. [2022-12-05 22:39:00,509 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 68 selfloop transitions, 42 changer transitions 0/110 dead transitions. [2022-12-05 22:39:00,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 883 flow [2022-12-05 22:39:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:39:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:39:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-05 22:39:00,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-05 22:39:00,510 INFO L175 Difference]: Start difference. First operand has 45 places, 63 transitions, 509 flow. Second operand 10 states and 74 transitions. [2022-12-05 22:39:00,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 883 flow [2022-12-05 22:39:00,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:39:00,518 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 717 flow [2022-12-05 22:39:00,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=56, PETRI_TRANSITIONS=77} [2022-12-05 22:39:00,518 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-05 22:39:00,518 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:00,518 INFO L89 Accepts]: Start accepts. Operand has 56 places, 77 transitions, 717 flow [2022-12-05 22:39:00,519 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:00,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:00,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-05 22:39:00,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 77 transitions, 717 flow [2022-12-05 22:39:00,527 INFO L130 PetriNetUnfolder]: 62/154 cut-off events. [2022-12-05 22:39:00,527 INFO L131 PetriNetUnfolder]: For 383/395 co-relation queries the response was YES. [2022-12-05 22:39:00,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 62/154 cut-off events. For 383/395 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 698 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 598. Up to 62 conditions per place. [2022-12-05 22:39:00,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-05 22:39:00,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-05 22:39:00,680 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:00,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-05 22:39:00,681 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 732 flow [2022-12-05 22:39:00,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:00,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:00,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:00,685 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-05 22:39:00,881 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-05 22:39:00,882 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 67913115, now seen corresponding path program 1 times [2022-12-05 22:39:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:00,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775062191] [2022-12-05 22:39:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:00,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775062191] [2022-12-05 22:39:00,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775062191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:00,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342896722] [2022-12-05 22:39:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:00,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:00,979 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-05 22:39:00,981 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-05 22:39:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:01,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:01,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:01,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:01,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342896722] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:01,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:01,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781255027] [2022-12-05 22:39:01,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:01,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:01,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:01,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:39:01,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 77 transitions, 732 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:01,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:01,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:39:01,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:03,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:04,430 INFO L130 PetriNetUnfolder]: 472/809 cut-off events. [2022-12-05 22:39:04,430 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2022-12-05 22:39:04,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 809 events. 472/809 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3824 event pairs, 35 based on Foata normal form. 40/838 useless extension candidates. Maximal degree in co-relation 3038. Up to 460 conditions per place. [2022-12-05 22:39:04,434 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 79 selfloop transitions, 58 changer transitions 0/137 dead transitions. [2022-12-05 22:39:04,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1256 flow [2022-12-05 22:39:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:39:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:39:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-05 22:39:04,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-05 22:39:04,434 INFO L175 Difference]: Start difference. First operand has 56 places, 77 transitions, 732 flow. Second operand 11 states and 82 transitions. [2022-12-05 22:39:04,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1256 flow [2022-12-05 22:39:04,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 1203 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:04,441 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 1061 flow [2022-12-05 22:39:04,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1061, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2022-12-05 22:39:04,441 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-05 22:39:04,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:04,441 INFO L89 Accepts]: Start accepts. Operand has 67 places, 101 transitions, 1061 flow [2022-12-05 22:39:04,442 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:04,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:04,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-05 22:39:04,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 1061 flow [2022-12-05 22:39:04,463 INFO L130 PetriNetUnfolder]: 76/197 cut-off events. [2022-12-05 22:39:04,464 INFO L131 PetriNetUnfolder]: For 724/736 co-relation queries the response was YES. [2022-12-05 22:39:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 76/197 cut-off events. For 724/736 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 974 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 866. Up to 82 conditions per place. [2022-12-05 22:39:04,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-05 22:39:04,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-05 22:39:04,499 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:04,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 22:39:04,499 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 1064 flow [2022-12-05 22:39:04,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:04,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:04,499 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:04,505 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-05 22:39:04,705 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-05 22:39:04,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1362345130, now seen corresponding path program 1 times [2022-12-05 22:39:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025810293] [2022-12-05 22:39:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:04,827 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-05 22:39:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025810293] [2022-12-05 22:39:04,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025810293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223671744] [2022-12-05 22:39:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:04,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:04,829 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-05 22:39:04,831 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-05 22:39:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:04,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:04,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:04,967 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-05 22:39:04,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:05,135 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-05 22:39:05,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223671744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:05,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:05,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122572662] [2022-12-05 22:39:05,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:05,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:05,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:39:05,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 1064 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:05,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:05,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:39:05,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:06,940 INFO L130 PetriNetUnfolder]: 512/889 cut-off events. [2022-12-05 22:39:06,940 INFO L131 PetriNetUnfolder]: For 4892/4892 co-relation queries the response was YES. [2022-12-05 22:39:06,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 889 events. 512/889 cut-off events. For 4892/4892 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4386 event pairs, 46 based on Foata normal form. 24/902 useless extension candidates. Maximal degree in co-relation 3656. Up to 544 conditions per place. [2022-12-05 22:39:06,945 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 91 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2022-12-05 22:39:06,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1586 flow [2022-12-05 22:39:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:39:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:39:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-05 22:39:06,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-05 22:39:06,946 INFO L175 Difference]: Start difference. First operand has 67 places, 101 transitions, 1064 flow. Second operand 11 states and 83 transitions. [2022-12-05 22:39:06,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1586 flow [2022-12-05 22:39:06,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 1547 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:06,963 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 1366 flow [2022-12-05 22:39:06,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=78, PETRI_TRANSITIONS=117} [2022-12-05 22:39:06,964 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2022-12-05 22:39:06,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:06,964 INFO L89 Accepts]: Start accepts. Operand has 78 places, 117 transitions, 1366 flow [2022-12-05 22:39:06,964 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:06,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:06,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-05 22:39:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 117 transitions, 1366 flow [2022-12-05 22:39:06,978 INFO L130 PetriNetUnfolder]: 86/226 cut-off events. [2022-12-05 22:39:06,978 INFO L131 PetriNetUnfolder]: For 1141/1153 co-relation queries the response was YES. [2022-12-05 22:39:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 226 events. 86/226 cut-off events. For 1141/1153 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1167 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1100. Up to 102 conditions per place. [2022-12-05 22:39:06,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-05 22:39:06,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-05 22:39:07,089 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:07,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-05 22:39:07,090 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 1375 flow [2022-12-05 22:39:07,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:07,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:07,090 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:07,095 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-05 22:39:07,291 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-05 22:39:07,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 549141087, now seen corresponding path program 1 times [2022-12-05 22:39:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:07,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426197568] [2022-12-05 22:39:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:07,384 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-05 22:39:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426197568] [2022-12-05 22:39:07,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426197568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320899154] [2022-12-05 22:39:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:07,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:07,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:07,386 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-05 22:39:07,387 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-05 22:39:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:07,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:07,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:07,534 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-05 22:39:07,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:07,768 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-05 22:39:07,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320899154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:07,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:07,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:07,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754206678] [2022-12-05 22:39:07,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:07,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:07,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:39:07,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 117 transitions, 1375 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:07,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:07,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:39:07,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:17,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:24,896 INFO L130 PetriNetUnfolder]: 532/933 cut-off events. [2022-12-05 22:39:24,896 INFO L131 PetriNetUnfolder]: For 5426/5426 co-relation queries the response was YES. [2022-12-05 22:39:24,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 933 events. 532/933 cut-off events. For 5426/5426 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4744 event pairs, 35 based on Foata normal form. 12/934 useless extension candidates. Maximal degree in co-relation 4128. Up to 468 conditions per place. [2022-12-05 22:39:24,901 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 101 selfloop transitions, 88 changer transitions 2/191 dead transitions. [2022-12-05 22:39:24,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2063 flow [2022-12-05 22:39:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:39:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:39:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-05 22:39:24,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2669683257918552 [2022-12-05 22:39:24,902 INFO L175 Difference]: Start difference. First operand has 78 places, 117 transitions, 1375 flow. Second operand 17 states and 118 transitions. [2022-12-05 22:39:24,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2063 flow [2022-12-05 22:39:24,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 2003 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:24,918 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:24,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1764, PETRI_PLACES=93, PETRI_TRANSITIONS=133} [2022-12-05 22:39:24,919 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-05 22:39:24,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:24,919 INFO L89 Accepts]: Start accepts. Operand has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:24,921 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:24,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:24,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:24,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:24,935 INFO L130 PetriNetUnfolder]: 91/244 cut-off events. [2022-12-05 22:39:24,936 INFO L131 PetriNetUnfolder]: For 1386/1394 co-relation queries the response was YES. [2022-12-05 22:39:24,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 244 events. 91/244 cut-off events. For 1386/1394 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1346 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1314. Up to 112 conditions per place. [2022-12-05 22:39:24,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:24,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-05 22:39:25,313 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:39:25,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 395 [2022-12-05 22:39:25,314 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1799 flow [2022-12-05 22:39:25,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:25,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:25,314 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:25,325 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-05 22:39:25,514 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-05 22:39:25,515 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2103423086, now seen corresponding path program 1 times [2022-12-05 22:39:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:25,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157654259] [2022-12-05 22:39:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:25,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157654259] [2022-12-05 22:39:25,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157654259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:25,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36043782] [2022-12-05 22:39:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:25,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:25,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:25,649 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-05 22:39:25,651 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-05 22:39:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:25,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:25,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:25,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:26,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36043782] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:26,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:26,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188550455] [2022-12-05 22:39:26,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:26,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:26,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:26,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 22:39:26,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 133 transitions, 1799 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:26,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:26,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 22:39:26,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:29,573 INFO L130 PetriNetUnfolder]: 766/1357 cut-off events. [2022-12-05 22:39:29,574 INFO L131 PetriNetUnfolder]: For 17964/17964 co-relation queries the response was YES. [2022-12-05 22:39:29,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1357 events. 766/1357 cut-off events. For 17964/17964 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7579 event pairs, 45 based on Foata normal form. 54/1400 useless extension candidates. Maximal degree in co-relation 6410. Up to 427 conditions per place. [2022-12-05 22:39:29,581 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 111 selfloop transitions, 163 changer transitions 0/274 dead transitions. [2022-12-05 22:39:29,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 274 transitions, 3397 flow [2022-12-05 22:39:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-05 22:39:29,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-05 22:39:29,582 INFO L175 Difference]: Start difference. First operand has 93 places, 133 transitions, 1799 flow. Second operand 18 states and 144 transitions. [2022-12-05 22:39:29,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 274 transitions, 3397 flow [2022-12-05 22:39:29,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 274 transitions, 3265 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-05 22:39:29,608 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:29,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=109, PETRI_TRANSITIONS=205} [2022-12-05 22:39:29,608 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 91 predicate places. [2022-12-05 22:39:29,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:29,609 INFO L89 Accepts]: Start accepts. Operand has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:29,610 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:29,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:29,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:29,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:29,634 INFO L130 PetriNetUnfolder]: 133/352 cut-off events. [2022-12-05 22:39:29,634 INFO L131 PetriNetUnfolder]: For 2797/2809 co-relation queries the response was YES. [2022-12-05 22:39:29,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 352 events. 133/352 cut-off events. For 2797/2809 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2083 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 2172. Up to 183 conditions per place. [2022-12-05 22:39:29,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:29,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-05 22:39:29,673 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:29,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 22:39:29,675 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 3056 flow [2022-12-05 22:39:29,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:29,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:29,676 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:29,686 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-05 22:39:29,879 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-05 22:39:29,880 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1363953844, now seen corresponding path program 1 times [2022-12-05 22:39:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403614384] [2022-12-05 22:39:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:30,005 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-05 22:39:30,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:30,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403614384] [2022-12-05 22:39:30,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403614384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:30,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062157047] [2022-12-05 22:39:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:30,007 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-05 22:39:30,009 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-05 22:39:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:30,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:30,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:30,132 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-05 22:39:30,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:30,324 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-05 22:39:30,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062157047] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:30,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:30,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956309579] [2022-12-05 22:39:30,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:30,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:30,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 22:39:30,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 205 transitions, 3056 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:30,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:30,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 22:39:30,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:35,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:37,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:41,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:42,295 INFO L130 PetriNetUnfolder]: 868/1533 cut-off events. [2022-12-05 22:39:42,296 INFO L131 PetriNetUnfolder]: For 18338/18338 co-relation queries the response was YES. [2022-12-05 22:39:42,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 1533 events. 868/1533 cut-off events. For 18338/18338 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8847 event pairs, 95 based on Foata normal form. 22/1536 useless extension candidates. Maximal degree in co-relation 8047. Up to 1000 conditions per place. [2022-12-05 22:39:42,304 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 176 selfloop transitions, 104 changer transitions 2/282 dead transitions. [2022-12-05 22:39:42,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 282 transitions, 4120 flow [2022-12-05 22:39:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-05 22:39:42,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465437788018433 [2022-12-05 22:39:42,306 INFO L175 Difference]: Start difference. First operand has 109 places, 205 transitions, 3056 flow. Second operand 14 states and 107 transitions. [2022-12-05 22:39:42,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 282 transitions, 4120 flow [2022-12-05 22:39:42,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3891 flow, removed 92 selfloop flow, removed 6 redundant places. [2022-12-05 22:39:42,354 INFO L231 Difference]: Finished difference. Result has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:42,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3569, PETRI_PLACES=121, PETRI_TRANSITIONS=234} [2022-12-05 22:39:42,355 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 103 predicate places. [2022-12-05 22:39:42,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:42,355 INFO L89 Accepts]: Start accepts. Operand has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:42,356 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:42,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:42,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:42,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:42,383 INFO L130 PetriNetUnfolder]: 153/401 cut-off events. [2022-12-05 22:39:42,383 INFO L131 PetriNetUnfolder]: For 2852/2864 co-relation queries the response was YES. [2022-12-05 22:39:42,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 401 events. 153/401 cut-off events. For 2852/2864 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2534 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 2526. Up to 187 conditions per place. [2022-12-05 22:39:42,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:42,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-05 22:39:42,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [349] L705-6-->L695-5: Formula: (and (= v_~q~0_59 (+ v_~q~0_60 1)) (= v_~j~0_121 (+ v_~j~0_122 v_~i~0_107)) (< v_~x~0_163 17) (= (+ (* 21 v_~prev~0_178) (* 21 v_~prev~0_177) (* 34 v_~cur~0_149)) (* 13 v_~next~0_95)) (= (* 34 v_~prev~0_177) (+ (* 21 v_~cur~0_149) (* v_~prev~0_178 13) (* 21 v_~next~0_95))) (= v_~cur~0_148 v_~next~0_95) (< v_~q~0_60 7) (= (+ 16 v_~x~0_164) v_~x~0_163)) InVars {~j~0=v_~j~0_122, ~prev~0=v_~prev~0_178, ~i~0=v_~i~0_107, ~q~0=v_~q~0_60, ~cur~0=v_~cur~0_149, ~x~0=v_~x~0_164} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_101|, ~j~0=v_~j~0_121, ~next~0=v_~next~0_95, ~prev~0=v_~prev~0_177, ~i~0=v_~i~0_107, ~q~0=v_~q~0_59, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_40|, ~cur~0=v_~cur~0_148, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:39:42,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [365] L705-6-->L695-5: Formula: (and (= (+ (* 21 v_~prev~0_230) (* 21 v_~prev~0_229) (* 34 v_~cur~0_195)) (* v_~next~0_123 13)) (= (+ (* v_~prev~0_230 13) (* 21 v_~next~0_123) (* 21 v_~cur~0_195)) (* 34 v_~prev~0_229)) (= (+ 2 v_~q~0_110) v_~q~0_108) (= v_~j~0_189 (+ v_~j~0_191 (* 2 v_~i~0_179))) (< v_~x~0_215 17) (< v_~q~0_110 6) (= v_~next~0_123 v_~cur~0_194) (= (+ 16 v_~x~0_216) v_~x~0_215)) InVars {~j~0=v_~j~0_191, ~prev~0=v_~prev~0_230, ~i~0=v_~i~0_179, ~q~0=v_~q~0_110, ~cur~0=v_~cur~0_195, ~x~0=v_~x~0_216} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_135|, ~j~0=v_~j~0_189, ~next~0=v_~next~0_123, ~prev~0=v_~prev~0_229, ~i~0=v_~i~0_179, ~q~0=v_~q~0_108, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_78|, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_215} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:39:42,613 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:42,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-05 22:39:42,614 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 234 transitions, 3562 flow [2022-12-05 22:39:42,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:42,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:42,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:42,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:42,815 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-05 22:39:42,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2104860525, now seen corresponding path program 1 times [2022-12-05 22:39:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:42,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274633667] [2022-12-05 22:39:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274633667] [2022-12-05 22:39:42,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274633667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:42,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959701745] [2022-12-05 22:39:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:42,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:42,932 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-05 22:39:42,933 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-05 22:39:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:42,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:42,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:43,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:43,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959701745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:43,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:43,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624710579] [2022-12-05 22:39:43,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:43,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:43,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 22:39:43,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 234 transitions, 3562 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:43,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:43,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 22:39:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:45,194 INFO L130 PetriNetUnfolder]: 1116/1949 cut-off events. [2022-12-05 22:39:45,194 INFO L131 PetriNetUnfolder]: For 24986/24986 co-relation queries the response was YES. [2022-12-05 22:39:45,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 1949 events. 1116/1949 cut-off events. For 24986/24986 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 11513 event pairs, 39 based on Foata normal form. 26/1953 useless extension candidates. Maximal degree in co-relation 10634. Up to 566 conditions per place. [2022-12-05 22:39:45,207 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 99 selfloop transitions, 253 changer transitions 0/352 dead transitions. [2022-12-05 22:39:45,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 352 transitions, 5256 flow [2022-12-05 22:39:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:39:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:39:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-05 22:39:45,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-05 22:39:45,208 INFO L175 Difference]: Start difference. First operand has 121 places, 234 transitions, 3562 flow. Second operand 15 states and 141 transitions. [2022-12-05 22:39:45,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 352 transitions, 5256 flow [2022-12-05 22:39:45,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 352 transitions, 5174 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:45,273 INFO L231 Difference]: Finished difference. Result has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:45,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3484, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5003, PETRI_PLACES=136, PETRI_TRANSITIONS=281} [2022-12-05 22:39:45,273 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 118 predicate places. [2022-12-05 22:39:45,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:45,273 INFO L89 Accepts]: Start accepts. Operand has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:45,274 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:45,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:45,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:45,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:45,312 INFO L130 PetriNetUnfolder]: 184/484 cut-off events. [2022-12-05 22:39:45,312 INFO L131 PetriNetUnfolder]: For 5335/5351 co-relation queries the response was YES. [2022-12-05 22:39:45,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 484 events. 184/484 cut-off events. For 5335/5351 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3161 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3580. Up to 229 conditions per place. [2022-12-05 22:39:45,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:45,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-05 22:39:45,349 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:45,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-05 22:39:45,349 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 281 transitions, 5007 flow [2022-12-05 22:39:45,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:45,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:45,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:45,355 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-05 22:39:45,550 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-05 22:39:45,550 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1361857903, now seen corresponding path program 1 times [2022-12-05 22:39:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:45,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651441752] [2022-12-05 22:39:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:45,646 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-05 22:39:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:45,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651441752] [2022-12-05 22:39:45,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651441752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:45,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943023990] [2022-12-05 22:39:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:45,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:45,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:45,661 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-05 22:39:45,662 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-05 22:39:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:45,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:39:45,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:45,803 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-05 22:39:45,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:45,985 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-05 22:39:45,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943023990] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:45,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:45,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668978865] [2022-12-05 22:39:45,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:45,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:45,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:45,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 281 transitions, 5007 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:45,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:45,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:45,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:48,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:50,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:51,297 INFO L130 PetriNetUnfolder]: 1266/2207 cut-off events. [2022-12-05 22:39:51,297 INFO L131 PetriNetUnfolder]: For 39428/39428 co-relation queries the response was YES. [2022-12-05 22:39:51,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13568 conditions, 2207 events. 1266/2207 cut-off events. For 39428/39428 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 13460 event pairs, 135 based on Foata normal form. 30/2215 useless extension candidates. Maximal degree in co-relation 13511. Up to 1395 conditions per place. [2022-12-05 22:39:51,312 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 214 selfloop transitions, 154 changer transitions 0/368 dead transitions. [2022-12-05 22:39:51,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 368 transitions, 6552 flow [2022-12-05 22:39:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-05 22:39:51,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23877551020408164 [2022-12-05 22:39:51,313 INFO L175 Difference]: Start difference. First operand has 136 places, 281 transitions, 5007 flow. Second operand 14 states and 117 transitions. [2022-12-05 22:39:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 368 transitions, 6552 flow [2022-12-05 22:39:51,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 368 transitions, 6292 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-12-05 22:39:51,444 INFO L231 Difference]: Finished difference. Result has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:51,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4775, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5968, PETRI_PLACES=152, PETRI_TRANSITIONS=319} [2022-12-05 22:39:51,445 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-05 22:39:51,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:51,445 INFO L89 Accepts]: Start accepts. Operand has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:51,446 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:51,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:51,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:51,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:51,490 INFO L130 PetriNetUnfolder]: 204/533 cut-off events. [2022-12-05 22:39:51,490 INFO L131 PetriNetUnfolder]: For 7204/7220 co-relation queries the response was YES. [2022-12-05 22:39:51,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 533 events. 204/533 cut-off events. For 7204/7220 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3629 event pairs, 0 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 4182. Up to 247 conditions per place. [2022-12-05 22:39:51,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:51,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-05 22:39:51,496 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:51,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-05 22:39:51,497 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:51,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:51,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:51,497 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:51,503 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-05 22:39:51,703 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-05 22:39:51,703 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash 550484565, now seen corresponding path program 1 times [2022-12-05 22:39:51,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632343444] [2022-12-05 22:39:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:51,810 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-05 22:39:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:51,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632343444] [2022-12-05 22:39:51,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632343444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:51,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772858290] [2022-12-05 22:39:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:51,811 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-05 22:39:51,813 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-05 22:39:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:51,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:51,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:51,947 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-05 22:39:51,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:52,135 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-05 22:39:52,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772858290] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:52,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:52,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879712137] [2022-12-05 22:39:52,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:52,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:52,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:52,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:52,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 319 transitions, 5968 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:52,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:52,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:52,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:54,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:56,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:39:56,916 INFO L130 PetriNetUnfolder]: 1318/2311 cut-off events. [2022-12-05 22:39:56,916 INFO L131 PetriNetUnfolder]: For 47860/47860 co-relation queries the response was YES. [2022-12-05 22:39:56,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14893 conditions, 2311 events. 1318/2311 cut-off events. For 47860/47860 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 14248 event pairs, 169 based on Foata normal form. 28/2320 useless extension candidates. Maximal degree in co-relation 14829. Up to 1570 conditions per place. [2022-12-05 22:39:56,929 INFO L137 encePairwiseOnDemand]: 9/35 looper letters, 224 selfloop transitions, 160 changer transitions 2/386 dead transitions. [2022-12-05 22:39:56,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 386 transitions, 7310 flow [2022-12-05 22:39:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:39:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:39:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-05 22:39:56,930 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22197802197802197 [2022-12-05 22:39:56,930 INFO L175 Difference]: Start difference. First operand has 152 places, 319 transitions, 5968 flow. Second operand 13 states and 101 transitions. [2022-12-05 22:39:56,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 386 transitions, 7310 flow [2022-12-05 22:39:57,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 386 transitions, 7184 flow, removed 54 selfloop flow, removed 2 redundant places. [2022-12-05 22:39:57,066 INFO L231 Difference]: Finished difference. Result has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:57,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5842, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6868, PETRI_PLACES=166, PETRI_TRANSITIONS=345} [2022-12-05 22:39:57,066 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 148 predicate places. [2022-12-05 22:39:57,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:57,066 INFO L89 Accepts]: Start accepts. Operand has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:57,068 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:57,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:57,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:57,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:57,123 INFO L130 PetriNetUnfolder]: 216/570 cut-off events. [2022-12-05 22:39:57,123 INFO L131 PetriNetUnfolder]: For 8910/8930 co-relation queries the response was YES. [2022-12-05 22:39:57,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 570 events. 216/570 cut-off events. For 8910/8930 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3862 event pairs, 0 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 4687. Up to 258 conditions per place. [2022-12-05 22:39:57,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:57,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-05 22:39:57,129 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:57,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-05 22:39:57,130 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:57,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:57,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:57,130 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:57,134 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-05 22:39:57,334 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-05 22:39:57,334 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:39:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 730827570, now seen corresponding path program 2 times [2022-12-05 22:39:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:57,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804870939] [2022-12-05 22:39:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804870939] [2022-12-05 22:39:57,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804870939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770282881] [2022-12-05 22:39:57,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:39:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:57,437 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-05 22:39:57,439 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-05 22:39:57,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:39:57,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:39:57,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:39:57,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:57,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:57,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770282881] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:57,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:57,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815291674] [2022-12-05 22:39:57,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:57,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:57,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:57,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:57,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 345 transitions, 6868 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:57,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:57,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:57,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:59,592 INFO L130 PetriNetUnfolder]: 1548/2695 cut-off events. [2022-12-05 22:39:59,592 INFO L131 PetriNetUnfolder]: For 60368/60368 co-relation queries the response was YES. [2022-12-05 22:39:59,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 2695 events. 1548/2695 cut-off events. For 60368/60368 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 17074 event pairs, 130 based on Foata normal form. 18/2694 useless extension candidates. Maximal degree in co-relation 18135. Up to 1299 conditions per place. [2022-12-05 22:39:59,607 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 223 selfloop transitions, 231 changer transitions 0/454 dead transitions. [2022-12-05 22:39:59,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 454 transitions, 9007 flow [2022-12-05 22:39:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:39:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:39:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-12-05 22:39:59,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25142857142857145 [2022-12-05 22:39:59,609 INFO L175 Difference]: Start difference. First operand has 166 places, 345 transitions, 6868 flow. Second operand 15 states and 132 transitions. [2022-12-05 22:39:59,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 454 transitions, 9007 flow [2022-12-05 22:39:59,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 454 transitions, 8820 flow, removed 64 selfloop flow, removed 5 redundant places. [2022-12-05 22:39:59,812 INFO L231 Difference]: Finished difference. Result has 180 places, 393 transitions, 8343 flow [2022-12-05 22:39:59,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6707, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8343, PETRI_PLACES=180, PETRI_TRANSITIONS=393} [2022-12-05 22:39:59,813 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 162 predicate places. [2022-12-05 22:39:59,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:59,813 INFO L89 Accepts]: Start accepts. Operand has 180 places, 393 transitions, 8343 flow [2022-12-05 22:39:59,814 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:59,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:59,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 393 transitions, 8343 flow [2022-12-05 22:39:59,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 393 transitions, 8343 flow [2022-12-05 22:39:59,881 INFO L130 PetriNetUnfolder]: 256/671 cut-off events. [2022-12-05 22:39:59,882 INFO L131 PetriNetUnfolder]: For 13099/13119 co-relation queries the response was YES. [2022-12-05 22:39:59,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6051 conditions, 671 events. 256/671 cut-off events. For 13099/13119 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 4777 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 5981. Up to 323 conditions per place. [2022-12-05 22:39:59,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 393 transitions, 8343 flow [2022-12-05 22:39:59,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-05 22:39:59,965 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:59,966 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-05 22:39:59,966 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 393 transitions, 8363 flow [2022-12-05 22:39:59,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:59,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:59,966 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:59,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-05 22:40:00,169 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-05 22:40:00,170 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 724361621, now seen corresponding path program 1 times [2022-12-05 22:40:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:00,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733284583] [2022-12-05 22:40:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:00,200 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-05 22:40:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:00,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733284583] [2022-12-05 22:40:00,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733284583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:00,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:40:00,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:40:00,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352858961] [2022-12-05 22:40:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:00,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:40:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:00,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:40:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:40:00,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:40:00,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 393 transitions, 8363 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:00,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:00,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:40:00,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:00,638 INFO L130 PetriNetUnfolder]: 1552/2695 cut-off events. [2022-12-05 22:40:00,638 INFO L131 PetriNetUnfolder]: For 71527/71527 co-relation queries the response was YES. [2022-12-05 22:40:00,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20282 conditions, 2695 events. 1552/2695 cut-off events. For 71527/71527 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 17346 event pairs, 259 based on Foata normal form. 123/2810 useless extension candidates. Maximal degree in co-relation 20209. Up to 1096 conditions per place. [2022-12-05 22:40:00,656 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 553 selfloop transitions, 55 changer transitions 1/609 dead transitions. [2022-12-05 22:40:00,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 609 transitions, 14224 flow [2022-12-05 22:40:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:40:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:40:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-05 22:40:00,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32972972972972975 [2022-12-05 22:40:00,658 INFO L175 Difference]: Start difference. First operand has 180 places, 393 transitions, 8363 flow. Second operand 5 states and 61 transitions. [2022-12-05 22:40:00,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 609 transitions, 14224 flow [2022-12-05 22:40:00,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 609 transitions, 13966 flow, removed 93 selfloop flow, removed 5 redundant places. [2022-12-05 22:40:00,894 INFO L231 Difference]: Finished difference. Result has 182 places, 407 transitions, 8638 flow [2022-12-05 22:40:00,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8161, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8638, PETRI_PLACES=182, PETRI_TRANSITIONS=407} [2022-12-05 22:40:00,895 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 164 predicate places. [2022-12-05 22:40:00,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:00,895 INFO L89 Accepts]: Start accepts. Operand has 182 places, 407 transitions, 8638 flow [2022-12-05 22:40:00,896 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:00,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:00,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 407 transitions, 8638 flow [2022-12-05 22:40:00,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 407 transitions, 8638 flow [2022-12-05 22:40:00,967 INFO L130 PetriNetUnfolder]: 259/690 cut-off events. [2022-12-05 22:40:00,967 INFO L131 PetriNetUnfolder]: For 14959/14982 co-relation queries the response was YES. [2022-12-05 22:40:00,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 690 events. 259/690 cut-off events. For 14959/14982 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 4966 event pairs, 0 based on Foata normal form. 3/690 useless extension candidates. Maximal degree in co-relation 6305. Up to 326 conditions per place. [2022-12-05 22:40:00,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 407 transitions, 8638 flow [2022-12-05 22:40:00,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-05 22:40:01,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:40:01,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-05 22:40:01,135 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 407 transitions, 8668 flow [2022-12-05 22:40:01,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:01,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:01,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:01,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-05 22:40:01,136 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 733071164, now seen corresponding path program 1 times [2022-12-05 22:40:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:01,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816985958] [2022-12-05 22:40:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:01,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816985958] [2022-12-05 22:40:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816985958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:01,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341281118] [2022-12-05 22:40:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:01,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:01,257 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-05 22:40:01,259 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-05 22:40:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:01,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:40:01,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:01,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:01,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341281118] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:01,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:01,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:01,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798469317] [2022-12-05 22:40:01,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:01,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:01,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:01,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:40:01,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 407 transitions, 8668 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:01,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:01,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:40:01,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:04,533 INFO L130 PetriNetUnfolder]: 1778/3101 cut-off events. [2022-12-05 22:40:04,533 INFO L131 PetriNetUnfolder]: For 129434/129434 co-relation queries the response was YES. [2022-12-05 22:40:04,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24067 conditions, 3101 events. 1778/3101 cut-off events. For 129434/129434 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 20059 event pairs, 174 based on Foata normal form. 70/3157 useless extension candidates. Maximal degree in co-relation 23992. Up to 1699 conditions per place. [2022-12-05 22:40:04,557 INFO L137 encePairwiseOnDemand]: 10/39 looper letters, 266 selfloop transitions, 273 changer transitions 0/539 dead transitions. [2022-12-05 22:40:04,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 539 transitions, 11618 flow [2022-12-05 22:40:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:40:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:40:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 146 transitions. [2022-12-05 22:40:04,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20797720797720798 [2022-12-05 22:40:04,559 INFO L175 Difference]: Start difference. First operand has 182 places, 407 transitions, 8668 flow. Second operand 18 states and 146 transitions. [2022-12-05 22:40:04,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 539 transitions, 11618 flow [2022-12-05 22:40:04,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 539 transitions, 11594 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-05 22:40:04,875 INFO L231 Difference]: Finished difference. Result has 206 places, 474 transitions, 11002 flow [2022-12-05 22:40:04,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=8644, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11002, PETRI_PLACES=206, PETRI_TRANSITIONS=474} [2022-12-05 22:40:04,876 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 188 predicate places. [2022-12-05 22:40:04,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:04,876 INFO L89 Accepts]: Start accepts. Operand has 206 places, 474 transitions, 11002 flow [2022-12-05 22:40:04,878 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:04,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:04,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 474 transitions, 11002 flow [2022-12-05 22:40:04,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 474 transitions, 11002 flow [2022-12-05 22:40:04,989 INFO L130 PetriNetUnfolder]: 290/784 cut-off events. [2022-12-05 22:40:04,990 INFO L131 PetriNetUnfolder]: For 23357/23382 co-relation queries the response was YES. [2022-12-05 22:40:04,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7905 conditions, 784 events. 290/784 cut-off events. For 23357/23382 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 5810 event pairs, 0 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 7824. Up to 386 conditions per place. [2022-12-05 22:40:04,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 474 transitions, 11002 flow [2022-12-05 22:40:04,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 1434 [2022-12-05 22:40:05,001 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:40:05,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-05 22:40:05,001 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 474 transitions, 11002 flow [2022-12-05 22:40:05,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:05,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:05,001 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:05,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-05 22:40:05,205 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-05 22:40:05,205 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 731928535, now seen corresponding path program 1 times [2022-12-05 22:40:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:05,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544580982] [2022-12-05 22:40:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:05,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544580982] [2022-12-05 22:40:05,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544580982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:05,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169846434] [2022-12-05 22:40:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:05,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:05,344 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-05 22:40:05,345 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-05 22:40:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:05,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:40:05,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:05,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169846434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:05,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255244219] [2022-12-05 22:40:05,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:05,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:05,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:40:05,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 474 transitions, 11002 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:05,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:05,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:40:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:10,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:12,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:14,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:16,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:17,430 INFO L130 PetriNetUnfolder]: 1822/3193 cut-off events. [2022-12-05 22:40:17,430 INFO L131 PetriNetUnfolder]: For 138816/138816 co-relation queries the response was YES. [2022-12-05 22:40:17,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26312 conditions, 3193 events. 1822/3193 cut-off events. For 138816/138816 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 20823 event pairs, 301 based on Foata normal form. 38/3217 useless extension candidates. Maximal degree in co-relation 26228. Up to 2513 conditions per place. [2022-12-05 22:40:17,450 INFO L137 encePairwiseOnDemand]: 10/39 looper letters, 382 selfloop transitions, 159 changer transitions 3/544 dead transitions. [2022-12-05 22:40:17,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 544 transitions, 12716 flow [2022-12-05 22:40:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 22:40:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 22:40:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-05 22:40:17,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1891025641025641 [2022-12-05 22:40:17,452 INFO L175 Difference]: Start difference. First operand has 206 places, 474 transitions, 11002 flow. Second operand 16 states and 118 transitions. [2022-12-05 22:40:17,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 544 transitions, 12716 flow [2022-12-05 22:40:17,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 544 transitions, 12248 flow, removed 216 selfloop flow, removed 3 redundant places. [2022-12-05 22:40:17,923 INFO L231 Difference]: Finished difference. Result has 223 places, 493 transitions, 11558 flow [2022-12-05 22:40:17,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10534, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11558, PETRI_PLACES=223, PETRI_TRANSITIONS=493} [2022-12-05 22:40:17,923 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 205 predicate places. [2022-12-05 22:40:17,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:17,923 INFO L89 Accepts]: Start accepts. Operand has 223 places, 493 transitions, 11558 flow [2022-12-05 22:40:17,925 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:17,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:17,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 493 transitions, 11558 flow [2022-12-05 22:40:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 493 transitions, 11558 flow [2022-12-05 22:40:18,035 INFO L130 PetriNetUnfolder]: 307/829 cut-off events. [2022-12-05 22:40:18,035 INFO L131 PetriNetUnfolder]: For 27965/27994 co-relation queries the response was YES. [2022-12-05 22:40:18,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8475 conditions, 829 events. 307/829 cut-off events. For 27965/27994 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6207 event pairs, 0 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 8388. Up to 401 conditions per place. [2022-12-05 22:40:18,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 493 transitions, 11558 flow [2022-12-05 22:40:18,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-05 22:40:18,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [367] L705-6-->L695-5: Formula: (and (< v_~x~0_219 17) (= v_~q~0_114 (+ v_~q~0_116 6)) (= v_~next~0_125 v_~cur~0_198) (= (+ 16 v_~x~0_220) v_~x~0_219) (= (* 34 v_~prev~0_233) (+ (* 21 v_~next~0_125) (* 21 v_~cur~0_199) (* v_~prev~0_234 13))) (< v_~q~0_114 8) (= (* v_~next~0_125 13) (+ (* 21 v_~prev~0_234) (* 34 v_~cur~0_199) (* 21 v_~prev~0_233))) (= v_~j~0_197 (+ v_~j~0_199 (* 6 v_~i~0_187)))) InVars {~j~0=v_~j~0_199, ~prev~0=v_~prev~0_234, ~i~0=v_~i~0_187, ~q~0=v_~q~0_116, ~cur~0=v_~cur~0_199, ~x~0=v_~x~0_220} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~j~0=v_~j~0_197, ~next~0=v_~next~0_125, ~prev~0=v_~prev~0_233, ~i~0=v_~i~0_187, ~q~0=v_~q~0_114, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_82|, ~cur~0=v_~cur~0_198, ~x~0=v_~x~0_219} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:40:18,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L705-6-->t2EXIT: Formula: (and (= v_~q~0_187 (+ v_~q~0_188 6)) (not (< v_~q~0_187 7)) (< v_~x~0_255 17) (= |v_t2Thread1of1ForFork0_#res.offset_24| 0) (= (+ 16 v_~x~0_256) v_~x~0_255) (= (+ (* 34 v_~cur~0_229) (* 21 v_~prev~0_270) (* 21 v_~prev~0_269)) (* v_~next~0_143 13)) (= v_~j~0_279 (+ v_~j~0_280 (* 6 v_~i~0_235))) (= (* 34 v_~prev~0_269) (+ (* 21 v_~cur~0_229) (* 21 v_~next~0_143) (* v_~prev~0_270 13))) (= |v_t2Thread1of1ForFork0_#res.base_24| 0) (= v_~next~0_143 v_~cur~0_228) (< v_~q~0_187 8)) InVars {~j~0=v_~j~0_280, ~prev~0=v_~prev~0_270, ~i~0=v_~i~0_235, ~q~0=v_~q~0_188, ~cur~0=v_~cur~0_229, ~x~0=v_~x~0_256} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_279, ~next~0=v_~next~0_143, ~prev~0=v_~prev~0_269, ~i~0=v_~i~0_235, t2Thread1of1ForFork0_#res.base=|v_t2Thread1of1ForFork0_#res.base_24|, ~q~0=v_~q~0_187, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_137|, ~cur~0=v_~cur~0_228, t2Thread1of1ForFork0_#res.offset=|v_t2Thread1of1ForFork0_#res.offset_24|, ~x~0=v_~x~0_255} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, t2Thread1of1ForFork0_#res.base, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, t2Thread1of1ForFork0_#res.offset, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:40:18,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L705-6-->L687-5: Formula: (and (< v_~q~0_200 8) (= (+ v_~j~0_297 v_~i~0_238) v_~i~0_237) (= (+ v_~q~0_201 6) v_~q~0_200) (= v_~p~0_126 (+ v_~p~0_127 1)) (= v_~next~0_147 v_~cur~0_234) (= (+ (* 21 v_~prev~0_278) (* 21 v_~prev~0_277) (* 34 v_~cur~0_235)) (* v_~next~0_147 13)) (= v_~j~0_297 (+ v_~j~0_298 (* 6 v_~i~0_238))) (= (* 34 v_~prev~0_277) (+ (* v_~prev~0_278 13) (* 21 v_~next~0_147) (* 21 v_~cur~0_235))) (= (+ 16 v_~x~0_264) v_~x~0_263) (< v_~x~0_263 17) (< v_~p~0_127 7)) InVars {~j~0=v_~j~0_298, ~prev~0=v_~prev~0_278, ~i~0=v_~i~0_238, ~q~0=v_~q~0_201, ~p~0=v_~p~0_127, ~cur~0=v_~cur~0_235, ~x~0=v_~x~0_264} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_167|, ~j~0=v_~j~0_297, ~next~0=v_~next~0_147, ~prev~0=v_~prev~0_277, ~i~0=v_~i~0_237, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_98|, ~q~0=v_~q~0_200, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_148|, ~p~0=v_~p~0_126, ~cur~0=v_~cur~0_234, ~x~0=v_~x~0_263} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:40:18,438 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:40:18,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 516 [2022-12-05 22:40:18,439 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 492 transitions, 11607 flow [2022-12-05 22:40:18,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:18,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:18,439 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:18,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-05 22:40:18,640 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-05 22:40:18,641 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -108359877, now seen corresponding path program 1 times [2022-12-05 22:40:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988784263] [2022-12-05 22:40:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:18,734 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-05 22:40:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988784263] [2022-12-05 22:40:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988784263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23294177] [2022-12-05 22:40:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:18,753 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-05 22:40:18,754 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-05 22:40:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:18,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:40:18,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:18,917 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-05 22:40:18,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:19,169 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-05 22:40:19,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23294177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:19,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:19,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136206334] [2022-12-05 22:40:19,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:19,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:19,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:19,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:19,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-05 22:40:19,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 492 transitions, 11607 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:19,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:19,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-05 22:40:19,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:27,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:29,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:35,143 INFO L130 PetriNetUnfolder]: 2115/3702 cut-off events. [2022-12-05 22:40:35,144 INFO L131 PetriNetUnfolder]: For 178927/178927 co-relation queries the response was YES. [2022-12-05 22:40:35,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31200 conditions, 3702 events. 2115/3702 cut-off events. For 178927/178927 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 24876 event pairs, 150 based on Foata normal form. 32/3720 useless extension candidates. Maximal degree in co-relation 31110. Up to 2067 conditions per place. [2022-12-05 22:40:35,169 INFO L137 encePairwiseOnDemand]: 8/42 looper letters, 332 selfloop transitions, 334 changer transitions 0/666 dead transitions. [2022-12-05 22:40:35,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 666 transitions, 15513 flow [2022-12-05 22:40:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:40:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:40:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 183 transitions. [2022-12-05 22:40:35,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16758241758241757 [2022-12-05 22:40:35,170 INFO L175 Difference]: Start difference. First operand has 222 places, 492 transitions, 11607 flow. Second operand 26 states and 183 transitions. [2022-12-05 22:40:35,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 666 transitions, 15513 flow [2022-12-05 22:40:35,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 666 transitions, 15260 flow, removed 90 selfloop flow, removed 6 redundant places. [2022-12-05 22:40:35,749 INFO L231 Difference]: Finished difference. Result has 251 places, 582 transitions, 14692 flow [2022-12-05 22:40:35,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=11358, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=14692, PETRI_PLACES=251, PETRI_TRANSITIONS=582} [2022-12-05 22:40:35,749 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 233 predicate places. [2022-12-05 22:40:35,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:35,749 INFO L89 Accepts]: Start accepts. Operand has 251 places, 582 transitions, 14692 flow [2022-12-05 22:40:35,752 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:35,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:35,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 251 places, 582 transitions, 14692 flow [2022-12-05 22:40:35,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 251 places, 582 transitions, 14692 flow [2022-12-05 22:40:35,884 INFO L130 PetriNetUnfolder]: 362/964 cut-off events. [2022-12-05 22:40:35,884 INFO L131 PetriNetUnfolder]: For 39152/39183 co-relation queries the response was YES. [2022-12-05 22:40:35,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10590 conditions, 964 events. 362/964 cut-off events. For 39152/39183 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 7462 event pairs, 0 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 10492. Up to 487 conditions per place. [2022-12-05 22:40:35,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 251 places, 582 transitions, 14692 flow [2022-12-05 22:40:35,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-05 22:40:35,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:40:36,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:40:36,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L687-5-->L687-5: Formula: (and (< v_~p~0_72 6) (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2))) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [389] L705-6-->L687-5: Formula: (and (= (+ v_~p~0_154 1) v_~p~0_153) (< v_~p~0_154 7) (< v_~x~0_281 17) (= v_~next~0_156 v_~cur~0_251) (= (+ 16 v_~x~0_282) v_~x~0_281) (= (+ (* 21 v_~prev~0_295) (* 21 v_~prev~0_296) (* 34 v_~cur~0_252)) (* v_~next~0_156 13)) (= (+ v_~j~0_339 v_~i~0_274) v_~i~0_273) (= (+ (* 21 v_~next~0_156) (* v_~prev~0_296 13) (* 21 v_~cur~0_252)) (* 34 v_~prev~0_295))) InVars {~j~0=v_~j~0_339, ~prev~0=v_~prev~0_296, ~i~0=v_~i~0_274, ~p~0=v_~p~0_154, ~cur~0=v_~cur~0_252, ~x~0=v_~x~0_282} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_177|, ~j~0=v_~j~0_339, ~next~0=v_~next~0_156, ~prev~0=v_~prev~0_295, ~i~0=v_~i~0_273, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_115|, ~p~0=v_~p~0_153, ~cur~0=v_~cur~0_251, ~x~0=v_~x~0_281} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:40:36,331 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:40:36,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 583 [2022-12-05 22:40:36,332 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 582 transitions, 14832 flow [2022-12-05 22:40:36,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:36,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:36,332 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:36,347 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-05 22:40:36,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-05 22:40:36,536 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash -104688857, now seen corresponding path program 1 times [2022-12-05 22:40:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144723597] [2022-12-05 22:40:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:36,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144723597] [2022-12-05 22:40:36,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144723597] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:36,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047090499] [2022-12-05 22:40:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:36,663 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:40:36,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-05 22:40:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:36,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:40:36,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:36,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:37,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047090499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:37,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:37,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204561655] [2022-12-05 22:40:37,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:37,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:37,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-05 22:40:37,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 582 transitions, 14832 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:37,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:37,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-05 22:40:37,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:45,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:46,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:48,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:51,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:53,035 INFO L130 PetriNetUnfolder]: 2233/3944 cut-off events. [2022-12-05 22:40:53,035 INFO L131 PetriNetUnfolder]: For 240926/240926 co-relation queries the response was YES. [2022-12-05 22:40:53,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35293 conditions, 3944 events. 2233/3944 cut-off events. For 240926/240926 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 27119 event pairs, 349 based on Foata normal form. 46/3970 useless extension candidates. Maximal degree in co-relation 35192. Up to 2753 conditions per place. [2022-12-05 22:40:53,065 INFO L137 encePairwiseOnDemand]: 8/48 looper letters, 413 selfloop transitions, 284 changer transitions 2/699 dead transitions. [2022-12-05 22:40:53,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 699 transitions, 17766 flow [2022-12-05 22:40:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:40:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:40:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 142 transitions. [2022-12-05 22:40:53,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14087301587301587 [2022-12-05 22:40:53,067 INFO L175 Difference]: Start difference. First operand has 251 places, 582 transitions, 14832 flow. Second operand 21 states and 142 transitions. [2022-12-05 22:40:53,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 699 transitions, 17766 flow [2022-12-05 22:40:53,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 699 transitions, 16908 flow, removed 341 selfloop flow, removed 14 redundant places. [2022-12-05 22:40:53,900 INFO L231 Difference]: Finished difference. Result has 264 places, 636 transitions, 16303 flow [2022-12-05 22:40:53,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=13984, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=16303, PETRI_PLACES=264, PETRI_TRANSITIONS=636} [2022-12-05 22:40:53,901 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 246 predicate places. [2022-12-05 22:40:53,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:53,901 INFO L89 Accepts]: Start accepts. Operand has 264 places, 636 transitions, 16303 flow [2022-12-05 22:40:53,903 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:53,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:53,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 636 transitions, 16303 flow [2022-12-05 22:40:53,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 636 transitions, 16303 flow [2022-12-05 22:40:54,052 INFO L130 PetriNetUnfolder]: 396/1065 cut-off events. [2022-12-05 22:40:54,052 INFO L131 PetriNetUnfolder]: For 48675/48757 co-relation queries the response was YES. [2022-12-05 22:40:54,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11901 conditions, 1065 events. 396/1065 cut-off events. For 48675/48757 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 8400 event pairs, 0 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 11798. Up to 546 conditions per place. [2022-12-05 22:40:54,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 636 transitions, 16303 flow [2022-12-05 22:40:54,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 1808 [2022-12-05 22:40:54,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L705-6-->L695-5: Formula: (and (= v_~i~0_251 (+ v_~j~0_325 (* 7 v_~i~0_252))) (= v_~q~0_226 (+ 7 v_~q~0_228)) (= (+ (* 21 v_~cur~0_243) (* 21 v_~next~0_151) (* v_~prev~0_286 13)) (* 34 v_~prev~0_285)) (= (* 2 v_~i~0_251) (+ v_~j~0_323 v_~i~0_252)) (= (* v_~next~0_151 13) (+ (* 21 v_~prev~0_285) (* 21 v_~prev~0_286) (* 34 v_~cur~0_243))) (= v_~x~0_271 (+ 16 v_~x~0_272)) (< v_~p~0_135 7) (< v_~q~0_226 8) (= v_~next~0_151 v_~cur~0_242) (= v_~p~0_134 (+ v_~p~0_135 1)) (< v_~x~0_271 17)) InVars {~j~0=v_~j~0_325, ~prev~0=v_~prev~0_286, ~i~0=v_~i~0_252, ~q~0=v_~q~0_228, ~p~0=v_~p~0_135, ~cur~0=v_~cur~0_243, ~x~0=v_~x~0_272} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_171|, ~j~0=v_~j~0_323, ~next~0=v_~next~0_151, ~prev~0=v_~prev~0_285, ~i~0=v_~i~0_251, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_102|, ~q~0=v_~q~0_226, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_164|, ~p~0=v_~p~0_134, ~cur~0=v_~cur~0_242, ~x~0=v_~x~0_271} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:40:54,414 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:40:54,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 514 [2022-12-05 22:40:54,415 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 635 transitions, 16336 flow [2022-12-05 22:40:54,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:54,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:54,415 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:54,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:54,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:54,619 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:40:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:54,619 INFO L85 PathProgramCache]: Analyzing trace with hash -94120337, now seen corresponding path program 1 times [2022-12-05 22:40:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:54,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140213083] [2022-12-05 22:40:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:54,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:54,712 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-05 22:40:54,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140213083] [2022-12-05 22:40:54,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140213083] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:54,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342261246] [2022-12-05 22:40:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:54,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:54,720 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:40:54,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-05 22:40:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:54,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:40:54,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:54,887 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-05 22:40:54,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:55,143 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-05 22:40:55,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342261246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:55,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:55,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855267593] [2022-12-05 22:40:55,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:55,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:55,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:55,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:55,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-05 22:40:55,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 635 transitions, 16336 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:55,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:55,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-05 22:40:55,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:59,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:02,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:05,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:07,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:09,139 INFO L130 PetriNetUnfolder]: 2539/4482 cut-off events. [2022-12-05 22:41:09,139 INFO L131 PetriNetUnfolder]: For 288810/288810 co-relation queries the response was YES. [2022-12-05 22:41:09,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40949 conditions, 4482 events. 2539/4482 cut-off events. For 288810/288810 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 31497 event pairs, 235 based on Foata normal form. 36/4504 useless extension candidates. Maximal degree in co-relation 40843. Up to 2457 conditions per place. [2022-12-05 22:41:09,176 INFO L137 encePairwiseOnDemand]: 8/51 looper letters, 391 selfloop transitions, 423 changer transitions 1/815 dead transitions. [2022-12-05 22:41:09,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 815 transitions, 20973 flow [2022-12-05 22:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:41:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:41:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-12-05 22:41:09,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14950980392156862 [2022-12-05 22:41:09,177 INFO L175 Difference]: Start difference. First operand has 262 places, 635 transitions, 16336 flow. Second operand 24 states and 183 transitions. [2022-12-05 22:41:09,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 815 transitions, 20973 flow [2022-12-05 22:41:10,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 815 transitions, 20485 flow, removed 197 selfloop flow, removed 8 redundant places. [2022-12-05 22:41:10,360 INFO L231 Difference]: Finished difference. Result has 287 places, 733 transitions, 19867 flow [2022-12-05 22:41:10,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=15904, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=19867, PETRI_PLACES=287, PETRI_TRANSITIONS=733} [2022-12-05 22:41:10,361 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 269 predicate places. [2022-12-05 22:41:10,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:10,361 INFO L89 Accepts]: Start accepts. Operand has 287 places, 733 transitions, 19867 flow [2022-12-05 22:41:10,364 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:10,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:10,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 733 transitions, 19867 flow [2022-12-05 22:41:10,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 733 transitions, 19867 flow [2022-12-05 22:41:10,562 INFO L130 PetriNetUnfolder]: 453/1214 cut-off events. [2022-12-05 22:41:10,562 INFO L131 PetriNetUnfolder]: For 64428/64501 co-relation queries the response was YES. [2022-12-05 22:41:10,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14377 conditions, 1214 events. 453/1214 cut-off events. For 64428/64501 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 9885 event pairs, 1 based on Foata normal form. 0/1211 useless extension candidates. Maximal degree in co-relation 14264. Up to 652 conditions per place. [2022-12-05 22:41:10,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 733 transitions, 19867 flow [2022-12-05 22:41:10,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 2058 [2022-12-05 22:41:10,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:41:10,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L705-6-->L705-6: Formula: (and (= (+ (* 21 v_~prev~0_155) (* 34 v_~cur~0_129) (* 21 v_~prev~0_157)) (* 13 v_~next~0_82)) (= v_~cur~0_127 v_~next~0_82) (= (+ (* v_~prev~0_157 13) (* 21 v_~cur~0_129) (* 21 v_~next~0_82)) (* 34 v_~prev~0_155)) (= (+ 16 v_~x~0_143) v_~x~0_141) (< v_~x~0_141 17)) InVars {~prev~0=v_~prev~0_157, ~cur~0=v_~cur~0_129, ~x~0=v_~x~0_143} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_87|, ~next~0=v_~next~0_82, ~prev~0=v_~prev~0_155, ~cur~0=v_~cur~0_127, ~x~0=v_~x~0_141} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:41:10,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L695-5-->L695-5: Formula: (and (= v_~q~0_154 (+ 2 v_~q~0_156)) (< v_~q~0_156 6) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [402] L705-6-->L695-5: Formula: (and (< v_~q~0_266 7) (= v_~next~0_172 v_~cur~0_281) (= v_~j~0_385 (+ v_~j~0_386 v_~i~0_345)) (= (+ (* 21 v_~cur~0_282) (* 21 v_~next~0_172) (* v_~prev~0_328 13)) (* 34 v_~prev~0_327)) (= v_~q~0_265 (+ v_~q~0_266 1)) (= (+ 16 v_~x~0_314) v_~x~0_313) (= (* v_~next~0_172 13) (+ (* 21 v_~prev~0_327) (* 21 v_~prev~0_328) (* 34 v_~cur~0_282))) (< v_~x~0_313 17)) InVars {~j~0=v_~j~0_386, ~prev~0=v_~prev~0_328, ~i~0=v_~i~0_345, ~q~0=v_~q~0_266, ~cur~0=v_~cur~0_282, ~x~0=v_~x~0_314} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_195|, ~j~0=v_~j~0_385, ~next~0=v_~next~0_172, ~prev~0=v_~prev~0_327, ~i~0=v_~i~0_345, ~q~0=v_~q~0_265, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_191|, ~cur~0=v_~cur~0_281, ~x~0=v_~x~0_313} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:41:10,817 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:41:10,818 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 457 [2022-12-05 22:41:10,818 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 733 transitions, 19887 flow [2022-12-05 22:41:10,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:10,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:10,818 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:10,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-05 22:41:11,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-05 22:41:11,021 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 69192206, now seen corresponding path program 1 times [2022-12-05 22:41:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:11,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284790498] [2022-12-05 22:41:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284790498] [2022-12-05 22:41:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284790498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36953770] [2022-12-05 22:41:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:11,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:11,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:11,043 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:41:11,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-05 22:41:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:11,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:41:11,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:11,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:41:11,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36953770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:41:11,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:41:11,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-05 22:41:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487463522] [2022-12-05 22:41:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:41:11,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:41:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:41:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:41:11,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-05 22:41:11,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 733 transitions, 19887 flow. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:11,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:11,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-05 22:41:11,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:12,350 INFO L130 PetriNetUnfolder]: 2541/4486 cut-off events. [2022-12-05 22:41:12,351 INFO L131 PetriNetUnfolder]: For 278880/278880 co-relation queries the response was YES. [2022-12-05 22:41:12,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43329 conditions, 4486 events. 2541/4486 cut-off events. For 278880/278880 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 33171 event pairs, 523 based on Foata normal form. 8/4474 useless extension candidates. Maximal degree in co-relation 43213. Up to 2385 conditions per place. [2022-12-05 22:41:12,394 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 1101 selfloop transitions, 3 changer transitions 21/1125 dead transitions. [2022-12-05 22:41:12,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 1125 transitions, 32718 flow [2022-12-05 22:41:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:41:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:41:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-05 22:41:12,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-05 22:41:12,395 INFO L175 Difference]: Start difference. First operand has 287 places, 733 transitions, 19887 flow. Second operand 4 states and 84 transitions. [2022-12-05 22:41:12,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 1125 transitions, 32718 flow [2022-12-05 22:41:13,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 1125 transitions, 31737 flow, removed 441 selfloop flow, removed 7 redundant places. [2022-12-05 22:41:13,485 INFO L231 Difference]: Finished difference. Result has 285 places, 730 transitions, 19162 flow [2022-12-05 22:41:13,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=19161, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=19162, PETRI_PLACES=285, PETRI_TRANSITIONS=730} [2022-12-05 22:41:13,485 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 267 predicate places. [2022-12-05 22:41:13,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:13,486 INFO L89 Accepts]: Start accepts. Operand has 285 places, 730 transitions, 19162 flow [2022-12-05 22:41:13,488 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:13,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:13,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 730 transitions, 19162 flow [2022-12-05 22:41:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 730 transitions, 19162 flow [2022-12-05 22:41:13,693 INFO L130 PetriNetUnfolder]: 451/1214 cut-off events. [2022-12-05 22:41:13,693 INFO L131 PetriNetUnfolder]: For 66093/66154 co-relation queries the response was YES. [2022-12-05 22:41:13,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14502 conditions, 1214 events. 451/1214 cut-off events. For 66093/66154 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 10004 event pairs, 1 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 14387. Up to 646 conditions per place. [2022-12-05 22:41:13,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 730 transitions, 19162 flow [2022-12-05 22:41:13,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 2056 [2022-12-05 22:41:13,712 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:41:13,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-05 22:41:13,713 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 730 transitions, 19162 flow [2022-12-05 22:41:13,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:13,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:13,713 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:13,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:13,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:13,916 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 551449812, now seen corresponding path program 1 times [2022-12-05 22:41:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:13,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253227717] [2022-12-05 22:41:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:13,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253227717] [2022-12-05 22:41:13,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253227717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:13,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184522023] [2022-12-05 22:41:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:13,994 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:41:14,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-05 22:41:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:14,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:41:14,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:14,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:14,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184522023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:14,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:14,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:41:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045890243] [2022-12-05 22:41:14,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:14,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:41:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:41:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:41:14,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-05 22:41:14,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 730 transitions, 19162 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:14,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:14,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-05 22:41:14,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:16,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:18,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:21,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:22,499 INFO L130 PetriNetUnfolder]: 2600/4607 cut-off events. [2022-12-05 22:41:22,499 INFO L131 PetriNetUnfolder]: For 316483/316483 co-relation queries the response was YES. [2022-12-05 22:41:22,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45440 conditions, 4607 events. 2600/4607 cut-off events. For 316483/316483 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 32892 event pairs, 463 based on Foata normal form. 26/4613 useless extension candidates. Maximal degree in co-relation 45322. Up to 3618 conditions per place. [2022-12-05 22:41:22,536 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 567 selfloop transitions, 241 changer transitions 3/811 dead transitions. [2022-12-05 22:41:22,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 811 transitions, 21957 flow [2022-12-05 22:41:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:41:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:41:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-12-05 22:41:22,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15555555555555556 [2022-12-05 22:41:22,537 INFO L175 Difference]: Start difference. First operand has 284 places, 730 transitions, 19162 flow. Second operand 15 states and 126 transitions. [2022-12-05 22:41:22,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 811 transitions, 21957 flow [2022-12-05 22:41:23,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 811 transitions, 21956 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:41:23,913 INFO L231 Difference]: Finished difference. Result has 301 places, 763 transitions, 20930 flow [2022-12-05 22:41:23,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=19161, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20930, PETRI_PLACES=301, PETRI_TRANSITIONS=763} [2022-12-05 22:41:23,914 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 283 predicate places. [2022-12-05 22:41:23,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:23,914 INFO L89 Accepts]: Start accepts. Operand has 301 places, 763 transitions, 20930 flow [2022-12-05 22:41:23,917 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:23,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:23,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 763 transitions, 20930 flow [2022-12-05 22:41:23,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 763 transitions, 20930 flow [2022-12-05 22:41:24,197 INFO L130 PetriNetUnfolder]: 468/1262 cut-off events. [2022-12-05 22:41:24,197 INFO L131 PetriNetUnfolder]: For 69980/70103 co-relation queries the response was YES. [2022-12-05 22:41:24,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15469 conditions, 1262 events. 468/1262 cut-off events. For 69980/70103 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 10519 event pairs, 1 based on Foata normal form. 0/1258 useless extension candidates. Maximal degree in co-relation 15349. Up to 680 conditions per place. [2022-12-05 22:41:24,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 763 transitions, 20930 flow [2022-12-05 22:41:24,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 2120 [2022-12-05 22:41:24,223 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:41:24,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-05 22:41:24,223 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 763 transitions, 20930 flow [2022-12-05 22:41:24,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:24,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:24,224 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:24,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:24,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-05 22:41:24,425 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash -91062435, now seen corresponding path program 1 times [2022-12-05 22:41:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:24,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85604501] [2022-12-05 22:41:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:24,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85604501] [2022-12-05 22:41:24,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85604501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581741822] [2022-12-05 22:41:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:24,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:24,522 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:41:24,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-05 22:41:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:24,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:41:24,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:24,683 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-05 22:41:24,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:24,891 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-05 22:41:24,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581741822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:24,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:24,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:41:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128393456] [2022-12-05 22:41:24,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:24,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:41:24,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:41:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:41:24,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-05 22:41:24,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 763 transitions, 20930 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:24,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:24,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-05 22:41:24,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:33,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:35,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:37,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:39,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:41,591 INFO L130 PetriNetUnfolder]: 2708/4823 cut-off events. [2022-12-05 22:41:41,592 INFO L131 PetriNetUnfolder]: For 386087/386087 co-relation queries the response was YES. [2022-12-05 22:41:41,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49098 conditions, 4823 events. 2708/4823 cut-off events. For 386087/386087 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 34787 event pairs, 308 based on Foata normal form. 36/4839 useless extension candidates. Maximal degree in co-relation 48975. Up to 2897 conditions per place. [2022-12-05 22:41:41,634 INFO L137 encePairwiseOnDemand]: 8/54 looper letters, 444 selfloop transitions, 454 changer transitions 1/899 dead transitions. [2022-12-05 22:41:41,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 899 transitions, 25000 flow [2022-12-05 22:41:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:41:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:41:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 177 transitions. [2022-12-05 22:41:41,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13657407407407407 [2022-12-05 22:41:41,636 INFO L175 Difference]: Start difference. First operand has 301 places, 763 transitions, 20930 flow. Second operand 24 states and 177 transitions. [2022-12-05 22:41:41,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 899 transitions, 25000 flow [2022-12-05 22:41:43,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 899 transitions, 24770 flow, removed 60 selfloop flow, removed 7 redundant places. [2022-12-05 22:41:43,151 INFO L231 Difference]: Finished difference. Result has 326 places, 823 transitions, 24163 flow [2022-12-05 22:41:43,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=20704, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=24163, PETRI_PLACES=326, PETRI_TRANSITIONS=823} [2022-12-05 22:41:43,152 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 308 predicate places. [2022-12-05 22:41:43,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:43,153 INFO L89 Accepts]: Start accepts. Operand has 326 places, 823 transitions, 24163 flow [2022-12-05 22:41:43,156 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:43,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:43,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 326 places, 823 transitions, 24163 flow [2022-12-05 22:41:43,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 326 places, 823 transitions, 24163 flow [2022-12-05 22:41:43,507 INFO L130 PetriNetUnfolder]: 496/1340 cut-off events. [2022-12-05 22:41:43,507 INFO L131 PetriNetUnfolder]: For 85627/85732 co-relation queries the response was YES. [2022-12-05 22:41:43,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17390 conditions, 1340 events. 496/1340 cut-off events. For 85627/85732 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 11327 event pairs, 1 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 17260. Up to 734 conditions per place. [2022-12-05 22:41:43,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 326 places, 823 transitions, 24163 flow [2022-12-05 22:41:43,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 2238 [2022-12-05 22:41:43,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:41:43,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 417 [2022-12-05 22:41:43,569 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 823 transitions, 24176 flow [2022-12-05 22:41:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:43,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:43,570 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:43,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-05 22:41:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:43,774 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:41:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1812255743, now seen corresponding path program 1 times [2022-12-05 22:41:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238386743] [2022-12-05 22:41:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:43,887 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-05 22:41:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:43,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238386743] [2022-12-05 22:41:43,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238386743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:43,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406852320] [2022-12-05 22:41:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:43,889 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:41:43,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-05 22:41:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:43,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:41:43,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:44,069 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-05 22:41:44,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:44,373 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-05 22:41:44,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406852320] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:44,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:44,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:41:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350009488] [2022-12-05 22:41:44,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:44,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:41:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:41:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:41:44,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-05 22:41:44,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 823 transitions, 24176 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:44,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:44,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-05 22:41:44,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:48,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:51,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:53,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:55,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:57,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:58,416 INFO L130 PetriNetUnfolder]: 2842/5085 cut-off events. [2022-12-05 22:41:58,417 INFO L131 PetriNetUnfolder]: For 451662/451662 co-relation queries the response was YES. [2022-12-05 22:41:58,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54020 conditions, 5085 events. 2842/5085 cut-off events. For 451662/451662 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 37158 event pairs, 271 based on Foata normal form. 40/5105 useless extension candidates. Maximal degree in co-relation 53887. Up to 2950 conditions per place. [2022-12-05 22:41:58,463 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 475 selfloop transitions, 496 changer transitions 0/971 dead transitions. [2022-12-05 22:41:58,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 971 transitions, 28727 flow [2022-12-05 22:41:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:41:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:41:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 188 transitions. [2022-12-05 22:41:58,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14242424242424243 [2022-12-05 22:41:58,464 INFO L175 Difference]: Start difference. First operand has 326 places, 823 transitions, 24176 flow. Second operand 24 states and 188 transitions. [2022-12-05 22:41:58,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 971 transitions, 28727 flow [2022-12-05 22:42:00,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 971 transitions, 28012 flow, removed 308 selfloop flow, removed 7 redundant places. [2022-12-05 22:42:00,514 INFO L231 Difference]: Finished difference. Result has 351 places, 885 transitions, 27102 flow [2022-12-05 22:42:00,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=23465, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=823, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=27102, PETRI_PLACES=351, PETRI_TRANSITIONS=885} [2022-12-05 22:42:00,515 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 333 predicate places. [2022-12-05 22:42:00,515 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:00,515 INFO L89 Accepts]: Start accepts. Operand has 351 places, 885 transitions, 27102 flow [2022-12-05 22:42:00,519 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:00,519 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:00,519 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 885 transitions, 27102 flow [2022-12-05 22:42:00,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 885 transitions, 27102 flow [2022-12-05 22:42:00,861 INFO L130 PetriNetUnfolder]: 526/1426 cut-off events. [2022-12-05 22:42:00,861 INFO L131 PetriNetUnfolder]: For 97023/97117 co-relation queries the response was YES. [2022-12-05 22:42:00,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19229 conditions, 1426 events. 526/1426 cut-off events. For 97023/97117 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 12213 event pairs, 0 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 19089. Up to 786 conditions per place. [2022-12-05 22:42:00,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 885 transitions, 27102 flow [2022-12-05 22:42:00,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 2380 [2022-12-05 22:42:00,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:42:00,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 417 [2022-12-05 22:42:00,932 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 885 transitions, 27118 flow [2022-12-05 22:42:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:00,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:00,932 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:00,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-05 22:42:01,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:01,137 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1861433957, now seen corresponding path program 1 times [2022-12-05 22:42:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:01,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873519090] [2022-12-05 22:42:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:01,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873519090] [2022-12-05 22:42:01,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873519090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:01,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122819582] [2022-12-05 22:42:01,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:01,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:01,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:01,184 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:42:01,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-05 22:42:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:01,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:42:01,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:01,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:42:01,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122819582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:42:01,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:42:01,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:42:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051254167] [2022-12-05 22:42:01,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:42:01,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:42:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:01,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:42:01,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:42:01,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-05 22:42:01,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 885 transitions, 27118 flow. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:01,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:01,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-05 22:42:01,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:03,116 INFO L130 PetriNetUnfolder]: 2980/5277 cut-off events. [2022-12-05 22:42:03,116 INFO L131 PetriNetUnfolder]: For 436780/436780 co-relation queries the response was YES. [2022-12-05 22:42:03,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58594 conditions, 5277 events. 2980/5277 cut-off events. For 436780/436780 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 40508 event pairs, 533 based on Foata normal form. 44/5301 useless extension candidates. Maximal degree in co-relation 58451. Up to 2544 conditions per place. [2022-12-05 22:42:03,170 INFO L137 encePairwiseOnDemand]: 46/56 looper letters, 1366 selfloop transitions, 24 changer transitions 20/1410 dead transitions. [2022-12-05 22:42:03,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1410 transitions, 46366 flow [2022-12-05 22:42:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:42:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:42:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-05 22:42:03,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2022-12-05 22:42:03,171 INFO L175 Difference]: Start difference. First operand has 351 places, 885 transitions, 27118 flow. Second operand 6 states and 107 transitions. [2022-12-05 22:42:03,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1410 transitions, 46366 flow [2022-12-05 22:42:05,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1410 transitions, 44403 flow, removed 886 selfloop flow, removed 7 redundant places. [2022-12-05 22:42:05,291 INFO L231 Difference]: Finished difference. Result has 351 places, 886 transitions, 26229 flow [2022-12-05 22:42:05,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=25714, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=26229, PETRI_PLACES=351, PETRI_TRANSITIONS=886} [2022-12-05 22:42:05,292 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 333 predicate places. [2022-12-05 22:42:05,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:05,292 INFO L89 Accepts]: Start accepts. Operand has 351 places, 886 transitions, 26229 flow [2022-12-05 22:42:05,297 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:05,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:05,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 886 transitions, 26229 flow [2022-12-05 22:42:05,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 886 transitions, 26229 flow [2022-12-05 22:42:05,620 INFO L130 PetriNetUnfolder]: 569/1529 cut-off events. [2022-12-05 22:42:05,620 INFO L131 PetriNetUnfolder]: For 109676/109748 co-relation queries the response was YES. [2022-12-05 22:42:05,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20543 conditions, 1529 events. 569/1529 cut-off events. For 109676/109748 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 13188 event pairs, 0 based on Foata normal form. 11/1536 useless extension candidates. Maximal degree in co-relation 20402. Up to 845 conditions per place. [2022-12-05 22:42:05,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 351 places, 886 transitions, 26229 flow [2022-12-05 22:42:05,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 2468 [2022-12-05 22:42:05,648 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:42:05,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-05 22:42:05,649 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 886 transitions, 26229 flow [2022-12-05 22:42:05,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:05,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:05,649 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-05 22:42:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:05,853 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -80676567, now seen corresponding path program 1 times [2022-12-05 22:42:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:05,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589722116] [2022-12-05 22:42:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:05,967 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-05 22:42:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:05,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589722116] [2022-12-05 22:42:05,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589722116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:05,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180697257] [2022-12-05 22:42:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:05,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:05,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:05,969 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:42:05,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-05 22:42:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:06,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:42:06,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:06,135 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-05 22:42:06,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:06,584 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-05 22:42:06,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180697257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:06,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:06,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:42:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348589906] [2022-12-05 22:42:06,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:06,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:42:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:42:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:42:06,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-05 22:42:06,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 886 transitions, 26229 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:06,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:06,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-05 22:42:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:09,460 INFO L130 PetriNetUnfolder]: 3334/5901 cut-off events. [2022-12-05 22:42:09,460 INFO L131 PetriNetUnfolder]: For 523372/523372 co-relation queries the response was YES. [2022-12-05 22:42:09,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65440 conditions, 5901 events. 3334/5901 cut-off events. For 523372/523372 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 43713 event pairs, 85 based on Foata normal form. 38/5919 useless extension candidates. Maximal degree in co-relation 65296. Up to 2265 conditions per place. [2022-12-05 22:42:09,528 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 292 selfloop transitions, 813 changer transitions 0/1105 dead transitions. [2022-12-05 22:42:09,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1105 transitions, 33292 flow [2022-12-05 22:42:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-05 22:42:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-05 22:42:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 176 transitions. [2022-12-05 22:42:09,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16541353383458646 [2022-12-05 22:42:09,530 INFO L175 Difference]: Start difference. First operand has 351 places, 886 transitions, 26229 flow. Second operand 19 states and 176 transitions. [2022-12-05 22:42:09,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1105 transitions, 33292 flow [2022-12-05 22:42:12,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 1105 transitions, 33216 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-05 22:42:12,028 INFO L231 Difference]: Finished difference. Result has 373 places, 1007 transitions, 32957 flow [2022-12-05 22:42:12,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=26167, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=718, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=32957, PETRI_PLACES=373, PETRI_TRANSITIONS=1007} [2022-12-05 22:42:12,029 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 355 predicate places. [2022-12-05 22:42:12,029 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:12,029 INFO L89 Accepts]: Start accepts. Operand has 373 places, 1007 transitions, 32957 flow [2022-12-05 22:42:12,036 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:12,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:12,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 1007 transitions, 32957 flow [2022-12-05 22:42:12,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 1007 transitions, 32957 flow [2022-12-05 22:42:12,511 INFO L130 PetriNetUnfolder]: 621/1691 cut-off events. [2022-12-05 22:42:12,511 INFO L131 PetriNetUnfolder]: For 125260/125338 co-relation queries the response was YES. [2022-12-05 22:42:12,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24521 conditions, 1691 events. 621/1691 cut-off events. For 125260/125338 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 15213 event pairs, 0 based on Foata normal form. 13/1700 useless extension candidates. Maximal degree in co-relation 24374. Up to 956 conditions per place. [2022-12-05 22:42:12,547 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 1007 transitions, 32957 flow [2022-12-05 22:42:12,547 INFO L188 LiptonReduction]: Number of co-enabled transitions 2778 [2022-12-05 22:42:12,550 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:42:12,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 521 [2022-12-05 22:42:12,550 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1007 transitions, 32957 flow [2022-12-05 22:42:12,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:12,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:12,551 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:12,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-05 22:42:12,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-05 22:42:12,755 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:12,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash -84001968, now seen corresponding path program 1 times [2022-12-05 22:42:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:12,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636808694] [2022-12-05 22:42:12,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:12,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:12,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636808694] [2022-12-05 22:42:12,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636808694] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:12,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609919369] [2022-12-05 22:42:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:12,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:12,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:12,865 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:42:12,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-05 22:42:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:12,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:42:12,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:13,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:13,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609919369] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:13,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:13,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:42:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193542596] [2022-12-05 22:42:13,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:13,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:42:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:42:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:42:13,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-05 22:42:13,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1007 transitions, 32957 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:13,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:13,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-05 22:42:13,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:19,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:22,066 INFO L130 PetriNetUnfolder]: 3506/6237 cut-off events. [2022-12-05 22:42:22,066 INFO L131 PetriNetUnfolder]: For 688771/688771 co-relation queries the response was YES. [2022-12-05 22:42:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73625 conditions, 6237 events. 3506/6237 cut-off events. For 688771/688771 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 47157 event pairs, 652 based on Foata normal form. 64/6281 useless extension candidates. Maximal degree in co-relation 73475. Up to 4608 conditions per place. [2022-12-05 22:42:22,131 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 777 selfloop transitions, 381 changer transitions 5/1163 dead transitions. [2022-12-05 22:42:22,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1163 transitions, 38333 flow [2022-12-05 22:42:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 22:42:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 22:42:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 151 transitions. [2022-12-05 22:42:22,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13482142857142856 [2022-12-05 22:42:22,133 INFO L175 Difference]: Start difference. First operand has 373 places, 1007 transitions, 32957 flow. Second operand 20 states and 151 transitions. [2022-12-05 22:42:22,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1163 transitions, 38333 flow [2022-12-05 22:42:25,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1163 transitions, 36815 flow, removed 643 selfloop flow, removed 13 redundant places. [2022-12-05 22:42:25,726 INFO L231 Difference]: Finished difference. Result has 384 places, 1073 transitions, 35278 flow [2022-12-05 22:42:25,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=31531, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=35278, PETRI_PLACES=384, PETRI_TRANSITIONS=1073} [2022-12-05 22:42:25,727 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 366 predicate places. [2022-12-05 22:42:25,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:25,727 INFO L89 Accepts]: Start accepts. Operand has 384 places, 1073 transitions, 35278 flow [2022-12-05 22:42:25,733 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:25,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:25,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 1073 transitions, 35278 flow [2022-12-05 22:42:25,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 384 places, 1073 transitions, 35278 flow [2022-12-05 22:42:26,168 INFO L130 PetriNetUnfolder]: 670/1829 cut-off events. [2022-12-05 22:42:26,169 INFO L131 PetriNetUnfolder]: For 126525/126625 co-relation queries the response was YES. [2022-12-05 22:42:26,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26366 conditions, 1829 events. 670/1829 cut-off events. For 126525/126625 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 16639 event pairs, 0 based on Foata normal form. 15/1840 useless extension candidates. Maximal degree in co-relation 26220. Up to 1046 conditions per place. [2022-12-05 22:42:26,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 1073 transitions, 35278 flow [2022-12-05 22:42:26,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 2930 [2022-12-05 22:42:26,336 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:42:26,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 610 [2022-12-05 22:42:26,337 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1072 transitions, 35261 flow [2022-12-05 22:42:26,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:26,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:26,337 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:26,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-05 22:42:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-05 22:42:26,537 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 551765578, now seen corresponding path program 1 times [2022-12-05 22:42:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:26,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265275625] [2022-12-05 22:42:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:26,606 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-05 22:42:26,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:26,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265275625] [2022-12-05 22:42:26,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265275625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:26,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927572170] [2022-12-05 22:42:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:26,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:26,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:26,608 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:42:26,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-05 22:42:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:26,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:42:26,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:26,758 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-05 22:42:26,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:27,003 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-05 22:42:27,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927572170] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:27,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:27,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:42:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320662480] [2022-12-05 22:42:27,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:27,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:42:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:27,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:42:27,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:42:27,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-05 22:42:27,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1072 transitions, 35261 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:27,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:27,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-05 22:42:27,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:31,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:33,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:35,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:37,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:39,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:42:42,522 INFO L130 PetriNetUnfolder]: 3562/6361 cut-off events. [2022-12-05 22:42:42,522 INFO L131 PetriNetUnfolder]: For 559026/559026 co-relation queries the response was YES. [2022-12-05 22:42:42,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74290 conditions, 6361 events. 3562/6361 cut-off events. For 559026/559026 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 48482 event pairs, 654 based on Foata normal form. 28/6369 useless extension candidates. Maximal degree in co-relation 74141. Up to 4852 conditions per place. [2022-12-05 22:42:42,588 INFO L137 encePairwiseOnDemand]: 8/57 looper letters, 769 selfloop transitions, 385 changer transitions 0/1154 dead transitions. [2022-12-05 22:42:42,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1154 transitions, 38862 flow [2022-12-05 22:42:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:42:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:42:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-05 22:42:42,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19649122807017544 [2022-12-05 22:42:42,589 INFO L175 Difference]: Start difference. First operand has 383 places, 1072 transitions, 35261 flow. Second operand 10 states and 112 transitions. [2022-12-05 22:42:42,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1154 transitions, 38862 flow [2022-12-05 22:42:45,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 1154 transitions, 38486 flow, removed 142 selfloop flow, removed 7 redundant places. [2022-12-05 22:42:45,721 INFO L231 Difference]: Finished difference. Result has 389 places, 1101 transitions, 37207 flow [2022-12-05 22:42:45,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=34889, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1072, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=37207, PETRI_PLACES=389, PETRI_TRANSITIONS=1101} [2022-12-05 22:42:45,722 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 371 predicate places. [2022-12-05 22:42:45,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:45,723 INFO L89 Accepts]: Start accepts. Operand has 389 places, 1101 transitions, 37207 flow [2022-12-05 22:42:45,731 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:45,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:45,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 1101 transitions, 37207 flow [2022-12-05 22:42:45,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 389 places, 1101 transitions, 37207 flow [2022-12-05 22:42:46,213 INFO L130 PetriNetUnfolder]: 690/1882 cut-off events. [2022-12-05 22:42:46,213 INFO L131 PetriNetUnfolder]: For 139097/139206 co-relation queries the response was YES. [2022-12-05 22:42:46,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 1882 events. 690/1882 cut-off events. For 139097/139206 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 17107 event pairs, 0 based on Foata normal form. 15/1893 useless extension candidates. Maximal degree in co-relation 27616. Up to 1082 conditions per place. [2022-12-05 22:42:46,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 1101 transitions, 37207 flow [2022-12-05 22:42:46,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 2974 [2022-12-05 22:42:46,250 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:42:46,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 529 [2022-12-05 22:42:46,251 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 1101 transitions, 37207 flow [2022-12-05 22:42:46,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:46,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:46,251 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:46,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-05 22:42:46,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:46,452 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2040903103, now seen corresponding path program 1 times [2022-12-05 22:42:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:46,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519115999] [2022-12-05 22:42:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:46,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519115999] [2022-12-05 22:42:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519115999] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:46,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533569475] [2022-12-05 22:42:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:46,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:46,530 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:42:46,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-05 22:42:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:46,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:42:46,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:46,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:42:46,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533569475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:42:46,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:42:46,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:42:46,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635028637] [2022-12-05 22:42:46,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:42:46,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:42:46,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:42:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:42:46,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-05 22:42:46,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 1101 transitions, 37207 flow. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:46,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:46,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-05 22:42:46,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:49,158 INFO L130 PetriNetUnfolder]: 3862/6807 cut-off events. [2022-12-05 22:42:49,159 INFO L131 PetriNetUnfolder]: For 633097/633097 co-relation queries the response was YES. [2022-12-05 22:42:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82461 conditions, 6807 events. 3862/6807 cut-off events. For 633097/633097 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 52112 event pairs, 693 based on Foata normal form. 88/6875 useless extension candidates. Maximal degree in co-relation 82307. Up to 3341 conditions per place. [2022-12-05 22:42:49,292 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 1607 selfloop transitions, 78 changer transitions 10/1695 dead transitions. [2022-12-05 22:42:49,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1695 transitions, 60967 flow [2022-12-05 22:42:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:42:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:42:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-05 22:42:49,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24853801169590642 [2022-12-05 22:42:49,293 INFO L175 Difference]: Start difference. First operand has 389 places, 1101 transitions, 37207 flow. Second operand 6 states and 85 transitions. [2022-12-05 22:42:49,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1695 transitions, 60967 flow [2022-12-05 22:42:52,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 1695 transitions, 60865 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-05 22:42:52,793 INFO L231 Difference]: Finished difference. Result has 395 places, 1124 transitions, 38397 flow [2022-12-05 22:42:52,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=36725, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=38397, PETRI_PLACES=395, PETRI_TRANSITIONS=1124} [2022-12-05 22:42:52,793 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 377 predicate places. [2022-12-05 22:42:52,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:52,794 INFO L89 Accepts]: Start accepts. Operand has 395 places, 1124 transitions, 38397 flow [2022-12-05 22:42:52,801 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:52,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:52,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 1124 transitions, 38397 flow [2022-12-05 22:42:52,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 1124 transitions, 38397 flow [2022-12-05 22:42:53,385 INFO L130 PetriNetUnfolder]: 760/2051 cut-off events. [2022-12-05 22:42:53,385 INFO L131 PetriNetUnfolder]: For 188094/188184 co-relation queries the response was YES. [2022-12-05 22:42:53,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31551 conditions, 2051 events. 760/2051 cut-off events. For 188094/188184 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 18846 event pairs, 1 based on Foata normal form. 29/2077 useless extension candidates. Maximal degree in co-relation 31396. Up to 1191 conditions per place. [2022-12-05 22:42:53,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 1124 transitions, 38397 flow [2022-12-05 22:42:53,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 3160 [2022-12-05 22:42:53,430 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:42:53,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 637 [2022-12-05 22:42:53,431 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 1124 transitions, 38397 flow [2022-12-05 22:42:53,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:53,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:53,431 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:53,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-05 22:42:53,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-05 22:42:53,635 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:42:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2128756762, now seen corresponding path program 1 times [2022-12-05 22:42:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:53,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581182125] [2022-12-05 22:42:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581182125] [2022-12-05 22:42:53,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581182125] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412483450] [2022-12-05 22:42:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:53,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:53,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:53,668 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:42:53,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-05 22:42:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:53,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 22:42:53,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:42:53,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:42:53,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412483450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:42:53,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:42:53,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-05 22:42:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435117476] [2022-12-05 22:42:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:42:53,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:42:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:42:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:42:53,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-05 22:42:53,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1124 transitions, 38397 flow. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:53,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:53,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-05 22:42:53,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:56,820 INFO L130 PetriNetUnfolder]: 4208/7284 cut-off events. [2022-12-05 22:42:56,820 INFO L131 PetriNetUnfolder]: For 743666/743666 co-relation queries the response was YES. [2022-12-05 22:42:56,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91868 conditions, 7284 events. 4208/7284 cut-off events. For 743666/743666 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 55118 event pairs, 633 based on Foata normal form. 24/7294 useless extension candidates. Maximal degree in co-relation 91710. Up to 3289 conditions per place. [2022-12-05 22:42:56,907 INFO L137 encePairwiseOnDemand]: 36/57 looper letters, 1666 selfloop transitions, 76 changer transitions 10/1752 dead transitions. [2022-12-05 22:42:56,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1752 transitions, 63309 flow [2022-12-05 22:42:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:42:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:42:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-12-05 22:42:56,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2022-12-05 22:42:56,908 INFO L175 Difference]: Start difference. First operand has 395 places, 1124 transitions, 38397 flow. Second operand 7 states and 91 transitions. [2022-12-05 22:42:56,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1752 transitions, 63309 flow [2022-12-05 22:43:00,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 1752 transitions, 63122 flow, removed 93 selfloop flow, removed 1 redundant places. [2022-12-05 22:43:00,948 INFO L231 Difference]: Finished difference. Result has 403 places, 1137 transitions, 38854 flow [2022-12-05 22:43:00,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=37577, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=38854, PETRI_PLACES=403, PETRI_TRANSITIONS=1137} [2022-12-05 22:43:00,949 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 385 predicate places. [2022-12-05 22:43:00,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:00,949 INFO L89 Accepts]: Start accepts. Operand has 403 places, 1137 transitions, 38854 flow [2022-12-05 22:43:00,955 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:00,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:00,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 403 places, 1137 transitions, 38854 flow [2022-12-05 22:43:00,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 403 places, 1137 transitions, 38854 flow [2022-12-05 22:43:01,557 INFO L130 PetriNetUnfolder]: 844/2236 cut-off events. [2022-12-05 22:43:01,557 INFO L131 PetriNetUnfolder]: For 237918/238039 co-relation queries the response was YES. [2022-12-05 22:43:01,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35484 conditions, 2236 events. 844/2236 cut-off events. For 237918/238039 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 20519 event pairs, 4 based on Foata normal form. 60/2293 useless extension candidates. Maximal degree in co-relation 35325. Up to 1316 conditions per place. [2022-12-05 22:43:01,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 403 places, 1137 transitions, 38854 flow [2022-12-05 22:43:01,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 3346 [2022-12-05 22:43:01,605 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:43:01,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 657 [2022-12-05 22:43:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 1137 transitions, 38854 flow [2022-12-05 22:43:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:01,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:01,606 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:01,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-05 22:43:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-05 22:43:01,810 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:43:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1662982034, now seen corresponding path program 1 times [2022-12-05 22:43:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:01,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924529292] [2022-12-05 22:43:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:43:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924529292] [2022-12-05 22:43:01,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924529292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940427475] [2022-12-05 22:43:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:01,912 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:43:01,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-05 22:43:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:43:01,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:43:02,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:43:02,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940427475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:02,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:02,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:43:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203174451] [2022-12-05 22:43:02,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:02,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:43:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:43:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:43:02,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-05 22:43:02,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1137 transitions, 38854 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:02,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:02,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-05 22:43:02,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:11,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:13,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:16,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:18,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:20,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:22,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:24,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:29,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:34,229 INFO L130 PetriNetUnfolder]: 4678/8110 cut-off events. [2022-12-05 22:43:34,230 INFO L131 PetriNetUnfolder]: For 1020551/1020551 co-relation queries the response was YES. [2022-12-05 22:43:34,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105565 conditions, 8110 events. 4678/8110 cut-off events. For 1020551/1020551 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 61707 event pairs, 339 based on Foata normal form. 54/8150 useless extension candidates. Maximal degree in co-relation 105403. Up to 4561 conditions per place. [2022-12-05 22:43:34,326 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 719 selfloop transitions, 744 changer transitions 4/1467 dead transitions. [2022-12-05 22:43:34,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1467 transitions, 48783 flow [2022-12-05 22:43:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-05 22:43:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-05 22:43:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 259 transitions. [2022-12-05 22:43:34,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.125 [2022-12-05 22:43:34,328 INFO L175 Difference]: Start difference. First operand has 403 places, 1137 transitions, 38854 flow. Second operand 37 states and 259 transitions. [2022-12-05 22:43:34,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1467 transitions, 48783 flow [2022-12-05 22:43:39,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 1467 transitions, 48612 flow, removed 85 selfloop flow, removed 1 redundant places. [2022-12-05 22:43:39,828 INFO L231 Difference]: Finished difference. Result has 451 places, 1273 transitions, 46281 flow [2022-12-05 22:43:39,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=38683, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=46281, PETRI_PLACES=451, PETRI_TRANSITIONS=1273} [2022-12-05 22:43:39,829 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 433 predicate places. [2022-12-05 22:43:39,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:39,829 INFO L89 Accepts]: Start accepts. Operand has 451 places, 1273 transitions, 46281 flow [2022-12-05 22:43:39,836 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:39,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:39,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 451 places, 1273 transitions, 46281 flow [2022-12-05 22:43:39,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 451 places, 1273 transitions, 46281 flow [2022-12-05 22:43:40,582 INFO L130 PetriNetUnfolder]: 932/2473 cut-off events. [2022-12-05 22:43:40,582 INFO L131 PetriNetUnfolder]: For 311414/311542 co-relation queries the response was YES. [2022-12-05 22:43:40,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41639 conditions, 2473 events. 932/2473 cut-off events. For 311414/311542 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 23304 event pairs, 4 based on Foata normal form. 62/2532 useless extension candidates. Maximal degree in co-relation 41466. Up to 1477 conditions per place. [2022-12-05 22:43:40,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 1273 transitions, 46281 flow [2022-12-05 22:43:40,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 3710 [2022-12-05 22:43:40,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:43:40,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 876 [2022-12-05 22:43:40,705 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 1273 transitions, 46291 flow [2022-12-05 22:43:40,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:40,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:40,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:40,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-05 22:43:40,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-05 22:43:40,907 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:43:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -73266637, now seen corresponding path program 1 times [2022-12-05 22:43:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026729254] [2022-12-05 22:43:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:41,002 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-05 22:43:41,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026729254] [2022-12-05 22:43:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026729254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446007376] [2022-12-05 22:43:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:41,003 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:43:41,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-05 22:43:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:41,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:43:41,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:41,174 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-05 22:43:41,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:41,416 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-05 22:43:41,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446007376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:41,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:41,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:43:41,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79925417] [2022-12-05 22:43:41,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:41,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:43:41,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:41,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:43:41,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:43:41,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-05 22:43:41,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 1273 transitions, 46291 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:41,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:41,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-05 22:43:41,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:44,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:49,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:52,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:54,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:43:58,116 INFO L130 PetriNetUnfolder]: 4732/8236 cut-off events. [2022-12-05 22:43:58,116 INFO L131 PetriNetUnfolder]: For 1046778/1046778 co-relation queries the response was YES. [2022-12-05 22:43:58,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112296 conditions, 8236 events. 4732/8236 cut-off events. For 1046778/1046778 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 63315 event pairs, 596 based on Foata normal form. 26/8248 useless extension candidates. Maximal degree in co-relation 112120. Up to 5950 conditions per place. [2022-12-05 22:43:58,226 INFO L137 encePairwiseOnDemand]: 8/57 looper letters, 889 selfloop transitions, 537 changer transitions 1/1427 dead transitions. [2022-12-05 22:43:58,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1427 transitions, 51519 flow [2022-12-05 22:43:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:43:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:43:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 158 transitions. [2022-12-05 22:43:58,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13199665831244778 [2022-12-05 22:43:58,227 INFO L175 Difference]: Start difference. First operand has 451 places, 1273 transitions, 46291 flow. Second operand 21 states and 158 transitions. [2022-12-05 22:43:58,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1427 transitions, 51519 flow [2022-12-05 22:44:04,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1427 transitions, 50100 flow, removed 634 selfloop flow, removed 12 redundant places. [2022-12-05 22:44:04,938 INFO L231 Difference]: Finished difference. Result has 466 places, 1309 transitions, 48015 flow [2022-12-05 22:44:04,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=44807, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=503, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=48015, PETRI_PLACES=466, PETRI_TRANSITIONS=1309} [2022-12-05 22:44:04,939 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 448 predicate places. [2022-12-05 22:44:04,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:04,939 INFO L89 Accepts]: Start accepts. Operand has 466 places, 1309 transitions, 48015 flow [2022-12-05 22:44:04,948 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:04,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:04,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 466 places, 1309 transitions, 48015 flow [2022-12-05 22:44:04,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 1309 transitions, 48015 flow [2022-12-05 22:44:05,727 INFO L130 PetriNetUnfolder]: 957/2528 cut-off events. [2022-12-05 22:44:05,728 INFO L131 PetriNetUnfolder]: For 336995/337220 co-relation queries the response was YES. [2022-12-05 22:44:05,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43082 conditions, 2528 events. 957/2528 cut-off events. For 336995/337220 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 23862 event pairs, 4 based on Foata normal form. 61/2586 useless extension candidates. Maximal degree in co-relation 42901. Up to 1499 conditions per place. [2022-12-05 22:44:05,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 466 places, 1309 transitions, 48015 flow [2022-12-05 22:44:05,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 3768 [2022-12-05 22:44:05,790 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:44:05,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 851 [2022-12-05 22:44:05,790 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 1309 transitions, 48015 flow [2022-12-05 22:44:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:05,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:05,791 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:05,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-05 22:44:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:05,991 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:44:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2022451152, now seen corresponding path program 2 times [2022-12-05 22:44:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:05,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292702676] [2022-12-05 22:44:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:06,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:06,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292702676] [2022-12-05 22:44:06,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292702676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:06,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113378132] [2022-12-05 22:44:06,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:44:06,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:06,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:06,102 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:44:06,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-05 22:44:06,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:44:06,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:44:06,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:44:06,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:06,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:06,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113378132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:06,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:06,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:44:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894596760] [2022-12-05 22:44:06,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:44:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:44:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:44:06,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-05 22:44:06,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1309 transitions, 48015 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:06,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:06,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-05 22:44:06,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:13,966 INFO L130 PetriNetUnfolder]: 5652/9712 cut-off events. [2022-12-05 22:44:13,967 INFO L131 PetriNetUnfolder]: For 1571215/1571215 co-relation queries the response was YES. [2022-12-05 22:44:14,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139413 conditions, 9712 events. 5652/9712 cut-off events. For 1571215/1571215 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 75120 event pairs, 215 based on Foata normal form. 32/9730 useless extension candidates. Maximal degree in co-relation 139229. Up to 3932 conditions per place. [2022-12-05 22:44:14,108 INFO L137 encePairwiseOnDemand]: 8/57 looper letters, 452 selfloop transitions, 1173 changer transitions 2/1627 dead transitions. [2022-12-05 22:44:14,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1627 transitions, 59847 flow [2022-12-05 22:44:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:44:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:44:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 186 transitions. [2022-12-05 22:44:14,110 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14832535885167464 [2022-12-05 22:44:14,110 INFO L175 Difference]: Start difference. First operand has 466 places, 1309 transitions, 48015 flow. Second operand 22 states and 186 transitions. [2022-12-05 22:44:14,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1627 transitions, 59847 flow [2022-12-05 22:44:24,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 1627 transitions, 59677 flow, removed 64 selfloop flow, removed 2 redundant places. [2022-12-05 22:44:24,981 INFO L231 Difference]: Finished difference. Result has 490 places, 1468 transitions, 58295 flow [2022-12-05 22:44:24,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=47857, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=58295, PETRI_PLACES=490, PETRI_TRANSITIONS=1468} [2022-12-05 22:44:24,983 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 472 predicate places. [2022-12-05 22:44:24,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:24,983 INFO L89 Accepts]: Start accepts. Operand has 490 places, 1468 transitions, 58295 flow [2022-12-05 22:44:24,996 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:24,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:24,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 490 places, 1468 transitions, 58295 flow [2022-12-05 22:44:25,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 490 places, 1468 transitions, 58295 flow [2022-12-05 22:44:26,196 INFO L130 PetriNetUnfolder]: 1139/2946 cut-off events. [2022-12-05 22:44:26,196 INFO L131 PetriNetUnfolder]: For 508902/509309 co-relation queries the response was YES. [2022-12-05 22:44:26,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55436 conditions, 2946 events. 1139/2946 cut-off events. For 508902/509309 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 28231 event pairs, 7 based on Foata normal form. 66/3009 useless extension candidates. Maximal degree in co-relation 55248. Up to 1782 conditions per place. [2022-12-05 22:44:26,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 490 places, 1468 transitions, 58295 flow [2022-12-05 22:44:26,272 INFO L188 LiptonReduction]: Number of co-enabled transitions 4310 [2022-12-05 22:44:26,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:44:26,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1331 [2022-12-05 22:44:26,314 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 1468 transitions, 58309 flow [2022-12-05 22:44:26,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:26,314 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:26,314 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:26,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-05 22:44:26,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:26,523 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:44:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1434511972, now seen corresponding path program 1 times [2022-12-05 22:44:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:26,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637381439] [2022-12-05 22:44:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:26,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637381439] [2022-12-05 22:44:26,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637381439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:26,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144621747] [2022-12-05 22:44:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:26,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:26,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:26,676 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:44:26,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-05 22:44:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:26,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:44:26,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:26,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:27,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144621747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:27,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:27,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:44:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183623990] [2022-12-05 22:44:27,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:27,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:44:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:44:27,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:44:27,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-05 22:44:27,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1468 transitions, 58309 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:27,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:27,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-05 22:44:27,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:36,069 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 80 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:44:47,416 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 76 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:44:53,558 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 61 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:44:55,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:00,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:02,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:03,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:10,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:16,843 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 66 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:45:18,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:24,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:32,109 INFO L130 PetriNetUnfolder]: 6117/10564 cut-off events. [2022-12-05 22:45:32,109 INFO L131 PetriNetUnfolder]: For 2155334/2155334 co-relation queries the response was YES. [2022-12-05 22:45:32,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157320 conditions, 10564 events. 6117/10564 cut-off events. For 2155334/2155334 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 83437 event pairs, 573 based on Foata normal form. 128/10678 useless extension candidates. Maximal degree in co-relation 157129. Up to 6389 conditions per place. [2022-12-05 22:45:32,332 INFO L137 encePairwiseOnDemand]: 8/58 looper letters, 861 selfloop transitions, 971 changer transitions 4/1836 dead transitions. [2022-12-05 22:45:32,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 1836 transitions, 71292 flow [2022-12-05 22:45:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-05 22:45:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-05 22:45:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 242 transitions. [2022-12-05 22:45:32,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11276794035414725 [2022-12-05 22:45:32,334 INFO L175 Difference]: Start difference. First operand has 490 places, 1468 transitions, 58309 flow. Second operand 37 states and 242 transitions. [2022-12-05 22:45:32,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 1836 transitions, 71292 flow [2022-12-05 22:45:45,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 1836 transitions, 69264 flow, removed 755 selfloop flow, removed 18 redundant places. [2022-12-05 22:45:45,402 INFO L231 Difference]: Finished difference. Result has 520 places, 1635 transitions, 67107 flow [2022-12-05 22:45:45,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=56679, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=826, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=67107, PETRI_PLACES=520, PETRI_TRANSITIONS=1635} [2022-12-05 22:45:45,403 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 502 predicate places. [2022-12-05 22:45:45,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:45,404 INFO L89 Accepts]: Start accepts. Operand has 520 places, 1635 transitions, 67107 flow [2022-12-05 22:45:45,417 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:45,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:45,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 520 places, 1635 transitions, 67107 flow [2022-12-05 22:45:45,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 520 places, 1635 transitions, 67107 flow [2022-12-05 22:45:46,786 INFO L130 PetriNetUnfolder]: 1259/3250 cut-off events. [2022-12-05 22:45:46,787 INFO L131 PetriNetUnfolder]: For 486980/487352 co-relation queries the response was YES. [2022-12-05 22:45:46,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60911 conditions, 3250 events. 1259/3250 cut-off events. For 486980/487352 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 31634 event pairs, 8 based on Foata normal form. 67/3314 useless extension candidates. Maximal degree in co-relation 60719. Up to 1972 conditions per place. [2022-12-05 22:45:46,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 520 places, 1635 transitions, 67107 flow [2022-12-05 22:45:46,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 4716 [2022-12-05 22:45:47,155 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:45:47,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1752 [2022-12-05 22:45:47,156 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 1633 transitions, 67066 flow [2022-12-05 22:45:47,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:47,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:47,156 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:47,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-05 22:45:47,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-05 22:45:47,357 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:45:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2035032781, now seen corresponding path program 1 times [2022-12-05 22:45:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:47,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868870577] [2022-12-05 22:45:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868870577] [2022-12-05 22:45:47,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868870577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:47,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586985478] [2022-12-05 22:45:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:47,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:47,461 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:45:47,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-05 22:45:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:47,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:45:47,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:47,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:45:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:47,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586985478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:45:47,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:45:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:45:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743476456] [2022-12-05 22:45:47,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:45:47,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:45:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:45:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:45:47,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:45:47,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1633 transitions, 67066 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:47,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:47,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:45:47,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:09,836 INFO L130 PetriNetUnfolder]: 7006/12068 cut-off events. [2022-12-05 22:46:09,836 INFO L131 PetriNetUnfolder]: For 2259074/2259074 co-relation queries the response was YES. [2022-12-05 22:46:09,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183999 conditions, 12068 events. 7006/12068 cut-off events. For 2259074/2259074 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 97079 event pairs, 358 based on Foata normal form. 110/12164 useless extension candidates. Maximal degree in co-relation 183804. Up to 5499 conditions per place. [2022-12-05 22:46:10,137 INFO L137 encePairwiseOnDemand]: 8/61 looper letters, 701 selfloop transitions, 1374 changer transitions 1/2076 dead transitions. [2022-12-05 22:46:10,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 2076 transitions, 83657 flow [2022-12-05 22:46:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-05 22:46:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-05 22:46:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 231 transitions. [2022-12-05 22:46:10,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12215758857747223 [2022-12-05 22:46:10,138 INFO L175 Difference]: Start difference. First operand has 518 places, 1633 transitions, 67066 flow. Second operand 31 states and 231 transitions. [2022-12-05 22:46:10,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 2076 transitions, 83657 flow [2022-12-05 22:46:24,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 2076 transitions, 80766 flow, removed 1305 selfloop flow, removed 10 redundant places. [2022-12-05 22:46:24,084 INFO L231 Difference]: Finished difference. Result has 548 places, 1853 transitions, 78838 flow [2022-12-05 22:46:24,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=64353, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=78838, PETRI_PLACES=548, PETRI_TRANSITIONS=1853} [2022-12-05 22:46:24,085 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 530 predicate places. [2022-12-05 22:46:24,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:46:24,085 INFO L89 Accepts]: Start accepts. Operand has 548 places, 1853 transitions, 78838 flow [2022-12-05 22:46:24,096 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:46:24,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:46:24,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 548 places, 1853 transitions, 78838 flow [2022-12-05 22:46:24,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 548 places, 1853 transitions, 78838 flow [2022-12-05 22:46:25,704 INFO L130 PetriNetUnfolder]: 1460/3733 cut-off events. [2022-12-05 22:46:25,704 INFO L131 PetriNetUnfolder]: For 638861/639251 co-relation queries the response was YES. [2022-12-05 22:46:25,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73294 conditions, 3733 events. 1460/3733 cut-off events. For 638861/639251 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 37184 event pairs, 11 based on Foata normal form. 65/3795 useless extension candidates. Maximal degree in co-relation 73092. Up to 2177 conditions per place. [2022-12-05 22:46:25,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 548 places, 1853 transitions, 78838 flow [2022-12-05 22:46:25,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 5332 [2022-12-05 22:46:25,885 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:46:25,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1800 [2022-12-05 22:46:25,886 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 1853 transitions, 78859 flow [2022-12-05 22:46:25,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:25,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:46:25,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:46:25,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-05 22:46:26,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-05 22:46:26,086 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:46:26,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:46:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash -131441733, now seen corresponding path program 1 times [2022-12-05 22:46:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:46:26,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565674414] [2022-12-05 22:46:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:46:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:26,169 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-05 22:46:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:46:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565674414] [2022-12-05 22:46:26,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565674414] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:46:26,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266356636] [2022-12-05 22:46:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:26,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:46:26,171 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:46:26,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-05 22:46:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:26,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:46:26,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:46:26,336 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-05 22:46:26,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:46:26,507 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-05 22:46:26,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266356636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:46:26,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:46:26,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:46:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286472151] [2022-12-05 22:46:26,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:46:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:46:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:46:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:46:26,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:46:26,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-05 22:46:26,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1853 transitions, 78859 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:26,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:46:26,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-05 22:46:26,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:37,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:46:39,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:46:41,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:46:43,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:46:44,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:46:52,824 INFO L130 PetriNetUnfolder]: 7205/12482 cut-off events. [2022-12-05 22:46:52,824 INFO L131 PetriNetUnfolder]: For 2342317/2342317 co-relation queries the response was YES. [2022-12-05 22:46:52,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194355 conditions, 12482 events. 7205/12482 cut-off events. For 2342317/2342317 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 101947 event pairs, 1507 based on Foata normal form. 86/12554 useless extension candidates. Maximal degree in co-relation 194150. Up to 10044 conditions per place. [2022-12-05 22:46:53,010 INFO L137 encePairwiseOnDemand]: 8/62 looper letters, 1461 selfloop transitions, 610 changer transitions 3/2074 dead transitions. [2022-12-05 22:46:53,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 2074 transitions, 89019 flow [2022-12-05 22:46:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:46:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:46:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 164 transitions. [2022-12-05 22:46:53,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12023460410557185 [2022-12-05 22:46:53,011 INFO L175 Difference]: Start difference. First operand has 548 places, 1853 transitions, 78859 flow. Second operand 22 states and 164 transitions. [2022-12-05 22:46:53,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 2074 transitions, 89019 flow [2022-12-05 22:47:10,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 2074 transitions, 85979 flow, removed 1414 selfloop flow, removed 8 redundant places. [2022-12-05 22:47:11,036 INFO L231 Difference]: Finished difference. Result has 567 places, 1957 transitions, 83082 flow [2022-12-05 22:47:11,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=76037, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1853, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=83082, PETRI_PLACES=567, PETRI_TRANSITIONS=1957} [2022-12-05 22:47:11,038 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 549 predicate places. [2022-12-05 22:47:11,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:47:11,038 INFO L89 Accepts]: Start accepts. Operand has 567 places, 1957 transitions, 83082 flow [2022-12-05 22:47:11,053 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:47:11,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:47:11,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 567 places, 1957 transitions, 83082 flow [2022-12-05 22:47:11,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 567 places, 1957 transitions, 83082 flow [2022-12-05 22:47:12,830 INFO L130 PetriNetUnfolder]: 1514/3897 cut-off events. [2022-12-05 22:47:12,830 INFO L131 PetriNetUnfolder]: For 662260/662730 co-relation queries the response was YES. [2022-12-05 22:47:12,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75552 conditions, 3897 events. 1514/3897 cut-off events. For 662260/662730 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 39289 event pairs, 8 based on Foata normal form. 65/3959 useless extension candidates. Maximal degree in co-relation 75345. Up to 2202 conditions per place. [2022-12-05 22:47:12,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 567 places, 1957 transitions, 83082 flow [2022-12-05 22:47:12,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 5538 [2022-12-05 22:47:13,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [421] L705-6-->L687-5: Formula: (and (= v_~j~0_501 (+ v_~j~0_502 (* 6 v_~i~0_473))) (= (* v_~next~0_200 13) (+ (* 21 v_~prev~0_384) (* 34 v_~cur~0_326) (* 21 v_~prev~0_383))) (= v_~p~0_318 (+ v_~p~0_320 2)) (= v_~i~0_471 (+ (* v_~j~0_501 2) v_~i~0_473)) (= (+ 16 v_~x~0_370) v_~x~0_369) (< v_~p~0_320 6) (< v_~q~0_368 8) (= v_~next~0_200 v_~cur~0_325) (= (+ v_~q~0_369 6) v_~q~0_368) (< v_~x~0_369 17) (= (* 34 v_~prev~0_383) (+ (* v_~prev~0_384 13) (* 21 v_~next~0_200) (* 21 v_~cur~0_326)))) InVars {~j~0=v_~j~0_502, ~prev~0=v_~prev~0_384, ~i~0=v_~i~0_473, ~q~0=v_~q~0_369, ~p~0=v_~p~0_320, ~cur~0=v_~cur~0_326, ~x~0=v_~x~0_370} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_235|, ~j~0=v_~j~0_501, ~next~0=v_~next~0_200, ~prev~0=v_~prev~0_383, ~i~0=v_~i~0_471, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_234|, ~q~0=v_~q~0_368, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_262|, ~p~0=v_~p~0_318, ~cur~0=v_~cur~0_325, ~x~0=v_~x~0_369} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:47:13,419 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:47:13,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2382 [2022-12-05 22:47:13,420 INFO L495 AbstractCegarLoop]: Abstraction has has 565 places, 1955 transitions, 83103 flow [2022-12-05 22:47:13,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:13,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:47:13,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:47:13,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-05 22:47:13,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-05 22:47:13,623 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:47:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:47:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash -105480721, now seen corresponding path program 1 times [2022-12-05 22:47:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:47:13,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701073304] [2022-12-05 22:47:13,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:47:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:13,704 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-05 22:47:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:47:13,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701073304] [2022-12-05 22:47:13,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701073304] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:47:13,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473977369] [2022-12-05 22:47:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:47:13,705 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:47:13,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-05 22:47:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:13,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:47:13,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:47:13,867 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-05 22:47:13,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:47:14,070 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-05 22:47:14,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473977369] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:47:14,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:47:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:47:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742217123] [2022-12-05 22:47:14,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:47:14,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:47:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:47:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:47:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:47:14,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-05 22:47:14,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 1955 transitions, 83103 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:14,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:47:14,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-05 22:47:14,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:47:25,008 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 68 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:47:36,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:47:44,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:47:46,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:47:51,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:47:54,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:02,971 INFO L130 PetriNetUnfolder]: 7254/12615 cut-off events. [2022-12-05 22:48:02,971 INFO L131 PetriNetUnfolder]: For 2233004/2233004 co-relation queries the response was YES. [2022-12-05 22:48:03,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194515 conditions, 12615 events. 7254/12615 cut-off events. For 2233004/2233004 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 103751 event pairs, 1348 based on Foata normal form. 48/12649 useless extension candidates. Maximal degree in co-relation 194305. Up to 10433 conditions per place. [2022-12-05 22:48:03,177 INFO L137 encePairwiseOnDemand]: 8/64 looper letters, 1566 selfloop transitions, 573 changer transitions 6/2145 dead transitions. [2022-12-05 22:48:03,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 2145 transitions, 91608 flow [2022-12-05 22:48:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:48:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:48:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 182 transitions. [2022-12-05 22:48:03,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11375 [2022-12-05 22:48:03,179 INFO L175 Difference]: Start difference. First operand has 565 places, 1955 transitions, 83103 flow. Second operand 25 states and 182 transitions. [2022-12-05 22:48:03,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 2145 transitions, 91608 flow [2022-12-05 22:48:22,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 2145 transitions, 90411 flow, removed 452 selfloop flow, removed 14 redundant places. [2022-12-05 22:48:22,061 INFO L231 Difference]: Finished difference. Result has 580 places, 2022 transitions, 86994 flow [2022-12-05 22:48:22,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=82006, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=86994, PETRI_PLACES=580, PETRI_TRANSITIONS=2022} [2022-12-05 22:48:22,063 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 562 predicate places. [2022-12-05 22:48:22,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:22,063 INFO L89 Accepts]: Start accepts. Operand has 580 places, 2022 transitions, 86994 flow [2022-12-05 22:48:22,080 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:22,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:22,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 580 places, 2022 transitions, 86994 flow [2022-12-05 22:48:22,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 580 places, 2022 transitions, 86994 flow [2022-12-05 22:48:23,932 INFO L130 PetriNetUnfolder]: 1518/3936 cut-off events. [2022-12-05 22:48:23,932 INFO L131 PetriNetUnfolder]: For 685029/685446 co-relation queries the response was YES. [2022-12-05 22:48:23,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76837 conditions, 3936 events. 1518/3936 cut-off events. For 685029/685446 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 40057 event pairs, 7 based on Foata normal form. 66/3999 useless extension candidates. Maximal degree in co-relation 76625. Up to 2234 conditions per place. [2022-12-05 22:48:24,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 580 places, 2022 transitions, 86994 flow [2022-12-05 22:48:24,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 5648 [2022-12-05 22:48:24,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] L705-6-->L687-5: Formula: (and (= v_~next~0_209 v_~cur~0_342) (= (+ v_~p~0_351 3) v_~p~0_349) (< v_~x~0_387 17) (< v_~q~0_389 8) (= (+ v_~q~0_390 6) v_~q~0_389) (= (* v_~next~0_209 13) (+ (* 34 v_~cur~0_343) (* 21 v_~prev~0_402) (* 21 v_~prev~0_401))) (= v_~j~0_525 (+ v_~j~0_526 (* 6 v_~i~0_505))) (= (* 34 v_~prev~0_401) (+ (* 21 v_~next~0_209) (* 21 v_~cur~0_343) (* v_~prev~0_402 13))) (= (+ 16 v_~x~0_388) v_~x~0_387) (= (+ (* v_~j~0_525 3) v_~i~0_505) v_~i~0_503) (< v_~p~0_349 8)) InVars {~j~0=v_~j~0_526, ~prev~0=v_~prev~0_402, ~i~0=v_~i~0_505, ~q~0=v_~q~0_390, ~p~0=v_~p~0_351, ~cur~0=v_~cur~0_343, ~x~0=v_~x~0_388} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_245|, ~j~0=v_~j~0_525, ~next~0=v_~next~0_209, ~prev~0=v_~prev~0_401, ~i~0=v_~i~0_503, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_255|, ~q~0=v_~q~0_389, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_275|, ~p~0=v_~p~0_349, ~cur~0=v_~cur~0_342, ~x~0=v_~x~0_387} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74)) (< v_~q~0_32 7)) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:48:24,501 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:48:24,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2439 [2022-12-05 22:48:24,502 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 2021 transitions, 87050 flow [2022-12-05 22:48:24,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:24,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:24,502 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:24,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-05 22:48:24,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-05 22:48:24,704 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:48:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1777369864, now seen corresponding path program 1 times [2022-12-05 22:48:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:24,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413501326] [2022-12-05 22:48:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413501326] [2022-12-05 22:48:25,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413501326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211109410] [2022-12-05 22:48:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:25,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:25,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:25,051 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:48:25,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-05 22:48:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:25,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:48:25,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:25,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:48:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:48:25,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211109410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:48:25,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:48:25,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:48:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075729573] [2022-12-05 22:48:25,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:48:25,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:48:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:48:25,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:48:25,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-05 22:48:25,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 2021 transitions, 87050 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:25,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:25,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-05 22:48:25,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:48:28,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:30,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:31,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:34,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:36,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:38,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:40,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:42,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:49,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:48:52,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:49:03,542 INFO L130 PetriNetUnfolder]: 7605/13284 cut-off events. [2022-12-05 22:49:03,543 INFO L131 PetriNetUnfolder]: For 2955284/2955284 co-relation queries the response was YES. [2022-12-05 22:49:03,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206692 conditions, 13284 events. 7605/13284 cut-off events. For 2955284/2955284 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 110577 event pairs, 723 based on Foata normal form. 142/13412 useless extension candidates. Maximal degree in co-relation 206477. Up to 7902 conditions per place. [2022-12-05 22:49:03,743 INFO L137 encePairwiseOnDemand]: 8/67 looper letters, 1230 selfloop transitions, 1135 changer transitions 2/2367 dead transitions. [2022-12-05 22:49:03,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 2367 transitions, 101059 flow [2022-12-05 22:49:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-05 22:49:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-05 22:49:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 238 transitions. [2022-12-05 22:49:03,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11458834857968224 [2022-12-05 22:49:03,745 INFO L175 Difference]: Start difference. First operand has 579 places, 2021 transitions, 87050 flow. Second operand 31 states and 238 transitions. [2022-12-05 22:49:03,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 2367 transitions, 101059 flow [2022-12-05 22:49:21,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 2367 transitions, 100409 flow, removed 238 selfloop flow, removed 10 redundant places. [2022-12-05 22:49:21,103 INFO L231 Difference]: Finished difference. Result has 612 places, 2163 transitions, 97269 flow [2022-12-05 22:49:21,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=86426, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=97269, PETRI_PLACES=612, PETRI_TRANSITIONS=2163} [2022-12-05 22:49:21,105 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 594 predicate places. [2022-12-05 22:49:21,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:49:21,105 INFO L89 Accepts]: Start accepts. Operand has 612 places, 2163 transitions, 97269 flow [2022-12-05 22:49:21,124 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:49:21,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:49:21,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 612 places, 2163 transitions, 97269 flow [2022-12-05 22:49:21,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 612 places, 2163 transitions, 97269 flow [2022-12-05 22:49:23,397 INFO L130 PetriNetUnfolder]: 1584/4134 cut-off events. [2022-12-05 22:49:23,397 INFO L131 PetriNetUnfolder]: For 754926/755325 co-relation queries the response was YES. [2022-12-05 22:49:23,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83703 conditions, 4134 events. 1584/4134 cut-off events. For 754926/755325 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 42609 event pairs, 3 based on Foata normal form. 66/4197 useless extension candidates. Maximal degree in co-relation 83478. Up to 2376 conditions per place. [2022-12-05 22:49:23,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 612 places, 2163 transitions, 97269 flow [2022-12-05 22:49:23,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 5986 [2022-12-05 22:49:23,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:49:23,596 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2491 [2022-12-05 22:49:23,596 INFO L495 AbstractCegarLoop]: Abstraction has has 612 places, 2163 transitions, 97291 flow [2022-12-05 22:49:23,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:49:23,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:49:23,596 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:49:23,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-05 22:49:23,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:49:23,800 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:49:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:49:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash -60377147, now seen corresponding path program 1 times [2022-12-05 22:49:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:49:23,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765030959] [2022-12-05 22:49:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:49:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:23,881 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-05 22:49:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:49:23,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765030959] [2022-12-05 22:49:23,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765030959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:49:23,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935791558] [2022-12-05 22:49:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:49:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:49:23,883 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:49:23,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-05 22:49:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:24,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:49:24,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:49:24,216 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-05 22:49:24,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:49:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:49:24,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935791558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:49:24,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:49:24,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:49:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365077365] [2022-12-05 22:49:24,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:49:24,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:49:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:49:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:49:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:49:24,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-05 22:49:24,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 2163 transitions, 97291 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:49:24,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:49:24,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-05 22:49:24,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:49:29,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:49:43,821 INFO L130 PetriNetUnfolder]: 7843/13770 cut-off events. [2022-12-05 22:49:43,822 INFO L131 PetriNetUnfolder]: For 3051044/3051044 co-relation queries the response was YES. [2022-12-05 22:49:43,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221148 conditions, 13770 events. 7843/13770 cut-off events. For 3051044/3051044 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 116064 event pairs, 1633 based on Foata normal form. 112/13868 useless extension candidates. Maximal degree in co-relation 220920. Up to 10578 conditions per place. [2022-12-05 22:49:44,043 INFO L137 encePairwiseOnDemand]: 9/68 looper letters, 1589 selfloop transitions, 809 changer transitions 3/2401 dead transitions. [2022-12-05 22:49:44,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 2401 transitions, 108743 flow [2022-12-05 22:49:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:49:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:49:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 167 transitions. [2022-12-05 22:49:44,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1169467787114846 [2022-12-05 22:49:44,045 INFO L175 Difference]: Start difference. First operand has 612 places, 2163 transitions, 97291 flow. Second operand 21 states and 167 transitions. [2022-12-05 22:49:44,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 2401 transitions, 108743 flow [2022-12-05 22:50:08,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 2401 transitions, 105309 flow, removed 1649 selfloop flow, removed 5 redundant places. [2022-12-05 22:50:08,232 INFO L231 Difference]: Finished difference. Result has 632 places, 2266 transitions, 102240 flow [2022-12-05 22:50:08,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=94095, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=102240, PETRI_PLACES=632, PETRI_TRANSITIONS=2266} [2022-12-05 22:50:08,233 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 614 predicate places. [2022-12-05 22:50:08,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:08,233 INFO L89 Accepts]: Start accepts. Operand has 632 places, 2266 transitions, 102240 flow [2022-12-05 22:50:08,256 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:08,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:08,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 632 places, 2266 transitions, 102240 flow [2022-12-05 22:50:08,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 2266 transitions, 102240 flow [2022-12-05 22:50:10,611 INFO L130 PetriNetUnfolder]: 1661/4340 cut-off events. [2022-12-05 22:50:10,611 INFO L131 PetriNetUnfolder]: For 781003/781534 co-relation queries the response was YES. [2022-12-05 22:50:10,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87020 conditions, 4340 events. 1661/4340 cut-off events. For 781003/781534 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 44907 event pairs, 6 based on Foata normal form. 64/4401 useless extension candidates. Maximal degree in co-relation 86790. Up to 2510 conditions per place. [2022-12-05 22:50:10,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 632 places, 2266 transitions, 102240 flow [2022-12-05 22:50:10,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 6218 [2022-12-05 22:50:10,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L705-6-->L695-5: Formula: (and (= (* 34 v_~prev~0_391) (+ (* 21 v_~cur~0_334) (* 21 v_~next~0_204) (* v_~prev~0_392 13))) (= (* v_~next~0_204 13) (+ (* 21 v_~prev~0_392) (* 21 v_~prev~0_391) (* 34 v_~cur~0_334))) (= (+ (* 13 v_~i~0_490) (* v_~j~0_513 2)) v_~i~0_489) (= v_~next~0_204 v_~cur~0_333) (= v_~x~0_377 (+ 16 v_~x~0_378)) (= v_~p~0_336 (+ v_~p~0_337 2)) (< v_~x~0_377 17) (= (+ 7 v_~q~0_378) v_~q~0_376) (= v_~j~0_511 (+ v_~j~0_513 (* 6 v_~i~0_490) v_~i~0_489)) (< v_~p~0_337 6) (< v_~q~0_378 1)) InVars {~j~0=v_~j~0_513, ~prev~0=v_~prev~0_392, ~i~0=v_~i~0_490, ~q~0=v_~q~0_378, ~p~0=v_~p~0_337, ~cur~0=v_~cur~0_334, ~x~0=v_~x~0_378} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_239|, ~j~0=v_~j~0_511, ~next~0=v_~next~0_204, ~prev~0=v_~prev~0_391, ~i~0=v_~i~0_489, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_246|, ~q~0=v_~q~0_376, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_266|, ~p~0=v_~p~0_336, ~cur~0=v_~cur~0_333, ~x~0=v_~x~0_377} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:50:10,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] L705-6-->L695-5: Formula: (and (< v_~q~0_399 8) (= (+ 7 v_~q~0_401) v_~q~0_399) (= (+ 16 v_~x~0_396) v_~x~0_395) (< v_~x~0_395 17) (= (+ (* 34 v_~cur~0_351) (* 21 v_~prev~0_409) (* 21 v_~prev~0_410)) (* v_~next~0_213 13)) (= (+ (* 21 v_~next~0_213) (* 21 v_~cur~0_351) (* v_~prev~0_410 13)) (* 34 v_~prev~0_409)) (= (+ (* v_~j~0_539 3) (* 19 v_~i~0_518)) v_~i~0_517) (= v_~j~0_537 (+ v_~j~0_539 (* 6 v_~i~0_518) v_~i~0_517)) (= v_~p~0_361 (+ v_~p~0_362 3)) (= v_~next~0_213 v_~cur~0_350) (< v_~p~0_361 8)) InVars {~j~0=v_~j~0_539, ~prev~0=v_~prev~0_410, ~i~0=v_~i~0_518, ~q~0=v_~q~0_401, ~p~0=v_~p~0_362, ~cur~0=v_~cur~0_351, ~x~0=v_~x~0_396} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_249|, ~j~0=v_~j~0_537, ~next~0=v_~next~0_213, ~prev~0=v_~prev~0_409, ~i~0=v_~i~0_517, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_263|, ~q~0=v_~q~0_399, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_281|, ~p~0=v_~p~0_361, ~cur~0=v_~cur~0_350, ~x~0=v_~x~0_395} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~q~0, t2Thread1of1ForFork0_#t~post2, ~p~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (< v_~p~0_34 7) (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:50:11,071 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:50:11,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2838 [2022-12-05 22:50:11,072 INFO L495 AbstractCegarLoop]: Abstraction has has 629 places, 2263 transitions, 102142 flow [2022-12-05 22:50:11,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:11,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:11,072 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:11,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-05 22:50:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-05 22:50:11,272 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:50:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1032989432, now seen corresponding path program 1 times [2022-12-05 22:50:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:11,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870282049] [2022-12-05 22:50:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:11,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870282049] [2022-12-05 22:50:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870282049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001454573] [2022-12-05 22:50:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:11,365 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:50:11,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-05 22:50:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:11,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:50:11,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:11,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:50:11,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001454573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:11,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:11,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:50:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590456594] [2022-12-05 22:50:11,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:11,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:50:11,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:50:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:50:11,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-05 22:50:11,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 2263 transitions, 102142 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:11,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:11,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-05 22:50:11,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:20,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:50:22,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:50:27,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:50:29,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:50:31,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:50:33,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:50:46,796 INFO L130 PetriNetUnfolder]: 7897/13896 cut-off events. [2022-12-05 22:50:46,796 INFO L131 PetriNetUnfolder]: For 2608086/2608086 co-relation queries the response was YES. [2022-12-05 22:50:46,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222473 conditions, 13896 events. 7897/13896 cut-off events. For 2608086/2608086 co-relation queries the response was YES. Maximal size of possible extension queue 1551. Compared 117785 event pairs, 1606 based on Foata normal form. 26/13908 useless extension candidates. Maximal degree in co-relation 222240. Up to 11524 conditions per place. [2022-12-05 22:50:47,054 INFO L137 encePairwiseOnDemand]: 8/68 looper letters, 1808 selfloop transitions, 628 changer transitions 3/2439 dead transitions. [2022-12-05 22:50:47,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 2439 transitions, 110752 flow [2022-12-05 22:50:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 22:50:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 22:50:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 204 transitions. [2022-12-05 22:50:47,055 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10344827586206896 [2022-12-05 22:50:47,055 INFO L175 Difference]: Start difference. First operand has 629 places, 2263 transitions, 102142 flow. Second operand 29 states and 204 transitions. [2022-12-05 22:50:47,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 2439 transitions, 110752 flow [2022-12-05 22:51:13,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 2439 transitions, 108786 flow, removed 923 selfloop flow, removed 6 redundant places. [2022-12-05 22:51:13,454 INFO L231 Difference]: Finished difference. Result has 656 places, 2313 transitions, 104890 flow [2022-12-05 22:51:13,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=100248, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=104890, PETRI_PLACES=656, PETRI_TRANSITIONS=2313} [2022-12-05 22:51:13,456 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 638 predicate places. [2022-12-05 22:51:13,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:51:13,456 INFO L89 Accepts]: Start accepts. Operand has 656 places, 2313 transitions, 104890 flow [2022-12-05 22:51:13,475 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:51:13,475 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:51:13,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 656 places, 2313 transitions, 104890 flow [2022-12-05 22:51:13,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 656 places, 2313 transitions, 104890 flow [2022-12-05 22:51:15,807 INFO L130 PetriNetUnfolder]: 1671/4383 cut-off events. [2022-12-05 22:51:15,807 INFO L131 PetriNetUnfolder]: For 813720/814191 co-relation queries the response was YES. [2022-12-05 22:51:15,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88258 conditions, 4383 events. 1671/4383 cut-off events. For 813720/814191 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 45485 event pairs, 6 based on Foata normal form. 64/4444 useless extension candidates. Maximal degree in co-relation 88024. Up to 2540 conditions per place. [2022-12-05 22:51:15,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 656 places, 2313 transitions, 104890 flow [2022-12-05 22:51:15,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 6296 [2022-12-05 22:51:16,324 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:51:16,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2869 [2022-12-05 22:51:16,325 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 2313 transitions, 105097 flow [2022-12-05 22:51:16,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:51:16,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:51:16,325 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:51:16,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-05 22:51:16,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-05 22:51:16,525 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:51:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:51:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1028788901, now seen corresponding path program 1 times [2022-12-05 22:51:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:51:16,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327666376] [2022-12-05 22:51:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:51:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:51:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:51:16,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327666376] [2022-12-05 22:51:16,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327666376] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:51:16,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299253452] [2022-12-05 22:51:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:16,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:51:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:51:16,620 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:51:16,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-05 22:51:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:16,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:51:16,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:51:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:51:16,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:51:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:51:17,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299253452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:51:17,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:51:17,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:51:17,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584391518] [2022-12-05 22:51:17,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:51:17,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:51:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:51:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:51:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:51:17,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-05 22:51:17,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 2313 transitions, 105097 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:51:17,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:51:17,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-05 22:51:17,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:51:30,501 WARN L233 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 74 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:51:35,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:39,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:41,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:43,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:46,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:53,187 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 76 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:51:56,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:51:58,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:52:00,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-05 22:52:01,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 22:52:01,468 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-05 22:52:02,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:52:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:52:02,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:52:02,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:02,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-05 22:52:02,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-05 22:52:02,621 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 3359 conditions, 356 events (189/355 cut-off events. For 10938/10938 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 2315 event pairs, 13 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 3137. Up to 183 conditions per place.). [2022-12-05 22:52:02,622 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:52:02,622 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:52:02,623 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 22:52:02,624 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:52:02,624 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:52:02,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:52:02 BasicIcfg [2022-12-05 22:52:02,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:52:02,626 INFO L158 Benchmark]: Toolchain (without parser) took 810497.56ms. Allocated memory was 195.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 170.1MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 847.4MB. Max. memory is 8.0GB. [2022-12-05 22:52:02,626 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 109.7MB in the beginning and 109.6MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:52:02,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.84ms. Allocated memory is still 195.0MB. Free memory was 170.1MB in the beginning and 149.5MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 22:52:02,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.40ms. Allocated memory is still 195.0MB. Free memory was 149.5MB in the beginning and 147.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:02,627 INFO L158 Benchmark]: Boogie Preprocessor took 33.46ms. Allocated memory is still 195.0MB. Free memory was 147.8MB in the beginning and 146.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:02,627 INFO L158 Benchmark]: RCFGBuilder took 321.19ms. Allocated memory is still 195.0MB. Free memory was 146.0MB in the beginning and 168.3MB in the end (delta: -22.3MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-12-05 22:52:02,627 INFO L158 Benchmark]: TraceAbstraction took 809704.21ms. Allocated memory was 195.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 167.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 844.7MB. Max. memory is 8.0GB. [2022-12-05 22:52:02,628 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 109.7MB in the beginning and 109.6MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.84ms. Allocated memory is still 195.0MB. Free memory was 170.1MB in the beginning and 149.5MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.40ms. Allocated memory is still 195.0MB. Free memory was 149.5MB in the beginning and 147.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.46ms. Allocated memory is still 195.0MB. Free memory was 147.8MB in the beginning and 146.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 321.19ms. Allocated memory is still 195.0MB. Free memory was 146.0MB in the beginning and 168.3MB in the end (delta: -22.3MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * TraceAbstraction took 809704.21ms. Allocated memory was 195.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 167.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 844.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 91 PlacesBefore, 18 PlacesAfterwards, 91 TransitionsBefore, 14 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 1109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1122, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1096, unknown conditional: 0, unknown unconditional: 1096] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1936, Positive conditional cache size: 0, Positive unconditional cache size: 1936, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 18 PlacesBefore, 18 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 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.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 42, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 102, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 180, Positive conditional cache size: 180, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 216, Positive conditional cache size: 216, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 252, Positive conditional cache size: 252, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 288, Positive conditional cache size: 288, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 27 PlacesBefore, 26 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 320, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 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): 320, Positive cache size: 320, Positive conditional cache size: 320, 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.3s, 37 PlacesBefore, 37 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 20, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 448, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 232 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): 448, Positive cache size: 448, Positive conditional cache size: 448, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 380 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): 448, Positive cache size: 448, Positive conditional cache size: 448, 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, 45 PlacesBefore, 45 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 284 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): 448, Positive cache size: 448, Positive conditional cache size: 448, 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.2s, 56 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 452, Positive conditional cache size: 452, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 515, Positive conditional cache size: 515, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 683, Positive conditional cache size: 683, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 93 PlacesBefore, 93 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 808, Positive cache size: 808, Positive conditional cache size: 808, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 880, Positive conditional cache size: 880, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 121 PlacesBefore, 121 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 1006, Positive conditional cache size: 1006, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1083, Positive cache size: 1083, Positive conditional cache size: 1083, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 1026 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): 1083, Positive cache size: 1083, Positive conditional cache size: 1083, 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, 166 PlacesBefore, 166 PlacesAfterwards, 345 TransitionsBefore, 345 TransitionsAfterwards, 1078 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): 1083, Positive cache size: 1083, Positive conditional cache size: 1083, 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, 180 PlacesBefore, 180 PlacesAfterwards, 393 TransitionsBefore, 393 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1216, Positive cache size: 1216, Positive conditional cache size: 1216, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 182 PlacesBefore, 182 PlacesAfterwards, 407 TransitionsBefore, 407 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 12, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1226, Positive conditional cache size: 1226, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 206 PlacesBefore, 206 PlacesAfterwards, 474 TransitionsBefore, 474 TransitionsAfterwards, 1434 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): 1226, Positive cache size: 1226, Positive conditional cache size: 1226, 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.4s, 223 PlacesBefore, 222 PlacesAfterwards, 493 TransitionsBefore, 492 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 11, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1438, Positive cache size: 1438, Positive conditional cache size: 1438, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 251 PlacesBefore, 251 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1851, Positive cache size: 1851, Positive conditional cache size: 1851, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 263 PlacesBefore, 262 PlacesAfterwards, 636 TransitionsBefore, 635 TransitionsAfterwards, 1808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1933, Positive cache size: 1933, Positive conditional cache size: 1933, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 287 PlacesBefore, 287 PlacesAfterwards, 733 TransitionsBefore, 733 TransitionsAfterwards, 2058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2128, Positive cache size: 2128, Positive conditional cache size: 2128, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 284 PlacesBefore, 284 PlacesAfterwards, 730 TransitionsBefore, 730 TransitionsAfterwards, 2056 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): 2128, Positive cache size: 2128, Positive conditional cache size: 2128, 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, 301 PlacesBefore, 301 PlacesAfterwards, 763 TransitionsBefore, 763 TransitionsAfterwards, 2120 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): 2128, Positive cache size: 2128, Positive conditional cache size: 2128, 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, 326 PlacesBefore, 326 PlacesAfterwards, 823 TransitionsBefore, 823 TransitionsAfterwards, 2238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2186, Positive cache size: 2186, Positive conditional cache size: 2186, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 351 PlacesBefore, 351 PlacesAfterwards, 885 TransitionsBefore, 885 TransitionsAfterwards, 2380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2250, Positive cache size: 2250, Positive conditional cache size: 2250, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 351 PlacesBefore, 351 PlacesAfterwards, 886 TransitionsBefore, 886 TransitionsAfterwards, 2468 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): 2250, Positive cache size: 2250, Positive conditional cache size: 2250, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 373 PlacesBefore, 373 PlacesAfterwards, 1007 TransitionsBefore, 1007 TransitionsAfterwards, 2778 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): 2250, Positive cache size: 2250, Positive conditional cache size: 2250, 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, 384 PlacesBefore, 383 PlacesAfterwards, 1073 TransitionsBefore, 1072 TransitionsAfterwards, 2930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 389 PlacesBefore, 389 PlacesAfterwards, 1101 TransitionsBefore, 1101 TransitionsAfterwards, 2974 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 395 PlacesBefore, 395 PlacesAfterwards, 1124 TransitionsBefore, 1124 TransitionsAfterwards, 3160 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 403 PlacesBefore, 403 PlacesAfterwards, 1137 TransitionsBefore, 1137 TransitionsAfterwards, 3346 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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, 451 PlacesBefore, 451 PlacesAfterwards, 1273 TransitionsBefore, 1273 TransitionsAfterwards, 3710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2447, Positive cache size: 2447, Positive conditional cache size: 2447, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 466 PlacesBefore, 466 PlacesAfterwards, 1309 TransitionsBefore, 1309 TransitionsAfterwards, 3768 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): 2447, Positive cache size: 2447, Positive conditional cache size: 2447, 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, 490 PlacesBefore, 490 PlacesAfterwards, 1468 TransitionsBefore, 1468 TransitionsAfterwards, 4310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2525, Positive cache size: 2525, Positive conditional cache size: 2525, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 520 PlacesBefore, 518 PlacesAfterwards, 1635 TransitionsBefore, 1633 TransitionsAfterwards, 4716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2669, Positive cache size: 2669, Positive conditional cache size: 2669, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 548 PlacesBefore, 548 PlacesAfterwards, 1853 TransitionsBefore, 1853 TransitionsAfterwards, 5332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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): 2670, Positive cache size: 2670, Positive conditional cache size: 2670, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 567 PlacesBefore, 565 PlacesAfterwards, 1957 TransitionsBefore, 1955 TransitionsAfterwards, 5538 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2757, Positive cache size: 2757, Positive conditional cache size: 2757, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 580 PlacesBefore, 579 PlacesAfterwards, 2022 TransitionsBefore, 2021 TransitionsAfterwards, 5648 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2837, Positive cache size: 2837, Positive conditional cache size: 2837, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 612 PlacesBefore, 612 PlacesAfterwards, 2163 TransitionsBefore, 2163 TransitionsAfterwards, 5986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2839, Positive cache size: 2839, Positive conditional cache size: 2839, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 632 PlacesBefore, 629 PlacesAfterwards, 2266 TransitionsBefore, 2263 TransitionsAfterwards, 6218 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2842, Positive cache size: 2842, Positive conditional cache size: 2842, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 656 PlacesBefore, 656 PlacesAfterwards, 2313 TransitionsBefore, 2313 TransitionsAfterwards, 6296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 8, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3291, Positive conditional cache size: 3291, 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: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 3359 conditions, 356 events (189/355 cut-off events. For 10938/10938 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 2315 event pairs, 13 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 3137. Up to 183 conditions per place.). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 3359 conditions, 356 events (189/355 cut-off events. For 10938/10938 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 2315 event pairs, 13 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 3137. Up to 183 conditions per place.). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 3359 conditions, 356 events (189/355 cut-off events. For 10938/10938 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 2315 event pairs, 13 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 3137. Up to 183 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 809.6s, OverallIterations: 50, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 747.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 79 mSolverCounterUnknown, 4954 SdHoareTripleChecker+Valid, 278.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4954 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 275.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18775 IncrementalHoareTripleChecker+Invalid, 25137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6283 mSolverCounterUnsat, 0 mSDtfsCounter, 18775 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1508 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 1003 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5996 ImplicationChecksByTransitivity, 188.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105097occurred in iteration=49, InterpolantAutomatonStates: 735, 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.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 1009 NumberOfCodeBlocks, 1009 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 1311 ConstructedInterpolants, 275 QuantifiedInterpolants, 33643 SizeOfPredicates, 35 NumberOfNonLiveVariables, 6904 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 136 InterpolantComputations, 9 PerfectInterpolantSequences, 50/367 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