/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-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:38:30,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:38:30,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:38:30,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:38:30,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:38:30,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:38:30,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:38:30,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:38:30,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:38:30,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:38:30,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:38:30,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:38:30,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:38:30,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:38:30,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:38:30,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:38:30,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:38:30,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:38:30,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:38:30,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:38:30,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:38:30,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:38:30,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:38:30,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:38:30,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:38:30,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:38:30,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:38:30,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:38:30,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:38:30,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:38:30,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:38:30,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:38:30,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:38:30,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:38:30,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:38:30,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:38:30,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:38:30,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:38:30,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:38:30,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:38:30,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:38:30,816 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,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:38:30,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:38:30,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:38:30,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:38:30,835 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:38:30,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:38:30,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:38:30,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:30,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:38:30,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:38:30,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:38:30,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:38:30,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:38:30,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:38:30,838 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:31,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:38:31,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:38:31,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:38:31,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:38:31,120 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:38:31,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-12-05 22:38:32,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:38:32,294 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:38:32,295 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-12-05 22:38:32,306 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992d6edbd/28a30c8a694c48509fe9fa59cb96d321/FLAG5a1e69038 [2022-12-05 22:38:32,316 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992d6edbd/28a30c8a694c48509fe9fa59cb96d321 [2022-12-05 22:38:32,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:38:32,319 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:38:32,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:38:32,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:38:32,322 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,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d8cd94 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,323 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,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:38:32,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:38:32,559 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-5.i[30243,30256] [2022-12-05 22:38:32,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,587 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:38:32,613 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-5.i[30243,30256] [2022-12-05 22:38:32,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,658 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:38:32,658 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,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:32,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:38:32,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:38:32,664 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,687 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,707 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-05 22:38:32,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:32,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:38:32,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:38:32,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:38:32,715 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,716 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,720 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,720 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,735 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,737 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,738 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,739 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,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:38:32,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:38:32,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:38:32,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:38:32,742 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,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:32,794 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,800 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,822 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:38:32,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:38:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:38:32,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:38:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:38:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:38:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:38:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:38:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:38:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:38:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:38:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:38:32,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:38:32,824 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,903 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:38:32,904 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:38:33,030 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:38:33,035 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:38:33,035 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 22:38:33,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:33 BoogieIcfgContainer [2022-12-05 22:38:33,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:38:33,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:38:33,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:38:33,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:38:33,058 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:33,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4713c50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:33, skipping insertion in model container [2022-12-05 22:38:33,058 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:33,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4713c50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:33, skipping insertion in model container [2022-12-05 22:38:33,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:33" (3/3) ... [2022-12-05 22:38:33,060 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-12-05 22:38:33,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:38:33,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:38:33,072 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:38:33,145 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:38:33,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,241 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,245 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,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:33,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,284 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,286 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,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-05 22:38:36,236 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-05 22:38:36,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:38:36,259 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;@3c72a46e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:38:36,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:38:36,263 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-05 22:38:36,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:36,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,265 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,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-05 22:38:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811763121] [2022-12-05 22:38:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,444 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,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811763121] [2022-12-05 22:38:36,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811763121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:36,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:36,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:38:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015202213] [2022-12-05 22:38:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:36,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:36,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:36,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:36,465 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,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:36,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:36,511 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:36,511 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:38:36,511 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,513 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-05 22:38:36,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 22:38:36,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-05 22:38:36,522 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,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:36,524 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,525 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,526 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,528 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-05 22:38:36,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:36,529 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,531 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:36,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:36,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:36,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,534 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-05 22:38:36,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:36,535 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,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 22:38:36,535 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:36,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:38:36,536 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:36,537 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,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:36,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:36,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:38:36,537 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,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-05 22:38:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73454579] [2022-12-05 22:38:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,593 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,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73454579] [2022-12-05 22:38:36,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73454579] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467318065] [2022-12-05 22:38:36,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:36,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:36,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:36,597 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,697 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,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:36,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:36,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:36,757 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,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:36,780 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,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467318065] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:36,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:36,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394919167] [2022-12-05 22:38:36,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:36,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:36,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:38:36,783 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,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:36,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:38:36,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:36,875 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:36,875 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:36,876 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,877 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:36,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:36,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:36,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-05 22:38:36,887 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,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:36,888 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,889 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,889 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,889 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:36,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:36,889 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,890 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:36,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:36,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,893 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:36,893 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:36,893 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,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:36,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:37,083 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:37,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-05 22:38:37,084 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:37,085 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,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 22:38:37,289 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,289 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,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-05 22:38:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966590128] [2022-12-05 22:38:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,329 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,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966590128] [2022-12-05 22:38:37,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966590128] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067182479] [2022-12-05 22:38:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:37,331 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,337 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,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:37,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:37,407 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,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:37,415 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,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067182479] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:37,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:37,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344562910] [2022-12-05 22:38:37,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:37,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:37,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:37,417 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,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:37,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:37,474 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:37,474 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:37,476 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,479 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:37,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:37,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:37,481 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,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:37,485 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,486 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,488 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,494 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:37,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:37,494 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,495 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:37,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:37,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,497 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:37,497 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:37,497 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,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:37,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:37,655 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:37,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-05 22:38:37,656 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:37,656 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,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 22:38:37,856 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,857 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,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-05 22:38:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605528465] [2022-12-05 22:38:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,894 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,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605528465] [2022-12-05 22:38:37,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605528465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:37,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795551903] [2022-12-05 22:38:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:37,896 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,898 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,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:37,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:37,955 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,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:37,964 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,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795551903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:37,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:37,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399270704] [2022-12-05 22:38:37,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:37,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:37,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:37,966 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,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:37,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,006 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:38,006 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-05 22:38:38,007 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,007 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:38,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:38,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:38,008 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,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:38,009 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,010 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,010 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,010 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:38,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,010 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,011 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,013 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:38,013 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,013 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,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:38,144 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:38,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-05 22:38:38,146 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:38,146 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,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 22:38:38,350 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,351 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,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149196, now seen corresponding path program 1 times [2022-12-05 22:38:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814310288] [2022-12-05 22:38:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,404 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,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814310288] [2022-12-05 22:38:38,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814310288] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988499741] [2022-12-05 22:38:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,405 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,437 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,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,488 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,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,495 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,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988499741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:38,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402838857] [2022-12-05 22:38:38,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:38,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:38,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,496 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,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,535 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:38,535 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:38,535 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:38,536 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:38,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:38,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:38,537 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,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:38,538 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,538 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,538 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,539 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:38,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,539 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,539 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,541 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:38,541 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,541 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,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:38,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:38,666 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:38,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-05 22:38:38,666 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:38,666 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,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,690 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,870 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,871 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,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149134, now seen corresponding path program 1 times [2022-12-05 22:38:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188326142] [2022-12-05 22:38:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,906 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,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188326142] [2022-12-05 22:38:38,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188326142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914742799] [2022-12-05 22:38:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,907 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,935 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,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,978 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,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,986 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,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914742799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-05 22:38:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379631030] [2022-12-05 22:38:38,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:38:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:38:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:38:38,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:38,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:39,023 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:39,023 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-05 22:38:39,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 149 events. 97/149 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 20 based on Foata normal form. 9/126 useless extension candidates. Maximal degree in co-relation 399. Up to 64 conditions per place. [2022-12-05 22:38:39,024 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-05 22:38:39,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-05 22:38:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-05 22:38:39,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 22:38:39,024 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-05 22:38:39,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-05 22:38:39,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:39,025 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,025 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-05 22:38:39,026 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-05 22:38:39,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:39,026 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,026 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:39,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:39,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,028 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-05 22:38:39,028 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:39,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 15 events. 3/15 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/12 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2022-12-05 22:38:39,028 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:39,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-05 22:38:39,086 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:38:39,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-05 22:38:39,086 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-05 22:38:39,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:39,087 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:39,087 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:39,091 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,291 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,291 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,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149103, now seen corresponding path program 1 times [2022-12-05 22:38:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79836826] [2022-12-05 22:38:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,384 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,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79836826] [2022-12-05 22:38:39,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79836826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636615746] [2022-12-05 22:38:39,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:39,385 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,387 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,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:38:39,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:39,476 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,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:39,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:39,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636615746] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:39,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-05 22:38:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688478338] [2022-12-05 22:38:39,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:39,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:38:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:38:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:38:39,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:39,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 50 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:39,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:39,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:39,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:41,849 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:41,899 INFO L130 PetriNetUnfolder]: 265/405 cut-off events. [2022-12-05 22:38:41,899 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-05 22:38:41,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 405 events. 265/405 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1301 event pairs, 28 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1045. Up to 167 conditions per place. [2022-12-05 22:38:41,901 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 46 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-05 22:38:41,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 65 transitions, 326 flow [2022-12-05 22:38:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:38:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:38:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-05 22:38:41,912 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 22:38:41,912 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-05 22:38:41,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 65 transitions, 326 flow [2022-12-05 22:38:41,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 65 transitions, 294 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 22:38:41,914 INFO L231 Difference]: Finished difference. Result has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:41,914 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:41,914 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-05 22:38:41,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:41,914 INFO L89 Accepts]: Start accepts. Operand has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:41,915 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:41,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:41,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:41,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:41,919 INFO L130 PetriNetUnfolder]: 35/76 cut-off events. [2022-12-05 22:38:41,919 INFO L131 PetriNetUnfolder]: For 40/42 co-relation queries the response was YES. [2022-12-05 22:38:41,919 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 212 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:41,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:41,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-05 22:38:41,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:41,969 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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,222 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:42,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-05 22:38:42,223 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 33 transitions, 181 flow [2022-12-05 22:38:42,223 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,223 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:42,223 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:42,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:42,423 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:42,424 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:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148917, now seen corresponding path program 1 times [2022-12-05 22:38:42,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:42,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003795728] [2022-12-05 22:38:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,448 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,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:42,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003795728] [2022-12-05 22:38:42,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003795728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:42,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:42,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:38:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457634610] [2022-12-05 22:38:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:42,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:42,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:38:42,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 33 transitions, 181 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,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:42,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:38:42,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:42,488 INFO L130 PetriNetUnfolder]: 180/286 cut-off events. [2022-12-05 22:38:42,488 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-05 22:38:42,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 286 events. 180/286 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 897 event pairs, 63 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 818. Up to 155 conditions per place. [2022-12-05 22:38:42,489 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 6 changer transitions 2/33 dead transitions. [2022-12-05 22:38:42,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 227 flow [2022-12-05 22:38:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 22:38:42,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-05 22:38:42,491 INFO L175 Difference]: Start difference. First operand has 27 places, 33 transitions, 181 flow. Second operand 3 states and 26 transitions. [2022-12-05 22:38:42,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 227 flow [2022-12-05 22:38:42,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 215 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-05 22:38:42,492 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 131 flow [2022-12-05 22:38:42,492 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-05 22:38:42,494 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-05 22:38:42,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:42,495 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 131 flow [2022-12-05 22:38:42,495 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:42,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:42,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 131 flow [2022-12-05 22:38:42,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 131 flow [2022-12-05 22:38:42,500 INFO L130 PetriNetUnfolder]: 26/58 cut-off events. [2022-12-05 22:38:42,500 INFO L131 PetriNetUnfolder]: For 66/68 co-relation queries the response was YES. [2022-12-05 22:38:42,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 58 events. 26/58 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 137. Up to 33 conditions per place. [2022-12-05 22:38:42,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 131 flow [2022-12-05 22:38:42,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 22:38:42,502 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:42,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 22:38:42,505 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 131 flow [2022-12-05 22:38:42,506 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,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:42,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:42,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:38:42,506 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,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1106078701, now seen corresponding path program 1 times [2022-12-05 22:38:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:42,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997182808] [2022-12-05 22:38:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,649 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:42,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:42,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997182808] [2022-12-05 22:38:42,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997182808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:42,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589686302] [2022-12-05 22:38:42,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:42,651 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:42,653 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:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:42,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:42,766 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:42,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:43,083 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,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589686302] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:43,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:43,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729086527] [2022-12-05 22:38:43,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:43,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:43,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:43,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:38:43,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 131 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,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:43,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:38:43,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:45,698 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:45,860 INFO L130 PetriNetUnfolder]: 350/539 cut-off events. [2022-12-05 22:38:45,860 INFO L131 PetriNetUnfolder]: For 665/665 co-relation queries the response was YES. [2022-12-05 22:38:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 539 events. 350/539 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1931 event pairs, 25 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1582. Up to 219 conditions per place. [2022-12-05 22:38:45,862 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-05 22:38:45,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 101 transitions, 612 flow [2022-12-05 22:38:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:38:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:38:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-05 22:38:45,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-05 22:38:45,864 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 131 flow. Second operand 12 states and 100 transitions. [2022-12-05 22:38:45,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 101 transitions, 612 flow [2022-12-05 22:38:45,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 101 transitions, 576 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:45,866 INFO L231 Difference]: Finished difference. Result has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,866 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:45,867 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-05 22:38:45,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:45,867 INFO L89 Accepts]: Start accepts. Operand has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,867 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:45,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:45,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,873 INFO L130 PetriNetUnfolder]: 52/109 cut-off events. [2022-12-05 22:38:45,873 INFO L131 PetriNetUnfolder]: For 129/133 co-relation queries the response was YES. [2022-12-05 22:38:45,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 109 events. 52/109 cut-off events. For 129/133 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 346 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:45,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-05 22:38:45,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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_~x~0_22 12) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) 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:46,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] L705-6-->L687-5: Formula: (and (= (+ v_~j~0_125 v_~i~0_110) v_~i~0_109) (= v_~p~0_43 (+ v_~p~0_44 1)) (< v_~p~0_44 5) (= v_~cur~0_127 v_~next~0_80) (= (+ 12 v_~x~0_141) v_~x~0_140) (< v_~x~0_141 1) (= (* 2 v_~next~0_80) (+ (* 34 v_~cur~0_128) (* 21 v_~prev~0_157) (* 3 v_~prev~0_156))) (= (* 5 v_~prev~0_156) (+ (* 3 v_~next~0_80) (* v_~prev~0_157 13) (* 21 v_~cur~0_128)))) InVars {~j~0=v_~j~0_125, ~prev~0=v_~prev~0_157, ~i~0=v_~i~0_110, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_128, ~x~0=v_~x~0_141} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_85|, ~j~0=v_~j~0_125, ~next~0=v_~next~0_80, ~prev~0=v_~prev~0_156, ~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_127, ~x~0=v_~x~0_140} 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_~x~0_22 12) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) 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:46,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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 [343] L705-6-->L687-5: Formula: (and (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (< v_~p~0_40 5) (= (* 2 v_~next~0_72) (+ (* 21 v_~prev~0_143) (* 3 v_~prev~0_142) (* 34 v_~cur~0_114))) (= (+ 12 v_~x~0_127) v_~x~0_126) (= v_~p~0_39 (+ v_~p~0_40 1)) (= v_~cur~0_113 v_~next~0_72) (= (+ (* 21 v_~cur~0_114) (* v_~prev~0_143 13) (* 3 v_~next~0_72)) (* 5 v_~prev~0_142)) (< v_~x~0_127 1)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_143, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_114, ~x~0=v_~x~0_127} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_77|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_72, ~prev~0=v_~prev~0_142, ~i~0=v_~i~0_103, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_113, ~x~0=v_~x~0_126} 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:46,204 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:46,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-05 22:38:46,205 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 55 transitions, 403 flow [2022-12-05 22:38:46,205 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:46,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:46,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:46,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-05 22:38:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:46,406 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:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1421157024, now seen corresponding path program 1 times [2022-12-05 22:38:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:46,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146946284] [2022-12-05 22:38:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:46,424 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:46,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:46,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146946284] [2022-12-05 22:38:46,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146946284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:46,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:46,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:38:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235738876] [2022-12-05 22:38:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:46,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:38:46,426 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:46,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:46,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:38:46,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:46,470 INFO L130 PetriNetUnfolder]: 285/446 cut-off events. [2022-12-05 22:38:46,470 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-05 22:38:46,470 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 1554 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:46,472 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-05 22:38:46,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 511 flow [2022-12-05 22:38:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 22:38:46,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 22:38:46,473 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:46,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 511 flow [2022-12-05 22:38:46,476 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:46,476 INFO L231 Difference]: Finished difference. Result has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,477 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:46,477 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-05 22:38:46,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:46,478 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,478 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:46,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:46,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,484 INFO L130 PetriNetUnfolder]: 43/92 cut-off events. [2022-12-05 22:38:46,484 INFO L131 PetriNetUnfolder]: For 157/166 co-relation queries the response was YES. [2022-12-05 22:38:46,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 43/92 cut-off events. For 157/166 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 288 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:46,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-05 22:38:46,487 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:46,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 22:38:46,488 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,488 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:46,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:46,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:46,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:38:46,489 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:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1105155242, now seen corresponding path program 1 times [2022-12-05 22:38:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:46,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910494141] [2022-12-05 22:38:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:46,624 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:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:46,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910494141] [2022-12-05 22:38:46,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910494141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:46,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601599756] [2022-12-05 22:38:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:46,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:46,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:46,626 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:46,628 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:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:38:46,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:46,742 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:46,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:46,932 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:46,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601599756] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:46,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:46,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231994179] [2022-12-05 22:38:46,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:46,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:46,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:46,935 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:46,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:46,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:46,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:47,672 INFO L130 PetriNetUnfolder]: 497/766 cut-off events. [2022-12-05 22:38:47,672 INFO L131 PetriNetUnfolder]: For 1304/1304 co-relation queries the response was YES. [2022-12-05 22:38:47,673 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 3091 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:47,675 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 58 selfloop transitions, 65 changer transitions 0/123 dead transitions. [2022-12-05 22:38:47,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 850 flow [2022-12-05 22:38:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:38:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:38:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-05 22:38:47,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-05 22:38:47,676 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:47,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 850 flow [2022-12-05 22:38:47,679 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:47,681 INFO L231 Difference]: Finished difference. Result has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:47,681 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:47,681 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 29 predicate places. [2022-12-05 22:38:47,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:47,681 INFO L89 Accepts]: Start accepts. Operand has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:47,682 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:47,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:47,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:47,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:47,690 INFO L130 PetriNetUnfolder]: 77/159 cut-off events. [2022-12-05 22:38:47,690 INFO L131 PetriNetUnfolder]: For 382/391 co-relation queries the response was YES. [2022-12-05 22:38:47,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 159 events. 77/159 cut-off events. For 382/391 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 630 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 578. Up to 96 conditions per place. [2022-12-05 22:38:47,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:47,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-05 22:38:47,692 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:47,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-05 22:38:47,693 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:47,693 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:47,693 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:47,693 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:47,713 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:47,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-05 22:38:47,912 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:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1106194796, now seen corresponding path program 1 times [2022-12-05 22:38:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:47,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844203173] [2022-12-05 22:38:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:47,941 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:47,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:47,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844203173] [2022-12-05 22:38:47,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844203173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:47,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:47,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:38:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945201464] [2022-12-05 22:38:47,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:47,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:38:47,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:38:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:38:47,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:47,943 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:47,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:47,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:47,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:48,024 INFO L130 PetriNetUnfolder]: 382/627 cut-off events. [2022-12-05 22:38:48,024 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2022-12-05 22:38:48,025 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 2647 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:48,027 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-05 22:38:48,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 703 flow [2022-12-05 22:38:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 22:38:48,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-05 22:38:48,028 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:48,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 703 flow [2022-12-05 22:38:48,032 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:48,033 INFO L231 Difference]: Finished difference. Result has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:48,033 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:48,047 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-05 22:38:48,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:48,047 INFO L89 Accepts]: Start accepts. Operand has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:48,048 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:48,048 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:48,048 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:48,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:48,055 INFO L130 PetriNetUnfolder]: 52/131 cut-off events. [2022-12-05 22:38:48,055 INFO L131 PetriNetUnfolder]: For 281/289 co-relation queries the response was YES. [2022-12-05 22:38:48,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 131 events. 52/131 cut-off events. For 281/289 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 561 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:48,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:48,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-05 22:38:48,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:48,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 22:38:48,057 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:48,057 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:48,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:48,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:48,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:38:48,057 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:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1429433377, now seen corresponding path program 1 times [2022-12-05 22:38:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:48,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560942038] [2022-12-05 22:38:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:48,202 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:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560942038] [2022-12-05 22:38:48,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560942038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55404501] [2022-12-05 22:38:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:48,204 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:48,206 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:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:48,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:38:48,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:48,321 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:48,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:48,462 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:48,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55404501] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:48,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:48,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880891769] [2022-12-05 22:38:48,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:48,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:48,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:38:48,463 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:48,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:48,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:38:48,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:49,446 INFO L130 PetriNetUnfolder]: 412/689 cut-off events. [2022-12-05 22:38:49,446 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-05 22:38:49,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 689 events. 412/689 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3044 event pairs, 37 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:38:49,449 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 68 selfloop transitions, 42 changer transitions 0/110 dead transitions. [2022-12-05 22:38:49,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 883 flow [2022-12-05 22:38:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:38:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:38:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-05 22:38:49,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-05 22:38:49,450 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:38:49,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 883 flow [2022-12-05 22:38:49,458 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:38:49,459 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:49,459 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:38:49,460 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-05 22:38:49,460 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:49,460 INFO L89 Accepts]: Start accepts. Operand has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:49,460 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:49,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:49,460 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:49,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:49,488 INFO L130 PetriNetUnfolder]: 62/154 cut-off events. [2022-12-05 22:38:49,488 INFO L131 PetriNetUnfolder]: For 397/411 co-relation queries the response was YES. [2022-12-05 22:38:49,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 62/154 cut-off events. For 397/411 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 690 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:38:49,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:49,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-05 22:38:49,665 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:49,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-05 22:38:49,666 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 732 flow [2022-12-05 22:38:49,666 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:49,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:49,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:49,678 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:49,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-05 22:38:49,867 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:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash 67788185, now seen corresponding path program 1 times [2022-12-05 22:38:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253881283] [2022-12-05 22:38:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:50,004 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:38:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:50,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253881283] [2022-12-05 22:38:50,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253881283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:50,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600236227] [2022-12-05 22:38:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:50,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:50,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:50,006 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:50,051 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:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:50,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:38:50,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:50,158 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:38:50,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:50,335 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:38:50,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600236227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:50,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:50,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303964899] [2022-12-05 22:38:50,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:50,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:50,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:50,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:50,338 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:50,338 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:38:50,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:50,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:50,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:50,769 INFO L130 PetriNetUnfolder]: 472/809 cut-off events. [2022-12-05 22:38:50,769 INFO L131 PetriNetUnfolder]: For 3362/3362 co-relation queries the response was YES. [2022-12-05 22:38:50,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 809 events. 472/809 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3821 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:38:50,772 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 79 selfloop transitions, 58 changer transitions 0/137 dead transitions. [2022-12-05 22:38:50,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1256 flow [2022-12-05 22:38:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:38:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:38:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-05 22:38:50,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-05 22:38:50,773 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:38:50,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1256 flow [2022-12-05 22:38:50,778 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:38:50,779 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,780 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:38:50,780 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-05 22:38:50,780 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:50,780 INFO L89 Accepts]: Start accepts. Operand has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,781 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:50,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:50,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,792 INFO L130 PetriNetUnfolder]: 76/197 cut-off events. [2022-12-05 22:38:50,792 INFO L131 PetriNetUnfolder]: For 730/744 co-relation queries the response was YES. [2022-12-05 22:38:50,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 76/197 cut-off events. For 730/744 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 963 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:38:50,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-05 22:38:50,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:38:50,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-05 22:38:50,829 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 1064 flow [2022-12-05 22:38:50,829 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:38:50,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:50,830 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:50,848 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:38:51,034 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:38:51,034 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:38:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1362434503, now seen corresponding path program 1 times [2022-12-05 22:38:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:51,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136768040] [2022-12-05 22:38:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:51,190 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:38:51,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136768040] [2022-12-05 22:38:51,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136768040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945720130] [2022-12-05 22:38:51,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:51,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:51,191 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:38:51,193 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:38:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:51,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:38:51,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:51,328 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:38:51,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:51,498 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:38:51,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945720130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:51,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:51,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586550689] [2022-12-05 22:38:51,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:51,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:51,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:38:51,500 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:38:51,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:51,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:38:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:52,057 INFO L130 PetriNetUnfolder]: 512/889 cut-off events. [2022-12-05 22:38:52,058 INFO L131 PetriNetUnfolder]: For 4839/4839 co-relation queries the response was YES. [2022-12-05 22:38:52,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 889 events. 512/889 cut-off events. For 4839/4839 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4407 event pairs, 42 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:38:52,063 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 91 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2022-12-05 22:38:52,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1586 flow [2022-12-05 22:38:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:38:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:38:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-05 22:38:52,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-05 22:38:52,064 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:38:52,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1586 flow [2022-12-05 22:38:52,073 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:38:52,075 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:52,076 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:38:52,076 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2022-12-05 22:38:52,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:52,076 INFO L89 Accepts]: Start accepts. Operand has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:52,078 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:52,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:52,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:52,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:52,094 INFO L130 PetriNetUnfolder]: 86/226 cut-off events. [2022-12-05 22:38:52,095 INFO L131 PetriNetUnfolder]: For 1142/1154 co-relation queries the response was YES. [2022-12-05 22:38:52,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 226 events. 86/226 cut-off events. For 1142/1154 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1164 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:38:52,097 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:52,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-05 22:38:52,196 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:52,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-05 22:38:52,197 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 1375 flow [2022-12-05 22:38:52,197 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:38:52,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:52,197 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:52,201 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:38:52,397 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:38:52,398 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:38:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:52,398 INFO L85 PathProgramCache]: Analyzing trace with hash 549134360, now seen corresponding path program 1 times [2022-12-05 22:38:52,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:52,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388538364] [2022-12-05 22:38:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:52,557 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:38:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:52,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388538364] [2022-12-05 22:38:52,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388538364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:52,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501986847] [2022-12-05 22:38:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:52,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:52,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:52,564 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:38:52,566 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:38:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:52,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:38:52,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:52,753 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:38:52,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:52,951 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:38:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501986847] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:52,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:52,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206865743] [2022-12-05 22:38:52,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:52,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:38:52,952 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:38:52,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:52,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:38:52,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:59,108 INFO L130 PetriNetUnfolder]: 532/933 cut-off events. [2022-12-05 22:38:59,108 INFO L131 PetriNetUnfolder]: For 5436/5436 co-relation queries the response was YES. [2022-12-05 22:38:59,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 933 events. 532/933 cut-off events. For 5436/5436 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4772 event pairs, 36 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:38:59,112 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 101 selfloop transitions, 88 changer transitions 2/191 dead transitions. [2022-12-05 22:38:59,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2063 flow [2022-12-05 22:38:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:38:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:38:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-05 22:38:59,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2669683257918552 [2022-12-05 22:38:59,113 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:38:59,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2063 flow [2022-12-05 22:38:59,124 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:38:59,127 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1764 flow [2022-12-05 22:38:59,127 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:38:59,127 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-05 22:38:59,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:59,127 INFO L89 Accepts]: Start accepts. Operand has 93 places, 133 transitions, 1764 flow [2022-12-05 22:38:59,128 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:59,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:59,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-05 22:38:59,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 133 transitions, 1764 flow [2022-12-05 22:38:59,143 INFO L130 PetriNetUnfolder]: 91/244 cut-off events. [2022-12-05 22:38:59,143 INFO L131 PetriNetUnfolder]: For 1391/1399 co-relation queries the response was YES. [2022-12-05 22:38:59,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 244 events. 91/244 cut-off events. For 1391/1399 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1338 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:38:59,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-05 22:38:59,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-05 22:38:59,493 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:38:59,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-05 22:38:59,493 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1799 flow [2022-12-05 22:38:59,493 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:38:59,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:59,493 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:59,501 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:38:59,694 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:38:59,694 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:38:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2099725158, now seen corresponding path program 1 times [2022-12-05 22:38:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:59,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542163365] [2022-12-05 22:38:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:59,824 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:38:59,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:59,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542163365] [2022-12-05 22:38:59,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542163365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:59,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040528702] [2022-12-05 22:38:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:59,825 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:38:59,827 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:38:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:59,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:38:59,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:59,979 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:38:59,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:00,237 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:00,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040528702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:00,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:00,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667369127] [2022-12-05 22:39:00,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:00,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:00,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:00,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:00,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:00,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 22:39:00,239 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:00,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:00,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 22:39:00,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:01,453 INFO L130 PetriNetUnfolder]: 766/1357 cut-off events. [2022-12-05 22:39:01,453 INFO L131 PetriNetUnfolder]: For 18043/18043 co-relation queries the response was YES. [2022-12-05 22:39:01,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1357 events. 766/1357 cut-off events. For 18043/18043 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7567 event pairs, 46 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:01,460 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 111 selfloop transitions, 163 changer transitions 0/274 dead transitions. [2022-12-05 22:39:01,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 274 transitions, 3397 flow [2022-12-05 22:39:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-05 22:39:01,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-05 22:39:01,461 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:01,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 274 transitions, 3397 flow [2022-12-05 22:39:01,490 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:01,496 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:01,496 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:01,496 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 91 predicate places. [2022-12-05 22:39:01,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:01,496 INFO L89 Accepts]: Start accepts. Operand has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:01,498 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:01,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:01,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:01,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:01,549 INFO L130 PetriNetUnfolder]: 133/352 cut-off events. [2022-12-05 22:39:01,549 INFO L131 PetriNetUnfolder]: For 2819/2833 co-relation queries the response was YES. [2022-12-05 22:39:01,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 352 events. 133/352 cut-off events. For 2819/2833 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2094 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:01,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:01,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-05 22:39:01,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:01,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-05 22:39:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 3056 flow [2022-12-05 22:39:01,606 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:01,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:01,607 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:01,624 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:01,811 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:01,811 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:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1363954805, now seen corresponding path program 1 times [2022-12-05 22:39:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:01,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403079584] [2022-12-05 22:39:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:01,925 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:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403079584] [2022-12-05 22:39:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403079584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18608741] [2022-12-05 22:39:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:01,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:01,927 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:01,929 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:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:01,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:01,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:02,065 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:02,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:02,260 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:02,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18608741] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:02,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:02,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391935386] [2022-12-05 22:39:02,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:02,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:02,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:02,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:02,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 22:39:02,262 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:02,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:02,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 22:39:02,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:03,409 INFO L130 PetriNetUnfolder]: 868/1533 cut-off events. [2022-12-05 22:39:03,409 INFO L131 PetriNetUnfolder]: For 18338/18338 co-relation queries the response was YES. [2022-12-05 22:39:03,413 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 8839 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:03,418 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 176 selfloop transitions, 104 changer transitions 2/282 dead transitions. [2022-12-05 22:39:03,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 282 transitions, 4120 flow [2022-12-05 22:39:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-05 22:39:03,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465437788018433 [2022-12-05 22:39:03,419 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:03,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 282 transitions, 4120 flow [2022-12-05 22:39:03,453 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:03,457 INFO L231 Difference]: Finished difference. Result has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:03,457 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:03,457 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 103 predicate places. [2022-12-05 22:39:03,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:03,457 INFO L89 Accepts]: Start accepts. Operand has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:03,458 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:03,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:03,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:03,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:03,485 INFO L130 PetriNetUnfolder]: 153/401 cut-off events. [2022-12-05 22:39:03,485 INFO L131 PetriNetUnfolder]: For 2859/2871 co-relation queries the response was YES. [2022-12-05 22:39:03,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 401 events. 153/401 cut-off events. For 2859/2871 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2502 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:03,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:03,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-05 22:39:03,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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 [364] L705-6-->L695-5: Formula: (and (= (* 2 v_~next~0_112) (+ (* 34 v_~cur~0_182) (* 21 v_~prev~0_217) (* 3 v_~prev~0_216))) (= (+ (* v_~prev~0_217 13) (* 3 v_~next~0_112) (* 21 v_~cur~0_182)) (* 5 v_~prev~0_216)) (= v_~j~0_207 (+ v_~j~0_209 (* 2 v_~i~0_185))) (< v_~x~0_201 1) (= v_~next~0_112 v_~cur~0_181) (= (+ 2 v_~q~0_128) v_~q~0_126) (= (+ 12 v_~x~0_201) v_~x~0_200) (< v_~q~0_126 6)) InVars {~j~0=v_~j~0_209, ~prev~0=v_~prev~0_217, ~i~0=v_~i~0_185, ~q~0=v_~q~0_128, ~cur~0=v_~cur~0_182, ~x~0=v_~x~0_201} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_123|, ~j~0=v_~j~0_207, ~next~0=v_~next~0_112, ~prev~0=v_~prev~0_216, ~i~0=v_~i~0_185, ~q~0=v_~q~0_126, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_90|, ~cur~0=v_~cur~0_181, ~x~0=v_~x~0_200} 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:03,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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 [342] L705-6-->L695-5: Formula: (and (= (+ (* v_~prev~0_139 13) (* 21 v_~cur~0_110) (* 3 v_~next~0_70)) (* 5 v_~prev~0_138)) (< v_~q~0_56 5) (= (+ (* 34 v_~cur~0_110) (* 3 v_~prev~0_138) (* 21 v_~prev~0_139)) (* 2 v_~next~0_70)) (< v_~x~0_123 1) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= (+ 12 v_~x~0_123) v_~x~0_122) (= v_~q~0_55 (+ v_~q~0_56 1)) (= v_~cur~0_109 v_~next~0_70)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_139, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_110, ~x~0=v_~x~0_123} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_75|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_70, ~prev~0=v_~prev~0_138, ~i~0=v_~i~0_101, ~q~0=v_~q~0_55, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_109, ~x~0=v_~x~0_122} 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:03,695 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:03,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-05 22:39:03,695 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 234 transitions, 3562 flow [2022-12-05 22:39:03,696 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:03,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:03,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:03,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-05 22:39:03,896 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:03,896 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:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2101076944, now seen corresponding path program 1 times [2022-12-05 22:39:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913141950] [2022-12-05 22:39:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:04,013 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:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913141950] [2022-12-05 22:39:04,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913141950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120452463] [2022-12-05 22:39:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:04,015 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:04,016 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:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:04,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:04,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:04,180 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:04,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:04,574 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:04,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120452463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:04,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:04,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:04,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111077090] [2022-12-05 22:39:04,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:04,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:04,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:04,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:04,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:04,577 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 22:39:04,578 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:04,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:04,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 22:39:04,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:05,957 INFO L130 PetriNetUnfolder]: 1116/1949 cut-off events. [2022-12-05 22:39:05,957 INFO L131 PetriNetUnfolder]: For 25468/25468 co-relation queries the response was YES. [2022-12-05 22:39:05,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 1949 events. 1116/1949 cut-off events. For 25468/25468 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11493 event pairs, 53 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:05,969 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 99 selfloop transitions, 253 changer transitions 0/352 dead transitions. [2022-12-05 22:39:05,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 352 transitions, 5256 flow [2022-12-05 22:39:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:39:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:39:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-05 22:39:05,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-05 22:39:05,970 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:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 352 transitions, 5256 flow [2022-12-05 22:39:06,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 352 transitions, 5190 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:06,016 INFO L231 Difference]: Finished difference. Result has 137 places, 281 transitions, 5019 flow [2022-12-05 22:39:06,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3500, PETRI_DIFFERENCE_MINUEND_PLACES=118, 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=5019, PETRI_PLACES=137, PETRI_TRANSITIONS=281} [2022-12-05 22:39:06,017 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 119 predicate places. [2022-12-05 22:39:06,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:06,017 INFO L89 Accepts]: Start accepts. Operand has 137 places, 281 transitions, 5019 flow [2022-12-05 22:39:06,018 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:06,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:06,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 281 transitions, 5019 flow [2022-12-05 22:39:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 281 transitions, 5019 flow [2022-12-05 22:39:06,056 INFO L130 PetriNetUnfolder]: 184/484 cut-off events. [2022-12-05 22:39:06,056 INFO L131 PetriNetUnfolder]: For 5415/5433 co-relation queries the response was YES. [2022-12-05 22:39:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 484 events. 184/484 cut-off events. For 5415/5433 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3129 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:06,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 281 transitions, 5019 flow [2022-12-05 22:39:06,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-05 22:39:06,095 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:06,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 22:39:06,096 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 281 transitions, 5023 flow [2022-12-05 22:39:06,096 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:06,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:06,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:06,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-05 22:39:06,299 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:06,300 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:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1361980911, now seen corresponding path program 1 times [2022-12-05 22:39:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:06,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284911783] [2022-12-05 22:39:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:06,388 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:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284911783] [2022-12-05 22:39:06,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284911783] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907772210] [2022-12-05 22:39:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:06,390 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:06,392 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:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:06,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 22:39:06,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:06,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:06,696 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:06,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907772210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:06,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:06,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135503627] [2022-12-05 22:39:06,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:06,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:06,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:06,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:06,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:06,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 281 transitions, 5023 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:06,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:06,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:06,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:07,917 INFO L130 PetriNetUnfolder]: 1266/2207 cut-off events. [2022-12-05 22:39:07,917 INFO L131 PetriNetUnfolder]: For 39729/39729 co-relation queries the response was YES. [2022-12-05 22:39:07,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13569 conditions, 2207 events. 1266/2207 cut-off events. For 39729/39729 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 13450 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:07,932 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 214 selfloop transitions, 154 changer transitions 0/368 dead transitions. [2022-12-05 22:39:07,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 368 transitions, 6568 flow [2022-12-05 22:39:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-05 22:39:07,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23877551020408164 [2022-12-05 22:39:07,933 INFO L175 Difference]: Start difference. First operand has 137 places, 281 transitions, 5023 flow. Second operand 14 states and 117 transitions. [2022-12-05 22:39:07,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 368 transitions, 6568 flow [2022-12-05 22:39:08,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 368 transitions, 6292 flow, removed 63 selfloop flow, removed 8 redundant places. [2022-12-05 22:39:08,031 INFO L231 Difference]: Finished difference. Result has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:08,031 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:08,032 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-05 22:39:08,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:08,032 INFO L89 Accepts]: Start accepts. Operand has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:08,033 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:08,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:08,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:08,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:08,078 INFO L130 PetriNetUnfolder]: 204/533 cut-off events. [2022-12-05 22:39:08,078 INFO L131 PetriNetUnfolder]: For 7198/7214 co-relation queries the response was YES. [2022-12-05 22:39:08,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 533 events. 204/533 cut-off events. For 7198/7214 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3604 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:08,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:08,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-05 22:39:08,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:08,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-05 22:39:08,084 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:08,084 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:08,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:08,085 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:08,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-05 22:39:08,288 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:08,288 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:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 550335610, now seen corresponding path program 1 times [2022-12-05 22:39:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:08,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226477804] [2022-12-05 22:39:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:08,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226477804] [2022-12-05 22:39:08,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226477804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:08,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:39:08,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:39:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916607070] [2022-12-05 22:39:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:08,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:39:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:39:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:39:08,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:08,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 319 transitions, 5968 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:39:08,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:08,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:08,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:08,582 INFO L130 PetriNetUnfolder]: 1218/2117 cut-off events. [2022-12-05 22:39:08,583 INFO L131 PetriNetUnfolder]: For 37589/37589 co-relation queries the response was YES. [2022-12-05 22:39:08,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14373 conditions, 2117 events. 1218/2117 cut-off events. For 37589/37589 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 12641 event pairs, 413 based on Foata normal form. 111/2214 useless extension candidates. Maximal degree in co-relation 14309. Up to 1598 conditions per place. [2022-12-05 22:39:08,595 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 293 selfloop transitions, 45 changer transitions 0/338 dead transitions. [2022-12-05 22:39:08,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 338 transitions, 6916 flow [2022-12-05 22:39:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:39:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:39:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 22:39:08,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-05 22:39:08,596 INFO L175 Difference]: Start difference. First operand has 152 places, 319 transitions, 5968 flow. Second operand 3 states and 43 transitions. [2022-12-05 22:39:08,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 338 transitions, 6916 flow [2022-12-05 22:39:08,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 338 transitions, 6763 flow, removed 61 selfloop flow, removed 3 redundant places. [2022-12-05 22:39:08,723 INFO L231 Difference]: Finished difference. Result has 152 places, 321 transitions, 5960 flow [2022-12-05 22:39:08,723 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5648, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5960, PETRI_PLACES=152, PETRI_TRANSITIONS=321} [2022-12-05 22:39:08,724 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-05 22:39:08,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:08,724 INFO L89 Accepts]: Start accepts. Operand has 152 places, 321 transitions, 5960 flow [2022-12-05 22:39:08,725 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:08,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:08,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 321 transitions, 5960 flow [2022-12-05 22:39:08,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 321 transitions, 5960 flow [2022-12-05 22:39:08,770 INFO L130 PetriNetUnfolder]: 199/520 cut-off events. [2022-12-05 22:39:08,770 INFO L131 PetriNetUnfolder]: For 6882/6907 co-relation queries the response was YES. [2022-12-05 22:39:08,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4206 conditions, 520 events. 199/520 cut-off events. For 6882/6907 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3433 event pairs, 0 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 4145. Up to 231 conditions per place. [2022-12-05 22:39:08,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 321 transitions, 5960 flow [2022-12-05 22:39:08,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-05 22:39:08,776 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:08,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-05 22:39:08,777 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 321 transitions, 5960 flow [2022-12-05 22:39:08,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:39:08,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:08,777 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:08,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 22:39:08,777 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:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash 727133362, now seen corresponding path program 2 times [2022-12-05 22:39:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:08,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903497201] [2022-12-05 22:39:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:08,877 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:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:08,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903497201] [2022-12-05 22:39:08,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903497201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:08,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660853180] [2022-12-05 22:39:08,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:39:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:08,905 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:08,906 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:08,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:39:08,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:39:08,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:39:08,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:09,074 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:09,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:09,348 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:09,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660853180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:09,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:09,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:09,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191353809] [2022-12-05 22:39:09,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:09,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:09,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:09,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:09,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 22:39:09,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 321 transitions, 5960 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:09,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:09,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 22:39:09,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:10,390 INFO L130 PetriNetUnfolder]: 1448/2501 cut-off events. [2022-12-05 22:39:10,390 INFO L131 PetriNetUnfolder]: For 51745/51745 co-relation queries the response was YES. [2022-12-05 22:39:10,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17369 conditions, 2501 events. 1448/2501 cut-off events. For 51745/51745 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 15352 event pairs, 110 based on Foata normal form. 18/2505 useless extension candidates. Maximal degree in co-relation 17305. Up to 1218 conditions per place. [2022-12-05 22:39:10,403 INFO L137 encePairwiseOnDemand]: 10/34 looper letters, 209 selfloop transitions, 220 changer transitions 0/429 dead transitions. [2022-12-05 22:39:10,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 429 transitions, 7989 flow [2022-12-05 22:39:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:39:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:39:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2022-12-05 22:39:10,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2549019607843137 [2022-12-05 22:39:10,405 INFO L175 Difference]: Start difference. First operand has 152 places, 321 transitions, 5960 flow. Second operand 15 states and 130 transitions. [2022-12-05 22:39:10,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 429 transitions, 7989 flow [2022-12-05 22:39:10,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 429 transitions, 7944 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:10,530 INFO L231 Difference]: Finished difference. Result has 169 places, 369 transitions, 7439 flow [2022-12-05 22:39:10,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5915, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7439, PETRI_PLACES=169, PETRI_TRANSITIONS=369} [2022-12-05 22:39:10,531 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 151 predicate places. [2022-12-05 22:39:10,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:10,531 INFO L89 Accepts]: Start accepts. Operand has 169 places, 369 transitions, 7439 flow [2022-12-05 22:39:10,532 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:10,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:10,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 369 transitions, 7439 flow [2022-12-05 22:39:10,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 369 transitions, 7439 flow [2022-12-05 22:39:10,591 INFO L130 PetriNetUnfolder]: 238/618 cut-off events. [2022-12-05 22:39:10,591 INFO L131 PetriNetUnfolder]: For 10923/10965 co-relation queries the response was YES. [2022-12-05 22:39:10,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5434 conditions, 618 events. 238/618 cut-off events. For 10923/10965 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4288 event pairs, 0 based on Foata normal form. 0/616 useless extension candidates. Maximal degree in co-relation 5368. Up to 294 conditions per place. [2022-12-05 22:39:10,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 369 transitions, 7439 flow [2022-12-05 22:39:10,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-05 22:39:10,663 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:10,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-05 22:39:10,663 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 369 transitions, 7457 flow [2022-12-05 22:39:10,664 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:10,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:10,664 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:10,668 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:10,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:10,866 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:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash 727310930, now seen corresponding path program 1 times [2022-12-05 22:39:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:10,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066231235] [2022-12-05 22:39:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:10,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066231235] [2022-12-05 22:39:10,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066231235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:10,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18317510] [2022-12-05 22:39:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:10,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:10,901 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:10,936 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:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:10,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:39:10,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:10,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:10,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18317510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:10,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:10,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-05 22:39:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833842270] [2022-12-05 22:39:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:10,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:39:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:39:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:39:10,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 22:39:10,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 369 transitions, 7457 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:39:10,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:10,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 22:39:10,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:11,357 INFO L130 PetriNetUnfolder]: 1558/2651 cut-off events. [2022-12-05 22:39:11,357 INFO L131 PetriNetUnfolder]: For 65689/65689 co-relation queries the response was YES. [2022-12-05 22:39:11,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19923 conditions, 2651 events. 1558/2651 cut-off events. For 65689/65689 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 16344 event pairs, 408 based on Foata normal form. 17/2660 useless extension candidates. Maximal degree in co-relation 19854. Up to 1416 conditions per place. [2022-12-05 22:39:11,373 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 535 selfloop transitions, 9 changer transitions 1/545 dead transitions. [2022-12-05 22:39:11,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 545 transitions, 12170 flow [2022-12-05 22:39:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:39:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:39:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 22:39:11,374 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 22:39:11,374 INFO L175 Difference]: Start difference. First operand has 169 places, 369 transitions, 7457 flow. Second operand 5 states and 54 transitions. [2022-12-05 22:39:11,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 545 transitions, 12170 flow [2022-12-05 22:39:11,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 545 transitions, 11878 flow, removed 113 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:11,532 INFO L231 Difference]: Finished difference. Result has 170 places, 361 transitions, 7122 flow [2022-12-05 22:39:11,532 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7086, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7122, PETRI_PLACES=170, PETRI_TRANSITIONS=361} [2022-12-05 22:39:11,533 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 152 predicate places. [2022-12-05 22:39:11,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:11,533 INFO L89 Accepts]: Start accepts. Operand has 170 places, 361 transitions, 7122 flow [2022-12-05 22:39:11,534 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:11,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:11,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 361 transitions, 7122 flow [2022-12-05 22:39:11,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 361 transitions, 7122 flow [2022-12-05 22:39:11,595 INFO L130 PetriNetUnfolder]: 248/648 cut-off events. [2022-12-05 22:39:11,596 INFO L131 PetriNetUnfolder]: For 13668/13715 co-relation queries the response was YES. [2022-12-05 22:39:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5784 conditions, 648 events. 248/648 cut-off events. For 13668/13715 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 4604 event pairs, 0 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 5718. Up to 304 conditions per place. [2022-12-05 22:39:11,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 361 transitions, 7122 flow [2022-12-05 22:39:11,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-05 22:39:11,603 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:11,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-05 22:39:11,604 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 361 transitions, 7122 flow [2022-12-05 22:39:11,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:39:11,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:11,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:11,616 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:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:11,811 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:39:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 729283863, now seen corresponding path program 1 times [2022-12-05 22:39:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:11,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873991160] [2022-12-05 22:39:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873991160] [2022-12-05 22:39:11,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873991160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070572725] [2022-12-05 22:39:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:11,837 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:11,855 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:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:11,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:39:11,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:11,905 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:39:11,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:11,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070572725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:11,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:11,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:39:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038086204] [2022-12-05 22:39:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:11,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:39:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:39:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:39:11,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 22:39:11,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 361 transitions, 7122 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:39:11,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:11,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 22:39:11,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:12,270 INFO L130 PetriNetUnfolder]: 1606/2725 cut-off events. [2022-12-05 22:39:12,271 INFO L131 PetriNetUnfolder]: For 74472/74472 co-relation queries the response was YES. [2022-12-05 22:39:12,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20933 conditions, 2725 events. 1606/2725 cut-off events. For 74472/74472 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 16790 event pairs, 381 based on Foata normal form. 21/2732 useless extension candidates. Maximal degree in co-relation 20864. Up to 1142 conditions per place. [2022-12-05 22:39:12,289 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 532 selfloop transitions, 14 changer transitions 1/547 dead transitions. [2022-12-05 22:39:12,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 547 transitions, 11897 flow [2022-12-05 22:39:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:39:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:39:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 22:39:12,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 22:39:12,290 INFO L175 Difference]: Start difference. First operand has 170 places, 361 transitions, 7122 flow. Second operand 5 states and 54 transitions. [2022-12-05 22:39:12,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 547 transitions, 11897 flow [2022-12-05 22:39:12,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 547 transitions, 11892 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:12,453 INFO L231 Difference]: Finished difference. Result has 175 places, 364 transitions, 7194 flow [2022-12-05 22:39:12,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7119, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7194, PETRI_PLACES=175, PETRI_TRANSITIONS=364} [2022-12-05 22:39:12,454 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 157 predicate places. [2022-12-05 22:39:12,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:12,454 INFO L89 Accepts]: Start accepts. Operand has 175 places, 364 transitions, 7194 flow [2022-12-05 22:39:12,455 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:12,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:12,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 364 transitions, 7194 flow [2022-12-05 22:39:12,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 364 transitions, 7194 flow [2022-12-05 22:39:12,532 INFO L130 PetriNetUnfolder]: 257/675 cut-off events. [2022-12-05 22:39:12,533 INFO L131 PetriNetUnfolder]: For 17135/17184 co-relation queries the response was YES. [2022-12-05 22:39:12,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6256 conditions, 675 events. 257/675 cut-off events. For 17135/17184 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4793 event pairs, 0 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 6187. Up to 319 conditions per place. [2022-12-05 22:39:12,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 364 transitions, 7194 flow [2022-12-05 22:39:12,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 1196 [2022-12-05 22:39:12,541 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:12,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-05 22:39:12,541 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 364 transitions, 7194 flow [2022-12-05 22:39:12,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:39:12,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:12,542 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:12,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:12,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:12,746 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:39:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -173314828, now seen corresponding path program 1 times [2022-12-05 22:39:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:12,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41308764] [2022-12-05 22:39:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:12,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:12,844 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:12,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:12,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41308764] [2022-12-05 22:39:12,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41308764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:12,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144503663] [2022-12-05 22:39:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:12,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:12,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:12,846 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:39:12,891 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:39:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:12,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:12,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:13,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:13,245 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:13,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144503663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:13,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:13,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:13,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867713413] [2022-12-05 22:39:13,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:13,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:13,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:13,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:13,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:13,248 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-05 22:39:13,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 364 transitions, 7194 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:39:13,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:13,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-05 22:39:13,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:17,772 INFO L130 PetriNetUnfolder]: 1678/2879 cut-off events. [2022-12-05 22:39:17,772 INFO L131 PetriNetUnfolder]: For 105149/105149 co-relation queries the response was YES. [2022-12-05 22:39:17,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22830 conditions, 2879 events. 1678/2879 cut-off events. For 105149/105149 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 17919 event pairs, 216 based on Foata normal form. 54/2925 useless extension candidates. Maximal degree in co-relation 22758. Up to 2060 conditions per place. [2022-12-05 22:39:17,801 INFO L137 encePairwiseOnDemand]: 9/36 looper letters, 295 selfloop transitions, 188 changer transitions 5/488 dead transitions. [2022-12-05 22:39:17,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 488 transitions, 9551 flow [2022-12-05 22:39:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:39:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:39:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 144 transitions. [2022-12-05 22:39:17,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-05 22:39:17,803 INFO L175 Difference]: Start difference. First operand has 175 places, 364 transitions, 7194 flow. Second operand 22 states and 144 transitions. [2022-12-05 22:39:17,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 488 transitions, 9551 flow [2022-12-05 22:39:18,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 488 transitions, 9550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:18,077 INFO L231 Difference]: Finished difference. Result has 200 places, 408 transitions, 8758 flow [2022-12-05 22:39:18,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7193, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8758, PETRI_PLACES=200, PETRI_TRANSITIONS=408} [2022-12-05 22:39:18,078 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 182 predicate places. [2022-12-05 22:39:18,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:18,078 INFO L89 Accepts]: Start accepts. Operand has 200 places, 408 transitions, 8758 flow [2022-12-05 22:39:18,079 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:18,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:18,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 408 transitions, 8758 flow [2022-12-05 22:39:18,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 408 transitions, 8758 flow [2022-12-05 22:39:18,161 INFO L130 PetriNetUnfolder]: 275/735 cut-off events. [2022-12-05 22:39:18,161 INFO L131 PetriNetUnfolder]: For 20029/20089 co-relation queries the response was YES. [2022-12-05 22:39:18,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7177 conditions, 735 events. 275/735 cut-off events. For 20029/20089 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5369 event pairs, 0 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 7102. Up to 361 conditions per place. [2022-12-05 22:39:18,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 408 transitions, 8758 flow [2022-12-05 22:39:18,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 1286 [2022-12-05 22:39:18,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:18,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-05 22:39:18,207 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 408 transitions, 8764 flow [2022-12-05 22:39:18,207 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:39:18,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:18,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:18,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:18,407 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:39:18,407 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:39:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash -110478882, now seen corresponding path program 1 times [2022-12-05 22:39:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:18,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445118505] [2022-12-05 22:39:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:18,526 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:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:18,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445118505] [2022-12-05 22:39:18,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445118505] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:18,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557179525] [2022-12-05 22:39:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:18,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:18,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:18,529 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:39:18,530 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:39:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:18,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-05 22:39:18,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:18,691 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:18,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:18,949 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:18,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557179525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:18,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:18,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336858310] [2022-12-05 22:39:18,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:18,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:18,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:18,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:18,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:18,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:18,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 408 transitions, 8764 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:39:18,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:18,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:18,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:21,365 INFO L130 PetriNetUnfolder]: 1808/3131 cut-off events. [2022-12-05 22:39:21,365 INFO L131 PetriNetUnfolder]: For 136365/136365 co-relation queries the response was YES. [2022-12-05 22:39:21,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26436 conditions, 3131 events. 1808/3131 cut-off events. For 136365/136365 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 20041 event pairs, 203 based on Foata normal form. 44/3167 useless extension candidates. Maximal degree in co-relation 26358. Up to 1864 conditions per place. [2022-12-05 22:39:21,383 INFO L137 encePairwiseOnDemand]: 10/37 looper letters, 298 selfloop transitions, 254 changer transitions 2/554 dead transitions. [2022-12-05 22:39:21,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 554 transitions, 11723 flow [2022-12-05 22:39:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:39:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:39:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2022-12-05 22:39:21,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19047619047619047 [2022-12-05 22:39:21,390 INFO L175 Difference]: Start difference. First operand has 200 places, 408 transitions, 8764 flow. Second operand 21 states and 148 transitions. [2022-12-05 22:39:21,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 554 transitions, 11723 flow [2022-12-05 22:39:21,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 554 transitions, 11495 flow, removed 84 selfloop flow, removed 8 redundant places. [2022-12-05 22:39:21,634 INFO L231 Difference]: Finished difference. Result has 221 places, 457 transitions, 10569 flow [2022-12-05 22:39:21,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8548, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=10569, PETRI_PLACES=221, PETRI_TRANSITIONS=457} [2022-12-05 22:39:21,635 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 203 predicate places. [2022-12-05 22:39:21,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:21,635 INFO L89 Accepts]: Start accepts. Operand has 221 places, 457 transitions, 10569 flow [2022-12-05 22:39:21,636 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:21,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:21,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 457 transitions, 10569 flow [2022-12-05 22:39:21,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 457 transitions, 10569 flow [2022-12-05 22:39:21,734 INFO L130 PetriNetUnfolder]: 311/813 cut-off events. [2022-12-05 22:39:21,735 INFO L131 PetriNetUnfolder]: For 28230/28301 co-relation queries the response was YES. [2022-12-05 22:39:21,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8591 conditions, 813 events. 311/813 cut-off events. For 28230/28301 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 5986 event pairs, 0 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 8505. Up to 417 conditions per place. [2022-12-05 22:39:21,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 457 transitions, 10569 flow [2022-12-05 22:39:21,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 1400 [2022-12-05 22:39:21,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:39:21,785 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:39:21,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:21,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-05 22:39:21,851 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 457 transitions, 10593 flow [2022-12-05 22:39:21,851 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:39:21,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:21,851 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:21,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:22,055 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:39:22,055 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:39:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -132900934, now seen corresponding path program 1 times [2022-12-05 22:39:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350319575] [2022-12-05 22:39:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350319575] [2022-12-05 22:39:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350319575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684400458] [2022-12-05 22:39:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:22,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:22,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:22,172 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:39:22,174 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:39:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:22,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:22,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:22,328 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:22,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:22,528 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:22,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684400458] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:22,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:22,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785728241] [2022-12-05 22:39:22,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:22,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:22,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:22,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:39:22,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 457 transitions, 10593 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:39:22,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:22,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:39:22,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:26,468 INFO L130 PetriNetUnfolder]: 1888/3297 cut-off events. [2022-12-05 22:39:26,468 INFO L131 PetriNetUnfolder]: For 166945/166945 co-relation queries the response was YES. [2022-12-05 22:39:26,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29403 conditions, 3297 events. 1888/3297 cut-off events. For 166945/166945 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 21630 event pairs, 294 based on Foata normal form. 44/3333 useless extension candidates. Maximal degree in co-relation 29314. Up to 2336 conditions per place. [2022-12-05 22:39:26,490 INFO L137 encePairwiseOnDemand]: 9/39 looper letters, 346 selfloop transitions, 218 changer transitions 3/567 dead transitions. [2022-12-05 22:39:26,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 567 transitions, 13218 flow [2022-12-05 22:39:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 124 transitions. [2022-12-05 22:39:26,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17663817663817663 [2022-12-05 22:39:26,492 INFO L175 Difference]: Start difference. First operand has 221 places, 457 transitions, 10593 flow. Second operand 18 states and 124 transitions. [2022-12-05 22:39:26,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 567 transitions, 13218 flow [2022-12-05 22:39:26,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 567 transitions, 12928 flow, removed 106 selfloop flow, removed 7 redundant places. [2022-12-05 22:39:26,860 INFO L231 Difference]: Finished difference. Result has 236 places, 497 transitions, 12141 flow [2022-12-05 22:39:26,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=10309, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=12141, PETRI_PLACES=236, PETRI_TRANSITIONS=497} [2022-12-05 22:39:26,860 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 218 predicate places. [2022-12-05 22:39:26,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:26,861 INFO L89 Accepts]: Start accepts. Operand has 236 places, 497 transitions, 12141 flow [2022-12-05 22:39:26,863 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:26,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:26,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 497 transitions, 12141 flow [2022-12-05 22:39:26,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 497 transitions, 12141 flow [2022-12-05 22:39:26,982 INFO L130 PetriNetUnfolder]: 330/877 cut-off events. [2022-12-05 22:39:26,982 INFO L131 PetriNetUnfolder]: For 31330/31420 co-relation queries the response was YES. [2022-12-05 22:39:26,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9588 conditions, 877 events. 330/877 cut-off events. For 31330/31420 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6705 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 9497. Up to 450 conditions per place. [2022-12-05 22:39:26,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 497 transitions, 12141 flow [2022-12-05 22:39:26,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 1486 [2022-12-05 22:39:26,995 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:26,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-05 22:39:26,996 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 497 transitions, 12141 flow [2022-12-05 22:39:26,997 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:39:26,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:26,997 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:27,003 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:39:27,201 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:39:27,201 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:39:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1134601301, now seen corresponding path program 1 times [2022-12-05 22:39:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:27,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800026574] [2022-12-05 22:39:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:27,238 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:39:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800026574] [2022-12-05 22:39:27,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800026574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776797511] [2022-12-05 22:39:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:27,252 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:39:27,257 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:39:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:27,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 22:39:27,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:27,327 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:39:27,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:27,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776797511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:27,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:27,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-05 22:39:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099786364] [2022-12-05 22:39:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:39:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:39:27,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:39:27,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:39:27,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 497 transitions, 12141 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:39:27,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:27,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:39:27,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:28,023 INFO L130 PetriNetUnfolder]: 2010/3479 cut-off events. [2022-12-05 22:39:28,024 INFO L131 PetriNetUnfolder]: For 143767/143767 co-relation queries the response was YES. [2022-12-05 22:39:28,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31617 conditions, 3479 events. 2010/3479 cut-off events. For 143767/143767 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 23311 event pairs, 390 based on Foata normal form. 81/3552 useless extension candidates. Maximal degree in co-relation 31523. Up to 1645 conditions per place. [2022-12-05 22:39:28,049 INFO L137 encePairwiseOnDemand]: 24/39 looper letters, 672 selfloop transitions, 120 changer transitions 2/794 dead transitions. [2022-12-05 22:39:28,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 794 transitions, 21198 flow [2022-12-05 22:39:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:39:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:39:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-05 22:39:28,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27472527472527475 [2022-12-05 22:39:28,050 INFO L175 Difference]: Start difference. First operand has 235 places, 497 transitions, 12141 flow. Second operand 7 states and 75 transitions. [2022-12-05 22:39:28,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 794 transitions, 21198 flow [2022-12-05 22:39:28,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 794 transitions, 20707 flow, removed 210 selfloop flow, removed 6 redundant places. [2022-12-05 22:39:28,560 INFO L231 Difference]: Finished difference. Result has 238 places, 527 transitions, 13158 flow [2022-12-05 22:39:28,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=11389, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13158, PETRI_PLACES=238, PETRI_TRANSITIONS=527} [2022-12-05 22:39:28,561 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 220 predicate places. [2022-12-05 22:39:28,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:28,561 INFO L89 Accepts]: Start accepts. Operand has 238 places, 527 transitions, 13158 flow [2022-12-05 22:39:28,563 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:28,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:28,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 527 transitions, 13158 flow [2022-12-05 22:39:28,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 527 transitions, 13158 flow [2022-12-05 22:39:28,718 INFO L130 PetriNetUnfolder]: 359/966 cut-off events. [2022-12-05 22:39:28,718 INFO L131 PetriNetUnfolder]: For 38140/38245 co-relation queries the response was YES. [2022-12-05 22:39:28,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10761 conditions, 966 events. 359/966 cut-off events. For 38140/38245 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 7721 event pairs, 0 based on Foata normal form. 1/965 useless extension candidates. Maximal degree in co-relation 10666. Up to 506 conditions per place. [2022-12-05 22:39:28,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 527 transitions, 13158 flow [2022-12-05 22:39:28,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 1656 [2022-12-05 22:39:28,732 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:28,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-05 22:39:28,733 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 527 transitions, 13158 flow [2022-12-05 22:39:28,733 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:39:28,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:28,733 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:28,740 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:39:28,936 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:39:28,937 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:39:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1763697517, now seen corresponding path program 1 times [2022-12-05 22:39:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:28,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576016884] [2022-12-05 22:39:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:29,040 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:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576016884] [2022-12-05 22:39:29,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576016884] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:29,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624857885] [2022-12-05 22:39:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:29,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:29,042 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:39:29,043 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:39:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:29,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:29,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:29,211 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:29,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:29,526 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:29,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624857885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:29,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:29,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:39:29,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467013232] [2022-12-05 22:39:29,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:29,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:39:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:39:29,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:39:29,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:39:29,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 527 transitions, 13158 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:39:29,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:29,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:39:29,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:33,544 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:35,208 INFO L130 PetriNetUnfolder]: 2566/4419 cut-off events. [2022-12-05 22:39:35,208 INFO L131 PetriNetUnfolder]: For 260610/260610 co-relation queries the response was YES. [2022-12-05 22:39:35,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42335 conditions, 4419 events. 2566/4419 cut-off events. For 260610/260610 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 30265 event pairs, 141 based on Foata normal form. 54/4465 useless extension candidates. Maximal degree in co-relation 42237. Up to 1904 conditions per place. [2022-12-05 22:39:35,240 INFO L137 encePairwiseOnDemand]: 8/39 looper letters, 338 selfloop transitions, 505 changer transitions 4/847 dead transitions. [2022-12-05 22:39:35,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 847 transitions, 20505 flow [2022-12-05 22:39:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:39:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:39:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 224 transitions. [2022-12-05 22:39:35,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1794871794871795 [2022-12-05 22:39:35,243 INFO L175 Difference]: Start difference. First operand has 238 places, 527 transitions, 13158 flow. Second operand 32 states and 224 transitions. [2022-12-05 22:39:35,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 847 transitions, 20505 flow [2022-12-05 22:39:35,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 847 transitions, 19807 flow, removed 332 selfloop flow, removed 2 redundant places. [2022-12-05 22:39:35,951 INFO L231 Difference]: Finished difference. Result has 282 places, 681 transitions, 18461 flow [2022-12-05 22:39:35,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=12695, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=18461, PETRI_PLACES=282, PETRI_TRANSITIONS=681} [2022-12-05 22:39:35,953 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 264 predicate places. [2022-12-05 22:39:35,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:35,953 INFO L89 Accepts]: Start accepts. Operand has 282 places, 681 transitions, 18461 flow [2022-12-05 22:39:35,958 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:35,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:35,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 282 places, 681 transitions, 18461 flow [2022-12-05 22:39:35,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 681 transitions, 18461 flow [2022-12-05 22:39:36,201 INFO L130 PetriNetUnfolder]: 462/1222 cut-off events. [2022-12-05 22:39:36,201 INFO L131 PetriNetUnfolder]: For 66281/66363 co-relation queries the response was YES. [2022-12-05 22:39:36,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14912 conditions, 1222 events. 462/1222 cut-off events. For 66281/66363 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 10113 event pairs, 0 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 14802. Up to 683 conditions per place. [2022-12-05 22:39:36,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 681 transitions, 18461 flow [2022-12-05 22:39:36,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 2084 [2022-12-05 22:39:36,224 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:36,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-05 22:39:36,225 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 681 transitions, 18461 flow [2022-12-05 22:39:36,225 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:39:36,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:36,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:36,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:36,428 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:39:36,429 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:39:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash 349274853, now seen corresponding path program 1 times [2022-12-05 22:39:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:36,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378333050] [2022-12-05 22:39:36,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:36,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:36,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378333050] [2022-12-05 22:39:36,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378333050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163370478] [2022-12-05 22:39:36,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:36,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:36,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:36,494 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:39:36,496 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:39:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:36,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:39:36,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 22:39:36,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:36,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163370478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:36,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:36,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:39:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642112284] [2022-12-05 22:39:36,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:36,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:39:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:39:36,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:39:36,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-05 22:39:36,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 681 transitions, 18461 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:36,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:36,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-05 22:39:36,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:37,715 INFO L130 PetriNetUnfolder]: 2713/4593 cut-off events. [2022-12-05 22:39:37,716 INFO L131 PetriNetUnfolder]: For 306344/306344 co-relation queries the response was YES. [2022-12-05 22:39:37,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48482 conditions, 4593 events. 2713/4593 cut-off events. For 306344/306344 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 31913 event pairs, 430 based on Foata normal form. 8/4593 useless extension candidates. Maximal degree in co-relation 48369. Up to 2399 conditions per place. [2022-12-05 22:39:37,753 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 994 selfloop transitions, 10 changer transitions 75/1079 dead transitions. [2022-12-05 22:39:37,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1079 transitions, 31985 flow [2022-12-05 22:39:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:39:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:39:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-05 22:39:37,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37435897435897436 [2022-12-05 22:39:37,754 INFO L175 Difference]: Start difference. First operand has 282 places, 681 transitions, 18461 flow. Second operand 5 states and 73 transitions. [2022-12-05 22:39:37,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 1079 transitions, 31985 flow [2022-12-05 22:39:38,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1079 transitions, 28909 flow, removed 1422 selfloop flow, removed 8 redundant places. [2022-12-05 22:39:38,719 INFO L231 Difference]: Finished difference. Result has 278 places, 667 transitions, 16385 flow [2022-12-05 22:39:38,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=16359, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16385, PETRI_PLACES=278, PETRI_TRANSITIONS=667} [2022-12-05 22:39:38,720 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 260 predicate places. [2022-12-05 22:39:38,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:38,720 INFO L89 Accepts]: Start accepts. Operand has 278 places, 667 transitions, 16385 flow [2022-12-05 22:39:38,722 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:38,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:38,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 667 transitions, 16385 flow [2022-12-05 22:39:38,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 667 transitions, 16385 flow [2022-12-05 22:39:38,937 INFO L130 PetriNetUnfolder]: 513/1314 cut-off events. [2022-12-05 22:39:38,937 INFO L131 PetriNetUnfolder]: For 86247/86369 co-relation queries the response was YES. [2022-12-05 22:39:38,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15566 conditions, 1314 events. 513/1314 cut-off events. For 86247/86369 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 10809 event pairs, 2 based on Foata normal form. 1/1313 useless extension candidates. Maximal degree in co-relation 15457. Up to 729 conditions per place. [2022-12-05 22:39:38,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 667 transitions, 16385 flow [2022-12-05 22:39:38,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 2100 [2022-12-05 22:39:38,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:38,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-05 22:39:38,995 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 667 transitions, 16394 flow [2022-12-05 22:39:38,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:38,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:38,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:38,999 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:39:39,199 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:39:39,199 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:39:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash 347219832, now seen corresponding path program 1 times [2022-12-05 22:39:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:39,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074791040] [2022-12-05 22:39:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:39,306 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:39,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:39,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074791040] [2022-12-05 22:39:39,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074791040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:39,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897039537] [2022-12-05 22:39:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:39,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:39,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:39,321 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:39:39,321 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:39:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:39,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:39,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:39,499 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:39,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:39,931 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:39,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897039537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:39,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:39,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:39:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922519396] [2022-12-05 22:39:39,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:39:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:39,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:39:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:39:39,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-05 22:39:39,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 667 transitions, 16394 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:39:39,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:39,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-05 22:39:39,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:44,138 INFO L130 PetriNetUnfolder]: 3380/5693 cut-off events. [2022-12-05 22:39:44,139 INFO L131 PetriNetUnfolder]: For 555657/555657 co-relation queries the response was YES. [2022-12-05 22:39:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58488 conditions, 5693 events. 3380/5693 cut-off events. For 555657/555657 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 39150 event pairs, 267 based on Foata normal form. 104/5793 useless extension candidates. Maximal degree in co-relation 58376. Up to 2830 conditions per place. [2022-12-05 22:39:44,189 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 419 selfloop transitions, 555 changer transitions 8/982 dead transitions. [2022-12-05 22:39:44,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 982 transitions, 23705 flow [2022-12-05 22:39:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:39:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:39:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 206 transitions. [2022-12-05 22:39:44,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16940789473684212 [2022-12-05 22:39:44,190 INFO L175 Difference]: Start difference. First operand has 278 places, 667 transitions, 16394 flow. Second operand 32 states and 206 transitions. [2022-12-05 22:39:44,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 982 transitions, 23705 flow [2022-12-05 22:39:45,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 982 transitions, 23702 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 22:39:45,499 INFO L231 Difference]: Finished difference. Result has 321 places, 819 transitions, 22373 flow [2022-12-05 22:39:45,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16391, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=431, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=22373, PETRI_PLACES=321, PETRI_TRANSITIONS=819} [2022-12-05 22:39:45,499 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 303 predicate places. [2022-12-05 22:39:45,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:45,499 INFO L89 Accepts]: Start accepts. Operand has 321 places, 819 transitions, 22373 flow [2022-12-05 22:39:45,503 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:45,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:45,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 819 transitions, 22373 flow [2022-12-05 22:39:45,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 819 transitions, 22373 flow [2022-12-05 22:39:45,870 INFO L130 PetriNetUnfolder]: 654/1639 cut-off events. [2022-12-05 22:39:45,870 INFO L131 PetriNetUnfolder]: For 143141/143329 co-relation queries the response was YES. [2022-12-05 22:39:45,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21795 conditions, 1639 events. 654/1639 cut-off events. For 143141/143329 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 13872 event pairs, 2 based on Foata normal form. 2/1639 useless extension candidates. Maximal degree in co-relation 21672. Up to 957 conditions per place. [2022-12-05 22:39:45,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 819 transitions, 22373 flow [2022-12-05 22:39:45,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 2540 [2022-12-05 22:39:46,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:39:46,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:39:46,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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 [381] L705-6-->L687-5: Formula: (and (= (* 5 v_~prev~0_260) (+ (* v_~prev~0_261 13) (* 21 v_~cur~0_216) (* 3 v_~next~0_134))) (< v_~x~0_245 1) (= v_~next~0_134 v_~cur~0_215) (= v_~p~0_164 (+ v_~p~0_165 1)) (= (* 2 v_~next~0_134) (+ (* 3 v_~prev~0_260) (* 34 v_~cur~0_216) (* 21 v_~prev~0_261))) (< v_~p~0_165 5) (= (+ 12 v_~x~0_245) v_~x~0_244) (= (+ v_~j~0_311 v_~i~0_280) v_~i~0_279)) InVars {~j~0=v_~j~0_311, ~prev~0=v_~prev~0_261, ~i~0=v_~i~0_280, ~p~0=v_~p~0_165, ~cur~0=v_~cur~0_216, ~x~0=v_~x~0_245} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_155|, ~j~0=v_~j~0_311, ~next~0=v_~next~0_134, ~prev~0=v_~prev~0_260, ~i~0=v_~i~0_279, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_123|, ~p~0=v_~p~0_164, ~cur~0=v_~cur~0_215, ~x~0=v_~x~0_244} 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:39:46,327 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:39:46,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 829 [2022-12-05 22:39:46,328 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 819 transitions, 22433 flow [2022-12-05 22:39:46,328 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:39:46,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:46,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:46,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-05 22:39:46,531 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:39:46,532 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:39:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 67778637, now seen corresponding path program 1 times [2022-12-05 22:39:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:46,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867484730] [2022-12-05 22:39:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:39:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867484730] [2022-12-05 22:39:46,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867484730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150140077] [2022-12-05 22:39:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:46,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:46,561 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:39:46,564 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:39:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:46,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:39:46,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:46,638 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:39:46,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:39:46,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150140077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:39:46,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:39:46,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:39:46,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164006414] [2022-12-05 22:39:46,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:39:46,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:39:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:39:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:39:46,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-05 22:39:46,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 819 transitions, 22433 flow. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:39:46,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:46,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-05 22:39:46,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:48,366 INFO L130 PetriNetUnfolder]: 3431/5759 cut-off events. [2022-12-05 22:39:48,366 INFO L131 PetriNetUnfolder]: For 497118/497118 co-relation queries the response was YES. [2022-12-05 22:39:48,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64362 conditions, 5759 events. 3431/5759 cut-off events. For 497118/497118 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 41407 event pairs, 563 based on Foata normal form. 4/5761 useless extension candidates. Maximal degree in co-relation 64236. Up to 3195 conditions per place. [2022-12-05 22:39:48,420 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 1225 selfloop transitions, 14 changer transitions 76/1315 dead transitions. [2022-12-05 22:39:48,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1315 transitions, 39099 flow [2022-12-05 22:39:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:39:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:39:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-05 22:39:48,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2022-12-05 22:39:48,421 INFO L175 Difference]: Start difference. First operand has 321 places, 819 transitions, 22433 flow. Second operand 5 states and 79 transitions. [2022-12-05 22:39:48,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1315 transitions, 39099 flow [2022-12-05 22:39:50,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1315 transitions, 36598 flow, removed 1183 selfloop flow, removed 9 redundant places. [2022-12-05 22:39:50,094 INFO L231 Difference]: Finished difference. Result has 316 places, 815 transitions, 20822 flow [2022-12-05 22:39:50,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=20788, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20822, PETRI_PLACES=316, PETRI_TRANSITIONS=815} [2022-12-05 22:39:50,095 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 298 predicate places. [2022-12-05 22:39:50,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:50,095 INFO L89 Accepts]: Start accepts. Operand has 316 places, 815 transitions, 20822 flow [2022-12-05 22:39:50,098 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:50,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:50,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 815 transitions, 20822 flow [2022-12-05 22:39:50,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 815 transitions, 20822 flow [2022-12-05 22:39:50,413 INFO L130 PetriNetUnfolder]: 669/1671 cut-off events. [2022-12-05 22:39:50,413 INFO L131 PetriNetUnfolder]: For 149487/149651 co-relation queries the response was YES. [2022-12-05 22:39:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21524 conditions, 1671 events. 669/1671 cut-off events. For 149487/149651 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 14107 event pairs, 4 based on Foata normal form. 1/1667 useless extension candidates. Maximal degree in co-relation 21401. Up to 871 conditions per place. [2022-12-05 22:39:50,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 815 transitions, 20822 flow [2022-12-05 22:39:50,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 2556 [2022-12-05 22:39:50,445 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:50,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-05 22:39:50,446 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 815 transitions, 20822 flow [2022-12-05 22:39:50,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:39:50,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:50,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:50,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-05 22:39:50,650 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:39:50,650 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:39:50,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash -110366445, now seen corresponding path program 1 times [2022-12-05 22:39:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610115294] [2022-12-05 22:39:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:50,752 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:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:50,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610115294] [2022-12-05 22:39:50,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610115294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:50,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394195923] [2022-12-05 22:39:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:50,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:50,754 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:39:50,759 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:39:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:50,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:50,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:50,976 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:50,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:51,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:39:51,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394195923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:51,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:51,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213410819] [2022-12-05 22:39:51,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:51,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:51,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-05 22:39:51,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 815 transitions, 20822 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:39:51,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:51,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-05 22:39:51,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:56,110 INFO L130 PetriNetUnfolder]: 3478/5877 cut-off events. [2022-12-05 22:39:56,110 INFO L131 PetriNetUnfolder]: For 554437/554437 co-relation queries the response was YES. [2022-12-05 22:39:56,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63505 conditions, 5877 events. 3478/5877 cut-off events. For 554437/554437 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 40896 event pairs, 577 based on Foata normal form. 47/5922 useless extension candidates. Maximal degree in co-relation 63379. Up to 4763 conditions per place. [2022-12-05 22:39:56,168 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 690 selfloop transitions, 250 changer transitions 14/954 dead transitions. [2022-12-05 22:39:56,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 954 transitions, 24468 flow [2022-12-05 22:39:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 22:39:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 22:39:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 138 transitions. [2022-12-05 22:39:56,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16428571428571428 [2022-12-05 22:39:56,170 INFO L175 Difference]: Start difference. First operand has 315 places, 815 transitions, 20822 flow. Second operand 20 states and 138 transitions. [2022-12-05 22:39:56,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 954 transitions, 24468 flow [2022-12-05 22:39:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 954 transitions, 24183 flow, removed 129 selfloop flow, removed 2 redundant places. [2022-12-05 22:39:57,991 INFO L231 Difference]: Finished difference. Result has 336 places, 844 transitions, 22154 flow [2022-12-05 22:39:57,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=20575, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=815, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=22154, PETRI_PLACES=336, PETRI_TRANSITIONS=844} [2022-12-05 22:39:57,992 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 318 predicate places. [2022-12-05 22:39:57,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:57,992 INFO L89 Accepts]: Start accepts. Operand has 336 places, 844 transitions, 22154 flow [2022-12-05 22:39:57,995 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:57,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:57,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 336 places, 844 transitions, 22154 flow [2022-12-05 22:39:58,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 844 transitions, 22154 flow [2022-12-05 22:39:58,422 INFO L130 PetriNetUnfolder]: 678/1719 cut-off events. [2022-12-05 22:39:58,422 INFO L131 PetriNetUnfolder]: For 162487/162656 co-relation queries the response was YES. [2022-12-05 22:39:58,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22451 conditions, 1719 events. 678/1719 cut-off events. For 162487/162656 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 14836 event pairs, 4 based on Foata normal form. 1/1715 useless extension candidates. Maximal degree in co-relation 22323. Up to 901 conditions per place. [2022-12-05 22:39:58,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 336 places, 844 transitions, 22154 flow [2022-12-05 22:39:58,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 2614 [2022-12-05 22:39:58,456 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:58,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-05 22:39:58,456 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 844 transitions, 22154 flow [2022-12-05 22:39:58,456 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:39:58,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:58,456 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:58,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-05 22:39:58,660 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:39:58,661 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:39:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -110200192, now seen corresponding path program 1 times [2022-12-05 22:39:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:58,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727231515] [2022-12-05 22:39:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:58,767 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:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:58,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727231515] [2022-12-05 22:39:58,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727231515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:58,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521746816] [2022-12-05 22:39:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:58,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:58,787 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:39:58,801 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:39:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:58,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:39:58,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:58,995 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:58,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:59,226 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:59,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521746816] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:59,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:59,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630773414] [2022-12-05 22:39:59,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:59,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:59,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:59,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-05 22:39:59,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 844 transitions, 22154 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:39:59,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:59,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-05 22:39:59,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:03,853 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:40:07,838 INFO L130 PetriNetUnfolder]: 3565/6052 cut-off events. [2022-12-05 22:40:07,838 INFO L131 PetriNetUnfolder]: For 589941/589941 co-relation queries the response was YES. [2022-12-05 22:40:07,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66284 conditions, 6052 events. 3565/6052 cut-off events. For 589941/589941 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 42637 event pairs, 569 based on Foata normal form. 41/6091 useless extension candidates. Maximal degree in co-relation 66153. Up to 4744 conditions per place. [2022-12-05 22:40:07,899 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 695 selfloop transitions, 315 changer transitions 6/1016 dead transitions. [2022-12-05 22:40:07,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1016 transitions, 26539 flow [2022-12-05 22:40:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:40:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:40:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 151 transitions. [2022-12-05 22:40:07,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1634199134199134 [2022-12-05 22:40:07,901 INFO L175 Difference]: Start difference. First operand has 336 places, 844 transitions, 22154 flow. Second operand 22 states and 151 transitions. [2022-12-05 22:40:07,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1016 transitions, 26539 flow [2022-12-05 22:40:09,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1016 transitions, 26392 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-05 22:40:09,986 INFO L231 Difference]: Finished difference. Result has 353 places, 890 transitions, 24351 flow [2022-12-05 22:40:09,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=22007, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=24351, PETRI_PLACES=353, PETRI_TRANSITIONS=890} [2022-12-05 22:40:09,987 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 335 predicate places. [2022-12-05 22:40:09,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:09,987 INFO L89 Accepts]: Start accepts. Operand has 353 places, 890 transitions, 24351 flow [2022-12-05 22:40:09,991 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:09,991 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:09,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 890 transitions, 24351 flow [2022-12-05 22:40:09,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 890 transitions, 24351 flow [2022-12-05 22:40:10,394 INFO L130 PetriNetUnfolder]: 702/1792 cut-off events. [2022-12-05 22:40:10,394 INFO L131 PetriNetUnfolder]: For 175673/175850 co-relation queries the response was YES. [2022-12-05 22:40:10,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24013 conditions, 1792 events. 702/1792 cut-off events. For 175673/175850 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 15611 event pairs, 4 based on Foata normal form. 1/1788 useless extension candidates. Maximal degree in co-relation 23880. Up to 948 conditions per place. [2022-12-05 22:40:10,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 890 transitions, 24351 flow [2022-12-05 22:40:10,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 2710 [2022-12-05 22:40:10,674 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:40:10,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 687 [2022-12-05 22:40:10,674 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 890 transitions, 24450 flow [2022-12-05 22:40:10,674 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:10,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:10,675 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:10,679 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:40:10,875 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:40:10,875 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:40:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 347795471, now seen corresponding path program 1 times [2022-12-05 22:40:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:10,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818772190] [2022-12-05 22:40:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:10,904 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:40:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:10,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818772190] [2022-12-05 22:40:10,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818772190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:10,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655969967] [2022-12-05 22:40:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:10,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:10,917 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:40:10,917 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:40:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:10,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:40:10,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:10,991 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:40:10,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:40:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655969967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:10,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:40:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:40:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442538833] [2022-12-05 22:40:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:10,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:40:10,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:40:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:40:10,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-05 22:40:10,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 890 transitions, 24450 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:10,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:10,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-05 22:40:10,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:12,875 INFO L130 PetriNetUnfolder]: 3353/5763 cut-off events. [2022-12-05 22:40:12,876 INFO L131 PetriNetUnfolder]: For 528651/528651 co-relation queries the response was YES. [2022-12-05 22:40:12,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64971 conditions, 5763 events. 3353/5763 cut-off events. For 528651/528651 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 42627 event pairs, 476 based on Foata normal form. 103/5864 useless extension candidates. Maximal degree in co-relation 64835. Up to 2947 conditions per place. [2022-12-05 22:40:12,930 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 1277 selfloop transitions, 43 changer transitions 87/1407 dead transitions. [2022-12-05 22:40:12,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1407 transitions, 41846 flow [2022-12-05 22:40:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:40:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:40:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-05 22:40:12,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32971014492753625 [2022-12-05 22:40:12,931 INFO L175 Difference]: Start difference. First operand has 353 places, 890 transitions, 24450 flow. Second operand 6 states and 91 transitions. [2022-12-05 22:40:12,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1407 transitions, 41846 flow [2022-12-05 22:40:14,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 1407 transitions, 41063 flow, removed 247 selfloop flow, removed 10 redundant places. [2022-12-05 22:40:14,810 INFO L231 Difference]: Finished difference. Result has 350 places, 860 transitions, 23485 flow [2022-12-05 22:40:14,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23056, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=23485, PETRI_PLACES=350, PETRI_TRANSITIONS=860} [2022-12-05 22:40:14,811 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 332 predicate places. [2022-12-05 22:40:14,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:14,811 INFO L89 Accepts]: Start accepts. Operand has 350 places, 860 transitions, 23485 flow [2022-12-05 22:40:14,814 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:14,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:14,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 860 transitions, 23485 flow [2022-12-05 22:40:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 860 transitions, 23485 flow [2022-12-05 22:40:15,164 INFO L130 PetriNetUnfolder]: 640/1708 cut-off events. [2022-12-05 22:40:15,164 INFO L131 PetriNetUnfolder]: For 177104/177272 co-relation queries the response was YES. [2022-12-05 22:40:15,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23472 conditions, 1708 events. 640/1708 cut-off events. For 177104/177272 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 15188 event pairs, 4 based on Foata normal form. 13/1718 useless extension candidates. Maximal degree in co-relation 23339. Up to 881 conditions per place. [2022-12-05 22:40:15,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 860 transitions, 23485 flow [2022-12-05 22:40:15,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 2650 [2022-12-05 22:40:15,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:40:15,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-05 22:40:15,199 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 860 transitions, 23485 flow [2022-12-05 22:40:15,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:15,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:15,199 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:15,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:15,403 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:40:15,403 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:40:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash -173233701, now seen corresponding path program 1 times [2022-12-05 22:40:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750484897] [2022-12-05 22:40:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:15,491 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:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750484897] [2022-12-05 22:40:15,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750484897] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028300854] [2022-12-05 22:40:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:15,493 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:40:15,495 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:40:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:15,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:40:15,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:15,661 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:15,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:15,980 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:15,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028300854] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:15,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:15,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650660472] [2022-12-05 22:40:15,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:15,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:15,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:15,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-05 22:40:15,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 860 transitions, 23485 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:15,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:15,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-05 22:40:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:24,676 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:28,789 INFO L130 PetriNetUnfolder]: 3416/5891 cut-off events. [2022-12-05 22:40:28,789 INFO L131 PetriNetUnfolder]: For 569841/569841 co-relation queries the response was YES. [2022-12-05 22:40:28,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67593 conditions, 5891 events. 3416/5891 cut-off events. For 569841/569841 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 42309 event pairs, 634 based on Foata normal form. 20/5909 useless extension candidates. Maximal degree in co-relation 67457. Up to 4979 conditions per place. [2022-12-05 22:40:28,848 INFO L137 encePairwiseOnDemand]: 11/46 looper letters, 741 selfloop transitions, 240 changer transitions 11/992 dead transitions. [2022-12-05 22:40:28,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 992 transitions, 27302 flow [2022-12-05 22:40:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:40:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:40:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 162 transitions. [2022-12-05 22:40:28,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1354515050167224 [2022-12-05 22:40:28,850 INFO L175 Difference]: Start difference. First operand has 350 places, 860 transitions, 23485 flow. Second operand 26 states and 162 transitions. [2022-12-05 22:40:28,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 992 transitions, 27302 flow [2022-12-05 22:40:31,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 992 transitions, 27054 flow, removed 120 selfloop flow, removed 2 redundant places. [2022-12-05 22:40:31,213 INFO L231 Difference]: Finished difference. Result has 377 places, 890 transitions, 24935 flow [2022-12-05 22:40:31,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=23253, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24935, PETRI_PLACES=377, PETRI_TRANSITIONS=890} [2022-12-05 22:40:31,214 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 359 predicate places. [2022-12-05 22:40:31,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:31,214 INFO L89 Accepts]: Start accepts. Operand has 377 places, 890 transitions, 24935 flow [2022-12-05 22:40:31,218 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:31,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:31,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 377 places, 890 transitions, 24935 flow [2022-12-05 22:40:31,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 890 transitions, 24935 flow [2022-12-05 22:40:31,626 INFO L130 PetriNetUnfolder]: 652/1756 cut-off events. [2022-12-05 22:40:31,626 INFO L131 PetriNetUnfolder]: For 187399/187580 co-relation queries the response was YES. [2022-12-05 22:40:31,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24375 conditions, 1756 events. 652/1756 cut-off events. For 187399/187580 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 15770 event pairs, 2 based on Foata normal form. 12/1764 useless extension candidates. Maximal degree in co-relation 24237. Up to 914 conditions per place. [2022-12-05 22:40:31,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 890 transitions, 24935 flow [2022-12-05 22:40:31,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 2710 [2022-12-05 22:40:32,116 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:40:32,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 902 [2022-12-05 22:40:32,116 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 890 transitions, 25043 flow [2022-12-05 22:40:32,116 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:32,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:32,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:32,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-05 22:40:32,317 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:40:32,317 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:40:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 347794913, now seen corresponding path program 1 times [2022-12-05 22:40:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:32,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643254375] [2022-12-05 22:40:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:32,422 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:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:32,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643254375] [2022-12-05 22:40:32,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643254375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:32,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754465662] [2022-12-05 22:40:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:32,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:32,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:32,424 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:40:32,424 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:40:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:32,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:40:32,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:32,611 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:32,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:32,927 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:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754465662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:32,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:32,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:40:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087700217] [2022-12-05 22:40:32,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:32,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:40:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:40:32,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:40:32,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-05 22:40:32,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 890 transitions, 25043 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:40:32,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:32,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-05 22:40:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:38,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:40:40,739 INFO L130 PetriNetUnfolder]: 3482/6025 cut-off events. [2022-12-05 22:40:40,739 INFO L131 PetriNetUnfolder]: For 635636/635636 co-relation queries the response was YES. [2022-12-05 22:40:40,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70221 conditions, 6025 events. 3482/6025 cut-off events. For 635636/635636 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 43589 event pairs, 501 based on Foata normal form. 20/6043 useless extension candidates. Maximal degree in co-relation 70080. Up to 4345 conditions per place. [2022-12-05 22:40:40,798 INFO L137 encePairwiseOnDemand]: 8/51 looper letters, 677 selfloop transitions, 397 changer transitions 8/1082 dead transitions. [2022-12-05 22:40:40,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1082 transitions, 29754 flow [2022-12-05 22:40:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-05 22:40:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-05 22:40:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 215 transitions. [2022-12-05 22:40:40,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12399077277970011 [2022-12-05 22:40:40,799 INFO L175 Difference]: Start difference. First operand has 377 places, 890 transitions, 25043 flow. Second operand 34 states and 215 transitions. [2022-12-05 22:40:40,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1082 transitions, 29754 flow [2022-12-05 22:40:43,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 1082 transitions, 29422 flow, removed 116 selfloop flow, removed 14 redundant places. [2022-12-05 22:40:43,353 INFO L231 Difference]: Finished difference. Result has 402 places, 919 transitions, 26616 flow [2022-12-05 22:40:43,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=24711, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=26616, PETRI_PLACES=402, PETRI_TRANSITIONS=919} [2022-12-05 22:40:43,354 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 384 predicate places. [2022-12-05 22:40:43,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:43,354 INFO L89 Accepts]: Start accepts. Operand has 402 places, 919 transitions, 26616 flow [2022-12-05 22:40:43,360 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:43,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:43,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 919 transitions, 26616 flow [2022-12-05 22:40:43,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 919 transitions, 26616 flow [2022-12-05 22:40:43,809 INFO L130 PetriNetUnfolder]: 690/1825 cut-off events. [2022-12-05 22:40:43,809 INFO L131 PetriNetUnfolder]: For 205246/205450 co-relation queries the response was YES. [2022-12-05 22:40:43,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26095 conditions, 1825 events. 690/1825 cut-off events. For 205246/205450 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 16288 event pairs, 2 based on Foata normal form. 17/1836 useless extension candidates. Maximal degree in co-relation 25949. Up to 953 conditions per place. [2022-12-05 22:40:43,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 919 transitions, 26616 flow [2022-12-05 22:40:43,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 2768 [2022-12-05 22:40:43,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:43,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:44,245 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:40:44,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 892 [2022-12-05 22:40:44,246 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 919 transitions, 26818 flow [2022-12-05 22:40:44,246 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:40:44,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:44,246 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:44,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-05 22:40:44,450 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:40:44,450 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:40:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -171766254, now seen corresponding path program 1 times [2022-12-05 22:40:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:44,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130186787] [2022-12-05 22:40:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:44,545 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:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130186787] [2022-12-05 22:40:44,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130186787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:44,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339202922] [2022-12-05 22:40:44,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:44,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:44,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:44,547 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:40:44,548 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:40:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:44,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:40:44,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:44,722 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:44,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:44,932 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:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339202922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:44,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:44,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969451026] [2022-12-05 22:40:44,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:44,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:44,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:44,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:44,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-05 22:40:44,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 919 transitions, 26818 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:44,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:44,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-05 22:40:44,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:49,571 INFO L130 PetriNetUnfolder]: 3601/6270 cut-off events. [2022-12-05 22:40:49,571 INFO L131 PetriNetUnfolder]: For 719620/719620 co-relation queries the response was YES. [2022-12-05 22:40:49,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75222 conditions, 6270 events. 3601/6270 cut-off events. For 719620/719620 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 46356 event pairs, 680 based on Foata normal form. 31/6299 useless extension candidates. Maximal degree in co-relation 75073. Up to 5028 conditions per place. [2022-12-05 22:40:49,630 INFO L137 encePairwiseOnDemand]: 11/58 looper letters, 756 selfloop transitions, 322 changer transitions 11/1089 dead transitions. [2022-12-05 22:40:49,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 1089 transitions, 32063 flow [2022-12-05 22:40:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:40:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:40:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 175 transitions. [2022-12-05 22:40:49,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11604774535809019 [2022-12-05 22:40:49,631 INFO L175 Difference]: Start difference. First operand has 402 places, 919 transitions, 26818 flow. Second operand 26 states and 175 transitions. [2022-12-05 22:40:49,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 1089 transitions, 32063 flow [2022-12-05 22:40:52,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1089 transitions, 31395 flow, removed 288 selfloop flow, removed 11 redundant places. [2022-12-05 22:40:52,816 INFO L231 Difference]: Finished difference. Result has 421 places, 976 transitions, 29258 flow [2022-12-05 22:40:52,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=26150, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=29258, PETRI_PLACES=421, PETRI_TRANSITIONS=976} [2022-12-05 22:40:52,817 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 403 predicate places. [2022-12-05 22:40:52,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:52,817 INFO L89 Accepts]: Start accepts. Operand has 421 places, 976 transitions, 29258 flow [2022-12-05 22:40:52,819 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:52,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:52,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 976 transitions, 29258 flow [2022-12-05 22:40:52,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 976 transitions, 29258 flow [2022-12-05 22:40:53,296 INFO L130 PetriNetUnfolder]: 719/1916 cut-off events. [2022-12-05 22:40:53,296 INFO L131 PetriNetUnfolder]: For 222781/223054 co-relation queries the response was YES. [2022-12-05 22:40:53,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28024 conditions, 1916 events. 719/1916 cut-off events. For 222781/223054 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 17490 event pairs, 1 based on Foata normal form. 17/1927 useless extension candidates. Maximal degree in co-relation 27873. Up to 1003 conditions per place. [2022-12-05 22:40:53,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 976 transitions, 29258 flow [2022-12-05 22:40:53,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 2876 [2022-12-05 22:40:53,511 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:40:53,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 695 [2022-12-05 22:40:53,512 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 975 transitions, 29265 flow [2022-12-05 22:40:53,512 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:53,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:53,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:53,518 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:40:53,718 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:40:53,719 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:40:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 67812055, now seen corresponding path program 1 times [2022-12-05 22:40:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:53,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33661361] [2022-12-05 22:40:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:53,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:53,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:53,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33661361] [2022-12-05 22:40:53,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33661361] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:53,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148128058] [2022-12-05 22:40:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:53,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:53,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:53,773 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:40:53,774 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:40:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:53,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:40:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:40:53,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:40:53,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148128058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:40:53,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:40:53,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:40:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956575515] [2022-12-05 22:40:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:40:53,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:40:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:40:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:40:53,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-05 22:40:53,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 975 transitions, 29265 flow. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:40:53,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:53,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-05 22:40:53,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:56,022 INFO L130 PetriNetUnfolder]: 3599/6274 cut-off events. [2022-12-05 22:40:56,022 INFO L131 PetriNetUnfolder]: For 714551/714551 co-relation queries the response was YES. [2022-12-05 22:40:56,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76690 conditions, 6274 events. 3599/6274 cut-off events. For 714551/714551 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 48012 event pairs, 506 based on Foata normal form. 38/6310 useless extension candidates. Maximal degree in co-relation 76536. Up to 3030 conditions per place. [2022-12-05 22:40:56,176 INFO L137 encePairwiseOnDemand]: 39/62 looper letters, 1443 selfloop transitions, 30 changer transitions 91/1564 dead transitions. [2022-12-05 22:40:56,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1564 transitions, 49673 flow [2022-12-05 22:40:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:40:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:40:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-05 22:40:56,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2022-12-05 22:40:56,177 INFO L175 Difference]: Start difference. First operand has 419 places, 975 transitions, 29265 flow. Second operand 5 states and 103 transitions. [2022-12-05 22:40:56,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1564 transitions, 49673 flow [2022-12-05 22:40:59,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1564 transitions, 49012 flow, removed 234 selfloop flow, removed 15 redundant places. [2022-12-05 22:40:59,091 INFO L231 Difference]: Finished difference. Result has 410 places, 965 transitions, 28433 flow [2022-12-05 22:40:59,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=28296, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28433, PETRI_PLACES=410, PETRI_TRANSITIONS=965} [2022-12-05 22:40:59,092 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 392 predicate places. [2022-12-05 22:40:59,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:59,092 INFO L89 Accepts]: Start accepts. Operand has 410 places, 965 transitions, 28433 flow [2022-12-05 22:40:59,096 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:59,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:59,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 410 places, 965 transitions, 28433 flow [2022-12-05 22:40:59,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 409 places, 965 transitions, 28433 flow [2022-12-05 22:40:59,544 INFO L130 PetriNetUnfolder]: 709/1919 cut-off events. [2022-12-05 22:40:59,544 INFO L131 PetriNetUnfolder]: For 232210/232468 co-relation queries the response was YES. [2022-12-05 22:40:59,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28477 conditions, 1919 events. 709/1919 cut-off events. For 232210/232468 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 17620 event pairs, 1 based on Foata normal form. 17/1930 useless extension candidates. Maximal degree in co-relation 28326. Up to 989 conditions per place. [2022-12-05 22:40:59,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 409 places, 965 transitions, 28433 flow [2022-12-05 22:40:59,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 2882 [2022-12-05 22:40:59,585 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:40:59,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 493 [2022-12-05 22:40:59,585 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 965 transitions, 28433 flow [2022-12-05 22:40:59,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:40:59,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:59,585 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:59,589 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:40:59,789 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:40:59,790 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:40:59,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -126305188, now seen corresponding path program 1 times [2022-12-05 22:40:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:59,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808561431] [2022-12-05 22:40:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:59,877 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:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:59,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808561431] [2022-12-05 22:40:59,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808561431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:59,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081271115] [2022-12-05 22:40:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:59,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:59,892 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:40:59,939 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:40:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:59,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:40:59,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:00,126 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:00,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:00,318 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:00,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081271115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:00,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:00,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:41:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470172314] [2022-12-05 22:41:00,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:00,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:41:00,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:00,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:41:00,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:41:00,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:41:00,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 965 transitions, 28433 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:00,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:00,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:41:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:04,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:08,365 INFO L130 PetriNetUnfolder]: 3704/6484 cut-off events. [2022-12-05 22:41:08,365 INFO L131 PetriNetUnfolder]: For 844844/844844 co-relation queries the response was YES. [2022-12-05 22:41:08,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80697 conditions, 6484 events. 3704/6484 cut-off events. For 844844/844844 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 48378 event pairs, 632 based on Foata normal form. 48/6530 useless extension candidates. Maximal degree in co-relation 80543. Up to 5060 conditions per place. [2022-12-05 22:41:08,434 INFO L137 encePairwiseOnDemand]: 11/61 looper letters, 766 selfloop transitions, 360 changer transitions 12/1138 dead transitions. [2022-12-05 22:41:08,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1138 transitions, 33532 flow [2022-12-05 22:41:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:41:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:41:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 173 transitions. [2022-12-05 22:41:08,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11344262295081967 [2022-12-05 22:41:08,435 INFO L175 Difference]: Start difference. First operand has 409 places, 965 transitions, 28433 flow. Second operand 25 states and 173 transitions. [2022-12-05 22:41:08,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1138 transitions, 33532 flow [2022-12-05 22:41:12,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 1138 transitions, 33531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:41:12,135 INFO L231 Difference]: Finished difference. Result has 437 places, 1012 transitions, 31141 flow [2022-12-05 22:41:12,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=28432, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=31141, PETRI_PLACES=437, PETRI_TRANSITIONS=1012} [2022-12-05 22:41:12,136 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 419 predicate places. [2022-12-05 22:41:12,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:12,136 INFO L89 Accepts]: Start accepts. Operand has 437 places, 1012 transitions, 31141 flow [2022-12-05 22:41:12,140 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:12,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:12,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 1012 transitions, 31141 flow [2022-12-05 22:41:12,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 1012 transitions, 31141 flow [2022-12-05 22:41:12,644 INFO L130 PetriNetUnfolder]: 738/2005 cut-off events. [2022-12-05 22:41:12,644 INFO L131 PetriNetUnfolder]: For 259630/259909 co-relation queries the response was YES. [2022-12-05 22:41:12,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30712 conditions, 2005 events. 738/2005 cut-off events. For 259630/259909 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 18534 event pairs, 1 based on Foata normal form. 18/2019 useless extension candidates. Maximal degree in co-relation 30555. Up to 1037 conditions per place. [2022-12-05 22:41:12,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 437 places, 1012 transitions, 31141 flow [2022-12-05 22:41:12,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 2982 [2022-12-05 22:41:12,689 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:41:12,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-05 22:41:12,689 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 1012 transitions, 31141 flow [2022-12-05 22:41:12,690 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:12,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:12,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:12,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-05 22:41:12,890 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:41:12,890 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:41:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -109878815, now seen corresponding path program 1 times [2022-12-05 22:41:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:12,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117336916] [2022-12-05 22:41:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:12,976 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:41:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117336916] [2022-12-05 22:41:12,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117336916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900210350] [2022-12-05 22:41:12,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:12,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:12,978 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:41:12,980 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:41:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:13,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:41:13,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:13,157 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:41:13,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:13,352 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:41:13,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900210350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:13,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:13,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:41:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556816610] [2022-12-05 22:41:13,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:13,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:41:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:41:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:41:13,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:41:13,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1012 transitions, 31141 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:13,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:13,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:41:13,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:15,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:17,954 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:41:20,813 INFO L130 PetriNetUnfolder]: 3754/6598 cut-off events. [2022-12-05 22:41:20,814 INFO L131 PetriNetUnfolder]: For 778357/778357 co-relation queries the response was YES. [2022-12-05 22:41:20,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84295 conditions, 6598 events. 3754/6598 cut-off events. For 778357/778357 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 49589 event pairs, 636 based on Foata normal form. 11/6607 useless extension candidates. Maximal degree in co-relation 84135. Up to 5122 conditions per place. [2022-12-05 22:41:20,885 INFO L137 encePairwiseOnDemand]: 10/61 looper letters, 789 selfloop transitions, 369 changer transitions 26/1184 dead transitions. [2022-12-05 22:41:20,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1184 transitions, 36139 flow [2022-12-05 22:41:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:41:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:41:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 165 transitions. [2022-12-05 22:41:20,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11270491803278689 [2022-12-05 22:41:20,886 INFO L175 Difference]: Start difference. First operand has 437 places, 1012 transitions, 31141 flow. Second operand 24 states and 165 transitions. [2022-12-05 22:41:20,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1184 transitions, 36139 flow [2022-12-05 22:41:25,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 1184 transitions, 35876 flow, removed 65 selfloop flow, removed 12 redundant places. [2022-12-05 22:41:25,159 INFO L231 Difference]: Finished difference. Result has 451 places, 1036 transitions, 32894 flow [2022-12-05 22:41:25,159 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=30878, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=32894, PETRI_PLACES=451, PETRI_TRANSITIONS=1036} [2022-12-05 22:41:25,160 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 433 predicate places. [2022-12-05 22:41:25,160 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:25,160 INFO L89 Accepts]: Start accepts. Operand has 451 places, 1036 transitions, 32894 flow [2022-12-05 22:41:25,165 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:25,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:25,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 451 places, 1036 transitions, 32894 flow [2022-12-05 22:41:25,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 450 places, 1036 transitions, 32894 flow [2022-12-05 22:41:25,672 INFO L130 PetriNetUnfolder]: 750/2040 cut-off events. [2022-12-05 22:41:25,672 INFO L131 PetriNetUnfolder]: For 268282/268562 co-relation queries the response was YES. [2022-12-05 22:41:25,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31844 conditions, 2040 events. 750/2040 cut-off events. For 268282/268562 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 18960 event pairs, 1 based on Foata normal form. 18/2054 useless extension candidates. Maximal degree in co-relation 31683. Up to 1062 conditions per place. [2022-12-05 22:41:25,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 1036 transitions, 32894 flow [2022-12-05 22:41:25,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 3020 [2022-12-05 22:41:25,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:41:25,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 595 [2022-12-05 22:41:25,755 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 1035 transitions, 32876 flow [2022-12-05 22:41:25,755 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:25,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:25,755 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:25,759 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:41:25,959 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:41:25,959 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:41:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -798747923, now seen corresponding path program 1 times [2022-12-05 22:41:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:25,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145396862] [2022-12-05 22:41:25,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:25,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145396862] [2022-12-05 22:41:25,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145396862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:25,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378008401] [2022-12-05 22:41:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:25,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:25,996 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:41:25,998 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:41:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:26,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 22:41:26,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:41:26,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:41:26,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378008401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:41:26,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:41:26,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-05 22:41:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240650297] [2022-12-05 22:41:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:41:26,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:41:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:41:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:41:26,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-05 22:41:26,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 1035 transitions, 32876 flow. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:26,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:26,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-05 22:41:26,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:28,779 INFO L130 PetriNetUnfolder]: 4038/7026 cut-off events. [2022-12-05 22:41:28,779 INFO L131 PetriNetUnfolder]: For 892679/892679 co-relation queries the response was YES. [2022-12-05 22:41:28,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92354 conditions, 7026 events. 4038/7026 cut-off events. For 892679/892679 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 54459 event pairs, 490 based on Foata normal form. 156/7180 useless extension candidates. Maximal degree in co-relation 92190. Up to 3970 conditions per place. [2022-12-05 22:41:28,855 INFO L137 encePairwiseOnDemand]: 34/59 looper letters, 1352 selfloop transitions, 247 changer transitions 92/1691 dead transitions. [2022-12-05 22:41:28,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1691 transitions, 57184 flow [2022-12-05 22:41:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:41:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:41:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-12-05 22:41:28,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-05 22:41:28,856 INFO L175 Difference]: Start difference. First operand has 449 places, 1035 transitions, 32876 flow. Second operand 7 states and 118 transitions. [2022-12-05 22:41:28,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1691 transitions, 57184 flow [2022-12-05 22:41:32,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1691 transitions, 56227 flow, removed 189 selfloop flow, removed 19 redundant places. [2022-12-05 22:41:32,825 INFO L231 Difference]: Finished difference. Result has 438 places, 1075 transitions, 34583 flow [2022-12-05 22:41:32,826 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=31237, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34583, PETRI_PLACES=438, PETRI_TRANSITIONS=1075} [2022-12-05 22:41:32,827 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 420 predicate places. [2022-12-05 22:41:32,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:32,827 INFO L89 Accepts]: Start accepts. Operand has 438 places, 1075 transitions, 34583 flow [2022-12-05 22:41:32,834 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:32,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:32,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 438 places, 1075 transitions, 34583 flow [2022-12-05 22:41:32,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 1075 transitions, 34583 flow [2022-12-05 22:41:33,425 INFO L130 PetriNetUnfolder]: 813/2226 cut-off events. [2022-12-05 22:41:33,425 INFO L131 PetriNetUnfolder]: For 358283/358587 co-relation queries the response was YES. [2022-12-05 22:41:33,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36829 conditions, 2226 events. 813/2226 cut-off events. For 358283/358587 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 21260 event pairs, 4 based on Foata normal form. 18/2243 useless extension candidates. Maximal degree in co-relation 36667. Up to 1160 conditions per place. [2022-12-05 22:41:33,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 438 places, 1075 transitions, 34583 flow [2022-12-05 22:41:33,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 3346 [2022-12-05 22:41:33,475 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:41:33,477 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 650 [2022-12-05 22:41:33,478 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 1075 transitions, 34583 flow [2022-12-05 22:41:33,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:33,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:33,478 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:33,484 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:41:33,681 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:41:33,681 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:41:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1025318405, now seen corresponding path program 1 times [2022-12-05 22:41:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:33,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578151556] [2022-12-05 22:41:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:33,813 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:33,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578151556] [2022-12-05 22:41:33,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578151556] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577153414] [2022-12-05 22:41:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:33,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:33,815 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:41:33,815 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:41:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:33,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:41:33,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:33,986 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:33,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:34,234 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:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577153414] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:34,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:41:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157858386] [2022-12-05 22:41:34,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:34,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:41:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:41:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:41:34,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-05 22:41:34,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 1075 transitions, 34583 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:41:34,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:34,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-05 22:41:34,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:47,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:41:50,917 INFO L130 PetriNetUnfolder]: 4168/7280 cut-off events. [2022-12-05 22:41:50,917 INFO L131 PetriNetUnfolder]: For 1101355/1101355 co-relation queries the response was YES. [2022-12-05 22:41:50,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98159 conditions, 7280 events. 4168/7280 cut-off events. For 1101355/1101355 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 55301 event pairs, 732 based on Foata normal form. 54/7332 useless extension candidates. Maximal degree in co-relation 97994. Up to 5672 conditions per place. [2022-12-05 22:41:50,998 INFO L137 encePairwiseOnDemand]: 10/58 looper letters, 874 selfloop transitions, 398 changer transitions 21/1293 dead transitions. [2022-12-05 22:41:50,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 1293 transitions, 41410 flow [2022-12-05 22:41:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-05 22:41:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-05 22:41:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 200 transitions. [2022-12-05 22:41:50,999 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1044932079414838 [2022-12-05 22:41:50,999 INFO L175 Difference]: Start difference. First operand has 438 places, 1075 transitions, 34583 flow. Second operand 33 states and 200 transitions. [2022-12-05 22:41:50,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 1293 transitions, 41410 flow [2022-12-05 22:41:56,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 1293 transitions, 40485 flow, removed 441 selfloop flow, removed 2 redundant places. [2022-12-05 22:41:56,170 INFO L231 Difference]: Finished difference. Result has 474 places, 1124 transitions, 37137 flow [2022-12-05 22:41:56,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=33808, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=37137, PETRI_PLACES=474, PETRI_TRANSITIONS=1124} [2022-12-05 22:41:56,171 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 456 predicate places. [2022-12-05 22:41:56,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:56,171 INFO L89 Accepts]: Start accepts. Operand has 474 places, 1124 transitions, 37137 flow [2022-12-05 22:41:56,178 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:56,178 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:56,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 474 places, 1124 transitions, 37137 flow [2022-12-05 22:41:56,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 474 places, 1124 transitions, 37137 flow [2022-12-05 22:41:56,859 INFO L130 PetriNetUnfolder]: 848/2329 cut-off events. [2022-12-05 22:41:56,859 INFO L131 PetriNetUnfolder]: For 397913/398223 co-relation queries the response was YES. [2022-12-05 22:41:56,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39261 conditions, 2329 events. 848/2329 cut-off events. For 397913/398223 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 22360 event pairs, 4 based on Foata normal form. 17/2345 useless extension candidates. Maximal degree in co-relation 39093. Up to 1225 conditions per place. [2022-12-05 22:41:56,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 474 places, 1124 transitions, 37137 flow [2022-12-05 22:41:56,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 3472 [2022-12-05 22:41:57,105 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:41:57,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 935 [2022-12-05 22:41:57,106 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 1123 transitions, 37153 flow [2022-12-05 22:41:57,106 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:41:57,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:57,106 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:57,112 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:41:57,312 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:41:57,312 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:41:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1028846236, now seen corresponding path program 1 times [2022-12-05 22:41:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:57,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82946890] [2022-12-05 22:41:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:57,460 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:41:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82946890] [2022-12-05 22:41:57,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82946890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42197404] [2022-12-05 22:41:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:57,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:57,462 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:41:57,463 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:41:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:57,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:41:57,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:57,650 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:41:57,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:57,862 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:41:57,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42197404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:57,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:57,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:41:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787907176] [2022-12-05 22:41:57,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:57,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:41:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:41:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:41:57,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-05 22:41:57,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1123 transitions, 37153 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:41:57,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:57,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-05 22:41:57,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:23,703 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 77 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:42:27,900 INFO L130 PetriNetUnfolder]: 4376/7690 cut-off events. [2022-12-05 22:42:27,901 INFO L131 PetriNetUnfolder]: For 1337133/1337133 co-relation queries the response was YES. [2022-12-05 22:42:28,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105675 conditions, 7690 events. 4376/7690 cut-off events. For 1337133/1337133 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 59268 event pairs, 696 based on Foata normal form. 78/7766 useless extension candidates. Maximal degree in co-relation 105504. Up to 5493 conditions per place. [2022-12-05 22:42:28,058 INFO L137 encePairwiseOnDemand]: 10/63 looper letters, 854 selfloop transitions, 524 changer transitions 24/1402 dead transitions. [2022-12-05 22:42:28,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 1402 transitions, 45810 flow [2022-12-05 22:42:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-05 22:42:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-05 22:42:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 219 transitions. [2022-12-05 22:42:28,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09395109395109395 [2022-12-05 22:42:28,059 INFO L175 Difference]: Start difference. First operand has 473 places, 1123 transitions, 37153 flow. Second operand 37 states and 219 transitions. [2022-12-05 22:42:28,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 1402 transitions, 45810 flow [2022-12-05 22:42:34,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 1402 transitions, 45180 flow, removed 238 selfloop flow, removed 19 redundant places. [2022-12-05 22:42:34,317 INFO L231 Difference]: Finished difference. Result has 497 places, 1201 transitions, 41661 flow [2022-12-05 22:42:34,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=36545, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=456, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=41661, PETRI_PLACES=497, PETRI_TRANSITIONS=1201} [2022-12-05 22:42:34,318 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 479 predicate places. [2022-12-05 22:42:34,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:34,318 INFO L89 Accepts]: Start accepts. Operand has 497 places, 1201 transitions, 41661 flow [2022-12-05 22:42:34,325 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:34,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:34,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 497 places, 1201 transitions, 41661 flow [2022-12-05 22:42:34,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 497 places, 1201 transitions, 41661 flow [2022-12-05 22:42:35,037 INFO L130 PetriNetUnfolder]: 896/2495 cut-off events. [2022-12-05 22:42:35,038 INFO L131 PetriNetUnfolder]: For 449487/449819 co-relation queries the response was YES. [2022-12-05 22:42:35,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43441 conditions, 2495 events. 896/2495 cut-off events. For 449487/449819 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 24263 event pairs, 5 based on Foata normal form. 16/2510 useless extension candidates. Maximal degree in co-relation 43265. Up to 1311 conditions per place. [2022-12-05 22:42:35,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 497 places, 1201 transitions, 41661 flow [2022-12-05 22:42:35,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 3668 [2022-12-05 22:42:35,200 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:42:35,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 892 [2022-12-05 22:42:35,210 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 1201 transitions, 41704 flow [2022-12-05 22:42:35,211 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:42:35,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:35,211 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:35,217 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:42:35,411 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:42:35,411 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:42:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 869526835, now seen corresponding path program 2 times [2022-12-05 22:42:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843107093] [2022-12-05 22:42:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:35,537 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:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:35,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843107093] [2022-12-05 22:42:35,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843107093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:35,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914065608] [2022-12-05 22:42:35,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:42:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:35,539 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:42:35,541 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:42:35,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:42:35,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:42:35,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:42:35,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:35,733 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:35,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:36,095 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:36,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914065608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:36,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:36,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:42:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459467528] [2022-12-05 22:42:36,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:36,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:42:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:42:36,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:42:36,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-05 22:42:36,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1201 transitions, 41704 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:42:36,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:36,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-05 22:42:36,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:41,721 INFO L130 PetriNetUnfolder]: 5367/9328 cut-off events. [2022-12-05 22:42:41,722 INFO L131 PetriNetUnfolder]: For 2013071/2013071 co-relation queries the response was YES. [2022-12-05 22:42:41,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138192 conditions, 9328 events. 5367/9328 cut-off events. For 2013071/2013071 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 73024 event pairs, 305 based on Foata normal form. 64/9390 useless extension candidates. Maximal degree in co-relation 138013. Up to 3900 conditions per place. [2022-12-05 22:42:41,839 INFO L137 encePairwiseOnDemand]: 8/66 looper letters, 658 selfloop transitions, 944 changer transitions 9/1611 dead transitions. [2022-12-05 22:42:41,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1611 transitions, 54418 flow [2022-12-05 22:42:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:42:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:42:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 192 transitions. [2022-12-05 22:42:41,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13852813852813853 [2022-12-05 22:42:41,840 INFO L175 Difference]: Start difference. First operand has 497 places, 1201 transitions, 41704 flow. Second operand 21 states and 192 transitions. [2022-12-05 22:42:41,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 1611 transitions, 54418 flow [2022-12-05 22:42:50,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 1611 transitions, 53383 flow, removed 431 selfloop flow, removed 20 redundant places. [2022-12-05 22:42:50,966 INFO L231 Difference]: Finished difference. Result has 504 places, 1374 transitions, 50199 flow [2022-12-05 22:42:50,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=40739, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=796, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=50199, PETRI_PLACES=504, PETRI_TRANSITIONS=1374} [2022-12-05 22:42:50,967 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 486 predicate places. [2022-12-05 22:42:50,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:50,967 INFO L89 Accepts]: Start accepts. Operand has 504 places, 1374 transitions, 50199 flow [2022-12-05 22:42:50,975 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:50,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:50,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 504 places, 1374 transitions, 50199 flow [2022-12-05 22:42:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 504 places, 1374 transitions, 50199 flow [2022-12-05 22:42:52,017 INFO L130 PetriNetUnfolder]: 1100/2993 cut-off events. [2022-12-05 22:42:52,017 INFO L131 PetriNetUnfolder]: For 741838/742190 co-relation queries the response was YES. [2022-12-05 22:42:52,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57921 conditions, 2993 events. 1100/2993 cut-off events. For 741838/742190 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 29688 event pairs, 26 based on Foata normal form. 13/3005 useless extension candidates. Maximal degree in co-relation 57737. Up to 1627 conditions per place. [2022-12-05 22:42:52,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 504 places, 1374 transitions, 50199 flow [2022-12-05 22:42:52,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 4248 [2022-12-05 22:42:52,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 4)) 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 [401] L705-6-->L687-5: Formula: (and (= (+ (* 21 v_~cur~0_276) (* v_~prev~0_325 13) (* 3 v_~next~0_166)) (* 5 v_~prev~0_324)) (< v_~p~0_284 4) (< v_~x~0_309 1) (= (* 2 v_~next~0_166) (+ (* 3 v_~prev~0_324) (* 34 v_~cur~0_276) (* 21 v_~prev~0_325))) (= v_~next~0_166 v_~cur~0_275) (= v_~p~0_282 (+ v_~p~0_284 2)) (= (+ 12 v_~x~0_309) v_~x~0_308) (= (+ (* v_~j~0_375 2) v_~i~0_403) v_~i~0_401)) InVars {~j~0=v_~j~0_375, ~prev~0=v_~prev~0_325, ~i~0=v_~i~0_403, ~p~0=v_~p~0_284, ~cur~0=v_~cur~0_276, ~x~0=v_~x~0_309} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_191|, ~j~0=v_~j~0_375, ~next~0=v_~next~0_166, ~prev~0=v_~prev~0_324, ~i~0=v_~i~0_401, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_200|, ~p~0=v_~p~0_282, ~cur~0=v_~cur~0_275, ~x~0=v_~x~0_308} 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:42:52,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 4)) 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 [402] L705-6-->L687-5: Formula: (and (= v_~p~0_288 (+ v_~p~0_290 3)) (= (+ (* 21 v_~cur~0_280) (* 3 v_~next~0_168) (* v_~prev~0_329 13)) (* 5 v_~prev~0_328)) (< v_~p~0_290 3) (= (+ 12 v_~x~0_313) v_~x~0_312) (< v_~x~0_313 1) (= (+ (* v_~j~0_377 3) v_~i~0_409) v_~i~0_407) (= (* 2 v_~next~0_168) (+ (* 3 v_~prev~0_328) (* 34 v_~cur~0_280) (* 21 v_~prev~0_329))) (= v_~next~0_168 v_~cur~0_279)) InVars {~j~0=v_~j~0_377, ~prev~0=v_~prev~0_329, ~i~0=v_~i~0_409, ~p~0=v_~p~0_290, ~cur~0=v_~cur~0_280, ~x~0=v_~x~0_313} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_193|, ~j~0=v_~j~0_377, ~next~0=v_~next~0_168, ~prev~0=v_~prev~0_328, ~i~0=v_~i~0_407, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_204|, ~p~0=v_~p~0_288, ~cur~0=v_~cur~0_279, ~x~0=v_~x~0_312} 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:42:52,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (= v_~p~0_70 (+ v_~p~0_72 2)) (< v_~p~0_72 4)) 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 [400] L705-6-->L687-5: Formula: (and (= (+ (* v_~prev~0_321 13) (* 3 v_~next~0_164) (* 21 v_~cur~0_272)) (* 5 v_~prev~0_320)) (= v_~next~0_164 v_~cur~0_271) (= (+ v_~j~0_373 v_~i~0_398) v_~i~0_397) (= (+ v_~p~0_279 1) v_~p~0_278) (< v_~x~0_305 1) (= (* 2 v_~next~0_164) (+ (* 34 v_~cur~0_272) (* 3 v_~prev~0_320) (* 21 v_~prev~0_321))) (< v_~p~0_279 5) (= (+ 12 v_~x~0_305) v_~x~0_304)) InVars {~j~0=v_~j~0_373, ~prev~0=v_~prev~0_321, ~i~0=v_~i~0_398, ~p~0=v_~p~0_279, ~cur~0=v_~cur~0_272, ~x~0=v_~x~0_305} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_189|, ~j~0=v_~j~0_373, ~next~0=v_~next~0_164, ~prev~0=v_~prev~0_320, ~i~0=v_~i~0_397, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_198|, ~p~0=v_~p~0_278, ~cur~0=v_~cur~0_271, ~x~0=v_~x~0_304} 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:42:52,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:42:52,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1421 [2022-12-05 22:42:52,388 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 1374 transitions, 50216 flow [2022-12-05 22:42:52,388 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:42:52,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:52,388 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:52,394 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:42:52,594 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:42:52,595 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:42:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 821158124, now seen corresponding path program 1 times [2022-12-05 22:42:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:52,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715904218] [2022-12-05 22:42:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:52,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:42:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:52,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715904218] [2022-12-05 22:42:52,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715904218] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:52,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761735804] [2022-12-05 22:42:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:52,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:52,701 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:42:52,702 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:42:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:52,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:42:52,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:52,908 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:52,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:53,238 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:53,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761735804] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:53,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:53,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:42:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095402348] [2022-12-05 22:42:53,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:53,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:42:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:42:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:42:53,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-05 22:42:53,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 1374 transitions, 50216 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:42:53,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:53,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-05 22:42:53,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:03,372 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:10,385 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 70 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:43:18,922 INFO L130 PetriNetUnfolder]: 5518/9638 cut-off events. [2022-12-05 22:43:18,922 INFO L131 PetriNetUnfolder]: For 2299339/2299339 co-relation queries the response was YES. [2022-12-05 22:43:19,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147132 conditions, 9638 events. 5518/9638 cut-off events. For 2299339/2299339 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 76214 event pairs, 641 based on Foata normal form. 98/9734 useless extension candidates. Maximal degree in co-relation 146945. Up to 6647 conditions per place. [2022-12-05 22:43:19,088 INFO L137 encePairwiseOnDemand]: 8/67 looper letters, 966 selfloop transitions, 713 changer transitions 27/1706 dead transitions. [2022-12-05 22:43:19,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 1706 transitions, 59890 flow [2022-12-05 22:43:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-05 22:43:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-05 22:43:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 236 transitions. [2022-12-05 22:43:19,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10359964881474978 [2022-12-05 22:43:19,089 INFO L175 Difference]: Start difference. First operand has 504 places, 1374 transitions, 50216 flow. Second operand 34 states and 236 transitions. [2022-12-05 22:43:19,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 1706 transitions, 59890 flow [2022-12-05 22:43:29,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 1706 transitions, 58417 flow, removed 581 selfloop flow, removed 18 redundant places. [2022-12-05 22:43:29,300 INFO L231 Difference]: Finished difference. Result has 529 places, 1448 transitions, 54000 flow [2022-12-05 22:43:29,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=48817, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=652, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=54000, PETRI_PLACES=529, PETRI_TRANSITIONS=1448} [2022-12-05 22:43:29,301 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 511 predicate places. [2022-12-05 22:43:29,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:29,301 INFO L89 Accepts]: Start accepts. Operand has 529 places, 1448 transitions, 54000 flow [2022-12-05 22:43:29,311 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:29,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:29,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 529 places, 1448 transitions, 54000 flow [2022-12-05 22:43:29,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 529 places, 1448 transitions, 54000 flow [2022-12-05 22:43:30,473 INFO L130 PetriNetUnfolder]: 1127/3110 cut-off events. [2022-12-05 22:43:30,473 INFO L131 PetriNetUnfolder]: For 740788/741137 co-relation queries the response was YES. [2022-12-05 22:43:30,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59964 conditions, 3110 events. 1127/3110 cut-off events. For 740788/741137 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 31305 event pairs, 24 based on Foata normal form. 14/3122 useless extension candidates. Maximal degree in co-relation 59775. Up to 1697 conditions per place. [2022-12-05 22:43:30,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 529 places, 1448 transitions, 54000 flow [2022-12-05 22:43:30,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 4402 [2022-12-05 22:43:30,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L705-6-->L687-5: Formula: (and (= (+ 12 v_~x~0_257) v_~x~0_256) (= v_~p~0_174 (+ v_~p~0_176 2)) (= v_~next~0_140 v_~cur~0_227) (= (* 5 v_~prev~0_272) (+ (* 3 v_~next~0_140) (* 21 v_~cur~0_228) (* v_~prev~0_273 13))) (= (+ (* 21 v_~prev~0_273) (* 3 v_~prev~0_272) (* 34 v_~cur~0_228)) (* 2 v_~next~0_140)) (< v_~x~0_257 1) (= (+ (* v_~j~0_319 2) v_~i~0_293) v_~i~0_291) (< v_~p~0_174 6)) InVars {~j~0=v_~j~0_319, ~prev~0=v_~prev~0_273, ~i~0=v_~i~0_293, ~p~0=v_~p~0_176, ~cur~0=v_~cur~0_228, ~x~0=v_~x~0_257} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_161|, ~j~0=v_~j~0_319, ~next~0=v_~next~0_140, ~prev~0=v_~prev~0_272, ~i~0=v_~i~0_291, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_129|, ~p~0=v_~p~0_174, ~cur~0=v_~cur~0_227, ~x~0=v_~x~0_256} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:43:30,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:43:30,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1324 [2022-12-05 22:43:30,626 INFO L495 AbstractCegarLoop]: Abstraction has has 528 places, 1447 transitions, 53982 flow [2022-12-05 22:43:30,626 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:30,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:30,626 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:30,630 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:43:30,829 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:43:30,830 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:43:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1974201687, now seen corresponding path program 1 times [2022-12-05 22:43:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:30,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007226394] [2022-12-05 22:43:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:30,968 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:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:30,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007226394] [2022-12-05 22:43:30,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007226394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:30,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549756043] [2022-12-05 22:43:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:30,970 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:43:30,973 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:43:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:31,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:43:31,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:31,155 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:31,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:31,588 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:31,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549756043] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:31,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:31,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:43:31,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77455662] [2022-12-05 22:43:31,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:31,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:43:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:31,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:43:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:43:31,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-05 22:43:31,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 1447 transitions, 53982 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:31,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:31,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-05 22:43:31,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:40,943 INFO L130 PetriNetUnfolder]: 6567/11415 cut-off events. [2022-12-05 22:43:40,943 INFO L131 PetriNetUnfolder]: For 2821884/2821884 co-relation queries the response was YES. [2022-12-05 22:43:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181200 conditions, 11415 events. 6567/11415 cut-off events. For 2821884/2821884 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 91873 event pairs, 390 based on Foata normal form. 80/11493 useless extension candidates. Maximal degree in co-relation 181008. Up to 4414 conditions per place. [2022-12-05 22:43:41,181 INFO L137 encePairwiseOnDemand]: 8/67 looper letters, 621 selfloop transitions, 1293 changer transitions 10/1924 dead transitions. [2022-12-05 22:43:41,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 1924 transitions, 71201 flow [2022-12-05 22:43:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:43:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:43:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 208 transitions. [2022-12-05 22:43:41,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12417910447761193 [2022-12-05 22:43:41,182 INFO L175 Difference]: Start difference. First operand has 528 places, 1447 transitions, 53982 flow. Second operand 25 states and 208 transitions. [2022-12-05 22:43:41,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 1924 transitions, 71201 flow [2022-12-05 22:43:54,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 1924 transitions, 70181 flow, removed 411 selfloop flow, removed 12 redundant places. [2022-12-05 22:43:54,084 INFO L231 Difference]: Finished difference. Result has 548 places, 1691 transitions, 67566 flow [2022-12-05 22:43:54,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=53006, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1093, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=67566, PETRI_PLACES=548, PETRI_TRANSITIONS=1691} [2022-12-05 22:43:54,086 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 530 predicate places. [2022-12-05 22:43:54,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:54,086 INFO L89 Accepts]: Start accepts. Operand has 548 places, 1691 transitions, 67566 flow [2022-12-05 22:43:54,095 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:54,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:54,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 548 places, 1691 transitions, 67566 flow [2022-12-05 22:43:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 548 places, 1691 transitions, 67566 flow [2022-12-05 22:43:55,605 INFO L130 PetriNetUnfolder]: 1350/3661 cut-off events. [2022-12-05 22:43:55,605 INFO L131 PetriNetUnfolder]: For 1009817/1010252 co-relation queries the response was YES. [2022-12-05 22:43:55,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76330 conditions, 3661 events. 1350/3661 cut-off events. For 1009817/1010252 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 37626 event pairs, 36 based on Foata normal form. 20/3680 useless extension candidates. Maximal degree in co-relation 76134. Up to 2061 conditions per place. [2022-12-05 22:43:55,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 548 places, 1691 transitions, 67566 flow [2022-12-05 22:43:55,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 5112 [2022-12-05 22:43:55,810 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= 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 [379] L705-6-->L695-5: Formula: (and (= (* 2 v_~next~0_132) (+ (* 3 v_~prev~0_256) (* 21 v_~prev~0_257) (* 34 v_~cur~0_212))) (= v_~q~0_213 (+ 2 v_~q~0_215)) (< v_~x~0_241 1) (= (* 5 v_~prev~0_256) (+ (* v_~prev~0_257 13) (* 21 v_~cur~0_212) (* 3 v_~next~0_132))) (= (+ 12 v_~x~0_241) v_~x~0_240) (= v_~next~0_132 v_~cur~0_211) (< v_~q~0_215 4) (= v_~j~0_303 (+ v_~j~0_305 (* 2 v_~i~0_271)))) InVars {~j~0=v_~j~0_305, ~prev~0=v_~prev~0_257, ~i~0=v_~i~0_271, ~q~0=v_~q~0_215, ~cur~0=v_~cur~0_212, ~x~0=v_~x~0_241} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_153|, ~j~0=v_~j~0_303, ~next~0=v_~next~0_132, ~prev~0=v_~prev~0_256, ~i~0=v_~i~0_271, ~q~0=v_~q~0_213, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_150|, ~cur~0=v_~cur~0_211, ~x~0=v_~x~0_240} 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:43:55,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= 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 [377] L705-6-->L695-5: Formula: (and (= (+ (* 21 v_~prev~0_247) (* 3 v_~prev~0_246) (* 34 v_~cur~0_205)) (* 2 v_~next~0_127)) (< v_~q~0_198 5) (= (* 5 v_~prev~0_246) (+ (* v_~prev~0_247 13) (* 21 v_~cur~0_205) (* 3 v_~next~0_127))) (= v_~next~0_127 v_~cur~0_204) (= (+ 12 v_~x~0_231) v_~x~0_230) (= v_~j~0_289 (+ v_~j~0_290 v_~i~0_247)) (= (+ v_~q~0_198 1) v_~q~0_197) (< v_~x~0_231 1)) InVars {~j~0=v_~j~0_290, ~prev~0=v_~prev~0_247, ~i~0=v_~i~0_247, ~q~0=v_~q~0_198, ~cur~0=v_~cur~0_205, ~x~0=v_~x~0_231} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_145|, ~j~0=v_~j~0_289, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_246, ~i~0=v_~i~0_247, ~q~0=v_~q~0_197, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_141|, ~cur~0=v_~cur~0_204, ~x~0=v_~x~0_230} 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:43:55,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= 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 [425] L705-6-->L695-5: Formula: (and (= (+ 12 v_~x~0_347) v_~x~0_346) (< v_~p~0_380 6) (= v_~j~0_509 (+ v_~j~0_510 v_~i~0_519)) (= v_~p~0_380 (+ v_~p~0_381 2)) (= (+ (* v_~j~0_510 2) v_~i~0_520) v_~i~0_519) (= v_~next~0_185 v_~cur~0_306) (= (* 5 v_~prev~0_362) (+ (* 3 v_~next~0_185) (* 21 v_~cur~0_307) (* v_~prev~0_363 13))) (< v_~q~0_344 5) (= v_~q~0_343 (+ v_~q~0_344 1)) (= (+ (* 21 v_~prev~0_363) (* 34 v_~cur~0_307) (* 3 v_~prev~0_362)) (* 2 v_~next~0_185)) (< v_~x~0_347 1)) InVars {~j~0=v_~j~0_510, ~prev~0=v_~prev~0_363, ~i~0=v_~i~0_520, ~q~0=v_~q~0_344, ~p~0=v_~p~0_381, ~cur~0=v_~cur~0_307, ~x~0=v_~x~0_347} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_217|, ~j~0=v_~j~0_509, ~next~0=v_~next~0_185, ~prev~0=v_~prev~0_362, ~i~0=v_~i~0_519, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_266|, ~q~0=v_~q~0_343, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_248|, ~p~0=v_~p~0_380, ~cur~0=v_~cur~0_306, ~x~0=v_~x~0_346} 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] [2022-12-05 22:43:56,105 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:43:56,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2020 [2022-12-05 22:43:56,106 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 1691 transitions, 67599 flow [2022-12-05 22:43:56,106 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:56,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:56,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:56,117 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:43:56,316 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:43:56,317 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:43:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash -53985133, now seen corresponding path program 1 times [2022-12-05 22:43:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:56,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134504213] [2022-12-05 22:43:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:56,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:56,406 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:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134504213] [2022-12-05 22:43:56,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134504213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614362289] [2022-12-05 22:43:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:56,408 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:43:56,409 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:43:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:56,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:43:56,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:56,622 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:56,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:56,839 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:56,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614362289] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:56,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:56,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:43:56,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355338017] [2022-12-05 22:43:56,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:56,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:43:56,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:56,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:43:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:43:56,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:43:56,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1691 transitions, 67599 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:56,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:56,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:43:56,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:59,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:44:06,532 INFO L130 PetriNetUnfolder]: 6586/11552 cut-off events. [2022-12-05 22:44:06,533 INFO L131 PetriNetUnfolder]: For 3140048/3140048 co-relation queries the response was YES. [2022-12-05 22:44:06,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186641 conditions, 11552 events. 6586/11552 cut-off events. For 3140048/3140048 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 94434 event pairs, 1470 based on Foata normal form. 144/11694 useless extension candidates. Maximal degree in co-relation 186442. Up to 9522 conditions per place. [2022-12-05 22:44:06,698 INFO L137 encePairwiseOnDemand]: 17/69 looper letters, 1402 selfloop transitions, 461 changer transitions 40/1903 dead transitions. [2022-12-05 22:44:06,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 1903 transitions, 75765 flow [2022-12-05 22:44:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:44:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:44:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 173 transitions. [2022-12-05 22:44:06,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10446859903381643 [2022-12-05 22:44:06,701 INFO L175 Difference]: Start difference. First operand has 548 places, 1691 transitions, 67599 flow. Second operand 24 states and 173 transitions. [2022-12-05 22:44:06,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 1903 transitions, 75765 flow [2022-12-05 22:44:19,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1903 transitions, 74240 flow, removed 642 selfloop flow, removed 16 redundant places. [2022-12-05 22:44:19,202 INFO L231 Difference]: Finished difference. Result has 560 places, 1732 transitions, 69505 flow [2022-12-05 22:44:19,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=66104, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=421, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=69505, PETRI_PLACES=560, PETRI_TRANSITIONS=1732} [2022-12-05 22:44:19,203 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 542 predicate places. [2022-12-05 22:44:19,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:19,203 INFO L89 Accepts]: Start accepts. Operand has 560 places, 1732 transitions, 69505 flow [2022-12-05 22:44:19,215 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:19,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:19,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 560 places, 1732 transitions, 69505 flow [2022-12-05 22:44:19,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 560 places, 1732 transitions, 69505 flow [2022-12-05 22:44:20,746 INFO L130 PetriNetUnfolder]: 1328/3665 cut-off events. [2022-12-05 22:44:20,746 INFO L131 PetriNetUnfolder]: For 859874/860311 co-relation queries the response was YES. [2022-12-05 22:44:20,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74013 conditions, 3665 events. 1328/3665 cut-off events. For 859874/860311 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 37943 event pairs, 23 based on Foata normal form. 20/3684 useless extension candidates. Maximal degree in co-relation 73818. Up to 2036 conditions per place. [2022-12-05 22:44:20,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 560 places, 1732 transitions, 69505 flow [2022-12-05 22:44:20,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 5180 [2022-12-05 22:44:21,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L695-5-->L695-5: Formula: (and (< v_~q~0_380 6) (= (+ v_~q~0_382 3) v_~q~0_380) (= (+ (* 21 v_~prev~0_377) (* 3 v_~prev~0_376) (* 34 v_~cur~0_320)) (* 2 v_~next~0_192)) (= v_~next~0_192 v_~cur~0_319) (< v_~x~0_361 1) (= (+ (* 5 v_~i~0_544) (* v_~j~0_551 2)) v_~i~0_543) (= v_~x~0_360 (+ 12 v_~x~0_361)) (= v_~p~0_393 (+ v_~p~0_394 2)) (= (* 5 v_~prev~0_376) (+ (* v_~prev~0_377 13) (* 21 v_~cur~0_320) (* 3 v_~next~0_192))) (= v_~j~0_549 (+ v_~j~0_551 (* 2 v_~i~0_544) v_~i~0_543)) (< v_~p~0_393 6)) InVars {~j~0=v_~j~0_551, ~prev~0=v_~prev~0_377, ~i~0=v_~i~0_544, ~q~0=v_~q~0_382, ~p~0=v_~p~0_394, ~cur~0=v_~cur~0_320, ~x~0=v_~x~0_361} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_225|, ~j~0=v_~j~0_549, ~next~0=v_~next~0_192, ~prev~0=v_~prev~0_376, ~i~0=v_~i~0_543, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_275|, ~q~0=v_~q~0_380, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_273|, ~p~0=v_~p~0_393, ~cur~0=v_~cur~0_319, ~x~0=v_~x~0_360} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:44:21,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:44:21,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2000 [2022-12-05 22:44:21,203 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 1732 transitions, 69569 flow [2022-12-05 22:44:21,204 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:21,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:21,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:21,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-05 22:44:21,404 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:44:21,404 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:44:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash 552433473, now seen corresponding path program 1 times [2022-12-05 22:44:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:21,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083991885] [2022-12-05 22:44:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:21,493 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:44:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:21,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083991885] [2022-12-05 22:44:21,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083991885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:21,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878662612] [2022-12-05 22:44:21,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:21,495 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:44:21,498 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:44:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:21,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:44:21,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:21,668 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:44:21,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:21,824 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:44:21,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878662612] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:21,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:21,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:44:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251185986] [2022-12-05 22:44:21,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:21,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:44:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:21,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:44:21,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:44:21,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-05 22:44:21,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 1732 transitions, 69569 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:44:21,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:21,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-05 22:44:21,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:33,263 INFO L130 PetriNetUnfolder]: 6552/11531 cut-off events. [2022-12-05 22:44:33,263 INFO L131 PetriNetUnfolder]: For 2424348/2424348 co-relation queries the response was YES. [2022-12-05 22:44:33,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185145 conditions, 11531 events. 6552/11531 cut-off events. For 2424348/2424348 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 94630 event pairs, 1537 based on Foata normal form. 35/11564 useless extension candidates. Maximal degree in co-relation 184947. Up to 10012 conditions per place. [2022-12-05 22:44:33,419 INFO L137 encePairwiseOnDemand]: 17/71 looper letters, 1478 selfloop transitions, 372 changer transitions 23/1873 dead transitions. [2022-12-05 22:44:33,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 1873 transitions, 75699 flow [2022-12-05 22:44:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:44:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:44:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-12-05 22:44:33,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14626218851570963 [2022-12-05 22:44:33,420 INFO L175 Difference]: Start difference. First operand has 560 places, 1732 transitions, 69569 flow. Second operand 13 states and 135 transitions. [2022-12-05 22:44:33,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 1873 transitions, 75699 flow [2022-12-05 22:44:48,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 1873 transitions, 74974 flow, removed 283 selfloop flow, removed 13 redundant places. [2022-12-05 22:44:48,940 INFO L231 Difference]: Finished difference. Result has 563 places, 1745 transitions, 70744 flow [2022-12-05 22:44:48,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=68876, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=70744, PETRI_PLACES=563, PETRI_TRANSITIONS=1745} [2022-12-05 22:44:48,944 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 545 predicate places. [2022-12-05 22:44:48,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:48,944 INFO L89 Accepts]: Start accepts. Operand has 563 places, 1745 transitions, 70744 flow [2022-12-05 22:44:48,957 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:48,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:48,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 563 places, 1745 transitions, 70744 flow [2022-12-05 22:44:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 562 places, 1745 transitions, 70744 flow [2022-12-05 22:44:51,141 INFO L130 PetriNetUnfolder]: 1319/3671 cut-off events. [2022-12-05 22:44:51,142 INFO L131 PetriNetUnfolder]: For 891471/891932 co-relation queries the response was YES. [2022-12-05 22:44:51,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74571 conditions, 3671 events. 1319/3671 cut-off events. For 891471/891932 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 38220 event pairs, 19 based on Foata normal form. 20/3690 useless extension candidates. Maximal degree in co-relation 74373. Up to 2042 conditions per place. [2022-12-05 22:44:51,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 562 places, 1745 transitions, 70744 flow [2022-12-05 22:44:51,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 5198 [2022-12-05 22:44:51,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] L695-5-->L687-5: Formula: (and (= (+ v_~q~0_396 3) v_~q~0_395) (= (* 2 v_~next~0_197) (+ (* 34 v_~cur~0_329) (* 3 v_~prev~0_386) (* 21 v_~prev~0_387))) (< v_~p~0_404 6) (= (* v_~j~0_565 2) (+ v_~j~0_566 (* 2 v_~i~0_557) v_~i~0_555)) (= (* 5 v_~prev~0_386) (+ (* 3 v_~next~0_197) (* v_~prev~0_387 13) (* 21 v_~cur~0_329))) (= v_~p~0_404 (+ v_~p~0_406 3)) (= v_~next~0_197 v_~cur~0_328) (< v_~q~0_395 6) (< v_~x~0_371 1) (= v_~i~0_555 (+ (* 5 v_~i~0_557) v_~j~0_565 (* v_~j~0_566 2))) (= (+ 12 v_~x~0_371) v_~x~0_370)) InVars {~j~0=v_~j~0_566, ~prev~0=v_~prev~0_387, ~i~0=v_~i~0_557, ~q~0=v_~q~0_396, ~p~0=v_~p~0_406, ~cur~0=v_~cur~0_329, ~x~0=v_~x~0_371} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_231|, ~j~0=v_~j~0_565, ~next~0=v_~next~0_197, ~prev~0=v_~prev~0_386, ~i~0=v_~i~0_555, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_282|, ~q~0=v_~q~0_395, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_284|, ~p~0=v_~p~0_404, ~cur~0=v_~cur~0_328, ~x~0=v_~x~0_370} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:44:51,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L695-5-->L687-5: Formula: (and (= (+ 12 v_~x~0_381) v_~x~0_380) (= v_~p~0_425 (+ v_~p~0_427 4)) (= (* 5 v_~prev~0_396) (+ (* 3 v_~next~0_202) (* 21 v_~cur~0_338) (* v_~prev~0_397 13))) (= v_~next~0_202 v_~cur~0_337) (= (+ v_~q~0_407 3) v_~q~0_406) (< v_~q~0_406 6) (= (+ (* v_~j~0_580 2) (* v_~j~0_579 2) (* 5 v_~i~0_579)) v_~i~0_577) (= (* 2 v_~next~0_202) (+ (* 3 v_~prev~0_396) (* 21 v_~prev~0_397) (* 34 v_~cur~0_338))) (< v_~p~0_427 2) (= v_~j~0_579 (+ (* v_~j~0_580 3) (* 7 v_~i~0_579))) (< v_~x~0_381 1)) InVars {~j~0=v_~j~0_580, ~prev~0=v_~prev~0_397, ~i~0=v_~i~0_579, ~q~0=v_~q~0_407, ~p~0=v_~p~0_427, ~cur~0=v_~cur~0_338, ~x~0=v_~x~0_381} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_237|, ~j~0=v_~j~0_579, ~next~0=v_~next~0_202, ~prev~0=v_~prev~0_396, ~i~0=v_~i~0_577, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_297|, ~q~0=v_~q~0_406, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_291|, ~p~0=v_~p~0_425, ~cur~0=v_~cur~0_337, ~x~0=v_~x~0_380} 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_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:44:51,788 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:44:51,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2844 [2022-12-05 22:44:51,788 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 1744 transitions, 70824 flow [2022-12-05 22:44:51,788 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:44:51,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:51,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:51,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-05 22:44:51,993 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:44:51,993 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:44:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 552599168, now seen corresponding path program 1 times [2022-12-05 22:44:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:51,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134189368] [2022-12-05 22:44:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:52,083 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:44:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:52,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134189368] [2022-12-05 22:44:52,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134189368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:52,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430110917] [2022-12-05 22:44:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:52,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:52,085 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:44:52,087 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:44:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:52,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:44:52,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:52,312 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:44:52,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:52,510 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:44:52,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430110917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:52,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:52,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:44:52,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303892080] [2022-12-05 22:44:52,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:52,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:44:52,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:44:52,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:44:52,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-05 22:44:52,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1744 transitions, 70824 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:44:52,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:52,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-05 22:44:52,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:55,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 22:45:07,402 INFO L130 PetriNetUnfolder]: 6542/11528 cut-off events. [2022-12-05 22:45:07,403 INFO L131 PetriNetUnfolder]: For 2434085/2434085 co-relation queries the response was YES. [2022-12-05 22:45:07,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187001 conditions, 11528 events. 6542/11528 cut-off events. For 2434085/2434085 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 94787 event pairs, 1834 based on Foata normal form. 12/11538 useless extension candidates. Maximal degree in co-relation 186800. Up to 10572 conditions per place. [2022-12-05 22:45:07,593 INFO L137 encePairwiseOnDemand]: 19/73 looper letters, 1590 selfloop transitions, 233 changer transitions 59/1882 dead transitions. [2022-12-05 22:45:07,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1882 transitions, 76485 flow [2022-12-05 22:45:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:45:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:45:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 152 transitions. [2022-12-05 22:45:07,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12248186946011282 [2022-12-05 22:45:07,595 INFO L175 Difference]: Start difference. First operand has 561 places, 1744 transitions, 70824 flow. Second operand 17 states and 152 transitions. [2022-12-05 22:45:07,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 1882 transitions, 76485 flow [2022-12-05 22:45:23,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 1882 transitions, 76311 flow, removed 50 selfloop flow, removed 4 redundant places. [2022-12-05 22:45:23,546 INFO L231 Difference]: Finished difference. Result has 577 places, 1731 transitions, 70629 flow [2022-12-05 22:45:23,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=70650, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=70629, PETRI_PLACES=577, PETRI_TRANSITIONS=1731} [2022-12-05 22:45:23,548 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 559 predicate places. [2022-12-05 22:45:23,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:23,548 INFO L89 Accepts]: Start accepts. Operand has 577 places, 1731 transitions, 70629 flow [2022-12-05 22:45:23,559 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:23,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:23,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 577 places, 1731 transitions, 70629 flow [2022-12-05 22:45:23,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 575 places, 1731 transitions, 70629 flow [2022-12-05 22:45:25,096 INFO L130 PetriNetUnfolder]: 1311/3641 cut-off events. [2022-12-05 22:45:25,096 INFO L131 PetriNetUnfolder]: For 919421/919841 co-relation queries the response was YES. [2022-12-05 22:45:25,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74619 conditions, 3641 events. 1311/3641 cut-off events. For 919421/919841 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 37766 event pairs, 21 based on Foata normal form. 20/3660 useless extension candidates. Maximal degree in co-relation 74416. Up to 2025 conditions per place. [2022-12-05 22:45:25,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 575 places, 1731 transitions, 70629 flow [2022-12-05 22:45:25,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 5166 [2022-12-05 22:45:25,199 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:45:25,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1652 [2022-12-05 22:45:25,200 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 1731 transitions, 70629 flow [2022-12-05 22:45:25,200 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:45:25,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:25,200 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:25,204 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:45:25,404 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:45:25,404 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:45:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 883748457, now seen corresponding path program 1 times [2022-12-05 22:45:25,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:25,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796501185] [2022-12-05 22:45:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:25,500 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:45:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796501185] [2022-12-05 22:45:25,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796501185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015554093] [2022-12-05 22:45:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:25,502 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:45:25,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-05 22:45:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:25,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:45:25,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:25,718 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:45:25,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:45:26,047 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:45:26,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015554093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:45:26,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:45:26,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:45:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125835931] [2022-12-05 22:45:26,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:45:26,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:45:26,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:26,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:45:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:45:26,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:45:26,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 1731 transitions, 70629 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:26,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:26,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:45:26,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:31,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-05 22:45:39,974 INFO L130 PetriNetUnfolder]: 6576/11622 cut-off events. [2022-12-05 22:45:39,974 INFO L131 PetriNetUnfolder]: For 2872132/2872132 co-relation queries the response was YES. [2022-12-05 22:45:40,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188664 conditions, 11622 events. 6576/11622 cut-off events. For 2872132/2872132 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 95988 event pairs, 1273 based on Foata normal form. 79/11699 useless extension candidates. Maximal degree in co-relation 188458. Up to 9025 conditions per place. [2022-12-05 22:45:40,138 INFO L137 encePairwiseOnDemand]: 9/69 looper letters, 1307 selfloop transitions, 630 changer transitions 61/1998 dead transitions. [2022-12-05 22:45:40,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 1998 transitions, 79808 flow [2022-12-05 22:45:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-05 22:45:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-05 22:45:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 228 transitions. [2022-12-05 22:45:40,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08930669800235018 [2022-12-05 22:45:40,140 INFO L175 Difference]: Start difference. First operand has 575 places, 1731 transitions, 70629 flow. Second operand 37 states and 228 transitions. [2022-12-05 22:45:40,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 1998 transitions, 79808 flow [2022-12-05 22:45:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 1998 transitions, 79561 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-05 22:45:54,239 INFO L231 Difference]: Finished difference. Result has 608 places, 1765 transitions, 74422 flow [2022-12-05 22:45:54,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=70382, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=589, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=74422, PETRI_PLACES=608, PETRI_TRANSITIONS=1765} [2022-12-05 22:45:54,240 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 590 predicate places. [2022-12-05 22:45:54,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:54,241 INFO L89 Accepts]: Start accepts. Operand has 608 places, 1765 transitions, 74422 flow [2022-12-05 22:45:54,252 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:54,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:54,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 608 places, 1765 transitions, 74422 flow [2022-12-05 22:45:54,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 606 places, 1765 transitions, 74422 flow [2022-12-05 22:45:56,074 INFO L130 PetriNetUnfolder]: 1322/3686 cut-off events. [2022-12-05 22:45:56,074 INFO L131 PetriNetUnfolder]: For 953604/954057 co-relation queries the response was YES. [2022-12-05 22:45:56,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76847 conditions, 3686 events. 1322/3686 cut-off events. For 953604/954057 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 38411 event pairs, 18 based on Foata normal form. 18/3703 useless extension candidates. Maximal degree in co-relation 76641. Up to 2064 conditions per place. [2022-12-05 22:45:56,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 606 places, 1765 transitions, 74422 flow [2022-12-05 22:45:56,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 5206 [2022-12-05 22:45:56,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L705-6-->L687-5: Formula: (and (= (* 5 v_~prev~0_284) (+ (* 21 v_~cur~0_238) (* 3 v_~next~0_146) (* v_~prev~0_285 13))) (= v_~next~0_146 v_~cur~0_237) (= (* 2 v_~next~0_146) (+ (* 21 v_~prev~0_285) (* 3 v_~prev~0_284) (* 34 v_~cur~0_238))) (= (+ 12 v_~x~0_269) v_~x~0_268) (< v_~p~0_215 3) (= (+ (* v_~j~0_337 3) v_~i~0_331) v_~i~0_329) (= v_~p~0_213 (+ v_~p~0_215 3)) (< v_~x~0_269 1)) InVars {~j~0=v_~j~0_337, ~prev~0=v_~prev~0_285, ~i~0=v_~i~0_331, ~p~0=v_~p~0_215, ~cur~0=v_~cur~0_238, ~x~0=v_~x~0_269} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_169|, ~j~0=v_~j~0_337, ~next~0=v_~next~0_146, ~prev~0=v_~prev~0_284, ~i~0=v_~i~0_329, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_155|, ~p~0=v_~p~0_213, ~cur~0=v_~cur~0_237, ~x~0=v_~x~0_268} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:45:56,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L695-5-->L695-5: Formula: (and (< v_~q~0_156 4) (= v_~q~0_154 (+ 2 v_~q~0_156)) (= 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 [442] L705-6-->L695-5: Formula: (and (= v_~q~0_442 (+ v_~q~0_443 1)) (= v_~j~0_619 (+ v_~j~0_620 v_~i~0_601)) (< v_~q~0_443 5) (< v_~p~0_445 3) (= (+ 12 v_~x~0_397) v_~x~0_396) (= v_~next~0_210 v_~cur~0_351) (= v_~p~0_444 (+ v_~p~0_445 3)) (= v_~i~0_601 (+ (* v_~j~0_620 3) v_~i~0_602)) (= (* 5 v_~prev~0_412) (+ (* 3 v_~next~0_210) (* v_~prev~0_413 13) (* 21 v_~cur~0_352))) (< v_~x~0_397 1) (= (+ (* 21 v_~prev~0_413) (* 3 v_~prev~0_412) (* 34 v_~cur~0_352)) (* 2 v_~next~0_210))) InVars {~j~0=v_~j~0_620, ~prev~0=v_~prev~0_413, ~i~0=v_~i~0_602, ~q~0=v_~q~0_443, ~p~0=v_~p~0_445, ~cur~0=v_~cur~0_352, ~x~0=v_~x~0_397} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_247|, ~j~0=v_~j~0_619, ~next~0=v_~next~0_210, ~prev~0=v_~prev~0_412, ~i~0=v_~i~0_601, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_310|, ~q~0=v_~q~0_442, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_317|, ~p~0=v_~p~0_444, ~cur~0=v_~cur~0_351, ~x~0=v_~x~0_396} 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] [2022-12-05 22:45:56,437 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:45:56,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2196 [2022-12-05 22:45:56,437 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 1763 transitions, 74398 flow [2022-12-05 22:45:56,437 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:56,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:56,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:56,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-05 22:45:56,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:56,638 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:45:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:56,638 INFO L85 PathProgramCache]: Analyzing trace with hash 552841340, now seen corresponding path program 1 times [2022-12-05 22:45:56,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:56,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353460473] [2022-12-05 22:45:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:56,711 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:45:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353460473] [2022-12-05 22:45:56,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353460473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:56,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343811107] [2022-12-05 22:45:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:56,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:56,713 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:45:56,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-05 22:45:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:56,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:45:56,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:56,872 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:45:56,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:45:57,032 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:45:57,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343811107] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:45:57,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:45:57,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:45:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538012779] [2022-12-05 22:45:57,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:45:57,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:45:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:57,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:45:57,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:45:57,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:45:57,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 1763 transitions, 74398 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:45:57,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:57,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:45:57,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:06,958 INFO L130 PetriNetUnfolder]: 6538/11553 cut-off events. [2022-12-05 22:46:06,958 INFO L131 PetriNetUnfolder]: For 2686485/2686485 co-relation queries the response was YES. [2022-12-05 22:46:07,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191221 conditions, 11553 events. 6538/11553 cut-off events. For 2686485/2686485 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 95318 event pairs, 1651 based on Foata normal form. 25/11576 useless extension candidates. Maximal degree in co-relation 191012. Up to 10166 conditions per place. [2022-12-05 22:46:07,131 INFO L137 encePairwiseOnDemand]: 17/69 looper letters, 1531 selfloop transitions, 345 changer transitions 31/1907 dead transitions. [2022-12-05 22:46:07,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 1907 transitions, 80293 flow [2022-12-05 22:46:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:46:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:46:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-12-05 22:46:07,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12446717817561807 [2022-12-05 22:46:07,133 INFO L175 Difference]: Start difference. First operand has 604 places, 1763 transitions, 74398 flow. Second operand 17 states and 146 transitions. [2022-12-05 22:46:07,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 1907 transitions, 80293 flow [2022-12-05 22:46:23,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 1907 transitions, 79657 flow, removed 183 selfloop flow, removed 24 redundant places. [2022-12-05 22:46:23,362 INFO L231 Difference]: Finished difference. Result has 599 places, 1764 transitions, 74978 flow [2022-12-05 22:46:23,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=73770, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=74978, PETRI_PLACES=599, PETRI_TRANSITIONS=1764} [2022-12-05 22:46:23,363 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 581 predicate places. [2022-12-05 22:46:23,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:46:23,363 INFO L89 Accepts]: Start accepts. Operand has 599 places, 1764 transitions, 74978 flow [2022-12-05 22:46:23,379 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:46:23,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:46:23,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 599 places, 1764 transitions, 74978 flow [2022-12-05 22:46:23,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 598 places, 1764 transitions, 74978 flow [2022-12-05 22:46:25,036 INFO L130 PetriNetUnfolder]: 1311/3671 cut-off events. [2022-12-05 22:46:25,036 INFO L131 PetriNetUnfolder]: For 965273/965717 co-relation queries the response was YES. [2022-12-05 22:46:25,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76990 conditions, 3671 events. 1311/3671 cut-off events. For 965273/965717 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 38297 event pairs, 17 based on Foata normal form. 18/3688 useless extension candidates. Maximal degree in co-relation 76781. Up to 2056 conditions per place. [2022-12-05 22:46:25,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 598 places, 1764 transitions, 74978 flow [2022-12-05 22:46:25,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 5192 [2022-12-05 22:46:25,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L695-5-->L695-5: Formula: (and (= v_~x~0_366 (+ 12 v_~x~0_367)) (= v_~j~0_559 (+ v_~j~0_561 (* 2 v_~i~0_551) (* 2 v_~i~0_552))) (< v_~p~0_400 6) (= (+ (* 3 v_~next~0_195) (* v_~prev~0_383 13) (* 21 v_~cur~0_325)) (* 5 v_~prev~0_382)) (< v_~q~0_389 6) (< v_~x~0_367 1) (= v_~next~0_195 v_~cur~0_324) (= v_~q~0_389 (+ v_~q~0_391 4)) (= v_~p~0_400 (+ v_~p~0_401 2)) (= (+ (* v_~j~0_561 2) (* 5 v_~i~0_552)) v_~i~0_551) (= (* 2 v_~next~0_195) (+ (* 34 v_~cur~0_325) (* 3 v_~prev~0_382) (* 21 v_~prev~0_383)))) InVars {~j~0=v_~j~0_561, ~prev~0=v_~prev~0_383, ~i~0=v_~i~0_552, ~q~0=v_~q~0_391, ~p~0=v_~p~0_401, ~cur~0=v_~cur~0_325, ~x~0=v_~x~0_367} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_229|, ~j~0=v_~j~0_559, ~next~0=v_~next~0_195, ~prev~0=v_~prev~0_382, ~i~0=v_~i~0_551, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_280|, ~q~0=v_~q~0_389, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_280|, ~p~0=v_~p~0_400, ~cur~0=v_~cur~0_324, ~x~0=v_~x~0_366} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:46:25,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:46:25,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1885 [2022-12-05 22:46:25,248 INFO L495 AbstractCegarLoop]: Abstraction has has 597 places, 1763 transitions, 74952 flow [2022-12-05 22:46:25,248 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:46:25,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:46:25,248 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:46:25,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-05 22:46:25,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:25,452 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:46:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:46:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1824591905, now seen corresponding path program 1 times [2022-12-05 22:46:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:46:25,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102694491] [2022-12-05 22:46:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:25,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:46:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:25,567 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:46:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:46:25,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102694491] [2022-12-05 22:46:25,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102694491] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:46:25,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721521590] [2022-12-05 22:46:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:25,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:25,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:46:25,569 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:46:25,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-05 22:46:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:25,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:46:25,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:46:25,752 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:46:25,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:46:25,990 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:46:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721521590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:46:25,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:46:25,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:46:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147597109] [2022-12-05 22:46:25,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:46:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:46:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:46:25,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:46:25,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:46:25,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-05 22:46:25,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 1763 transitions, 74952 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:46:25,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:46:25,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-05 22:46:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:41,997 INFO L130 PetriNetUnfolder]: 6617/11740 cut-off events. [2022-12-05 22:46:41,998 INFO L131 PetriNetUnfolder]: For 3158756/3158756 co-relation queries the response was YES. [2022-12-05 22:46:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194065 conditions, 11740 events. 6617/11740 cut-off events. For 3158756/3158756 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 97409 event pairs, 1055 based on Foata normal form. 92/11830 useless extension candidates. Maximal degree in co-relation 193853. Up to 8616 conditions per place. [2022-12-05 22:46:42,168 INFO L137 encePairwiseOnDemand]: 9/68 looper letters, 1294 selfloop transitions, 727 changer transitions 34/2055 dead transitions. [2022-12-05 22:46:42,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 2055 transitions, 85035 flow [2022-12-05 22:46:42,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:46:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:46:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 214 transitions. [2022-12-05 22:46:42,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09834558823529412 [2022-12-05 22:46:42,169 INFO L175 Difference]: Start difference. First operand has 597 places, 1763 transitions, 74952 flow. Second operand 32 states and 214 transitions. [2022-12-05 22:46:42,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 2055 transitions, 85035 flow [2022-12-05 22:46:57,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 2055 transitions, 84753 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-12-05 22:46:57,599 INFO L231 Difference]: Finished difference. Result has 628 places, 1813 transitions, 79727 flow [2022-12-05 22:46:57,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=74670, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=681, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=79727, PETRI_PLACES=628, PETRI_TRANSITIONS=1813} [2022-12-05 22:46:57,600 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 610 predicate places. [2022-12-05 22:46:57,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:46:57,600 INFO L89 Accepts]: Start accepts. Operand has 628 places, 1813 transitions, 79727 flow [2022-12-05 22:46:57,623 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:46:57,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:46:57,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 628 places, 1813 transitions, 79727 flow [2022-12-05 22:46:57,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 628 places, 1813 transitions, 79727 flow [2022-12-05 22:46:59,519 INFO L130 PetriNetUnfolder]: 1326/3763 cut-off events. [2022-12-05 22:46:59,519 INFO L131 PetriNetUnfolder]: For 1007369/1007820 co-relation queries the response was YES. [2022-12-05 22:46:59,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80044 conditions, 3763 events. 1326/3763 cut-off events. For 1007369/1007820 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 39618 event pairs, 16 based on Foata normal form. 18/3780 useless extension candidates. Maximal degree in co-relation 79827. Up to 2112 conditions per place. [2022-12-05 22:46:59,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 628 places, 1813 transitions, 79727 flow [2022-12-05 22:46:59,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 5310 [2022-12-05 22:46:59,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (not (< v_~x~0_35 12)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:46:59,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (not (< v_~x~0_35 12)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 5) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) 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:46:59,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L705-6-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod |v_ULTIMATE.start_main_~assert_cond~0#1_64| 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (<= 0 (+ |v_ULTIMATE.start_main_~correct~0#1_66| 2147483648)) (= |v_ULTIMATE.start_main_~assert_cond~0#1_64| (ite (= (ite (and (< v_~i~0_97 |v_ULTIMATE.start_main_~correct~0#1_66|) (< v_~j~0_111 |v_ULTIMATE.start_main_~correct~0#1_66|)) 1 0) 0) 0 1)) (<= |v_ULTIMATE.start_main_~correct~0#1_66| 2147483647) (= |v_ULTIMATE.start_fib_#res#1_40| |v_ULTIMATE.start_main_~correct~0#1_66|) (= |v_ULTIMATE.start_fib_#res#1_40| v_~prev~0_61) (not (< v_~x~0_35 12)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|)) InVars {~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ~i~0=v_~i~0_97, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ret8#1=|v_ULTIMATE.start_main_#t~ret8#1_82|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~j~0=v_~j~0_111, ~prev~0=v_~prev~0_61, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~i~0=v_~i~0_97, ULTIMATE.start_fib_#res#1=|v_ULTIMATE.start_fib_#res#1_40|, ULTIMATE.start_main_~correct~0#1=|v_ULTIMATE.start_main_~correct~0#1_66|, ~x~0=v_~x~0_35, ULTIMATE.start_main_~assert_cond~0#1=|v_ULTIMATE.start_main_~assert_cond~0#1_64|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_fib_#res#1, ULTIMATE.start_main_~correct~0#1, ULTIMATE.start_main_~assert_cond~0#1] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:46:59,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:46:59,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2262 [2022-12-05 22:46:59,862 INFO L495 AbstractCegarLoop]: Abstraction has has 628 places, 1813 transitions, 80438 flow [2022-12-05 22:46:59,862 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:59,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:46:59,862 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:46:59,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-05 22:47:00,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:00,063 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:47:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:47:00,063 INFO L85 PathProgramCache]: Analyzing trace with hash -43737029, now seen corresponding path program 1 times [2022-12-05 22:47:00,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:47:00,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060241858] [2022-12-05 22:47:00,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:00,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:47:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:00,144 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:00,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:47:00,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060241858] [2022-12-05 22:47:00,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060241858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:47:00,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538466243] [2022-12-05 22:47:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:00,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:00,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:47:00,146 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:47:00,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-05 22:47:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:00,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:47:00,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:47:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:00,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:47:00,643 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:00,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538466243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:47:00,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:47:00,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:47:00,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628879182] [2022-12-05 22:47:00,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:47:00,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:47:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:47:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:47:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:47:00,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-05 22:47:00,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 1813 transitions, 80438 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:00,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:47:00,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-05 22:47:00,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:47:10,582 INFO L130 PetriNetUnfolder]: 6621/11757 cut-off events. [2022-12-05 22:47:10,582 INFO L131 PetriNetUnfolder]: For 2784096/2784096 co-relation queries the response was YES. [2022-12-05 22:47:10,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199149 conditions, 11757 events. 6621/11757 cut-off events. For 2784096/2784096 co-relation queries the response was YES. Maximal size of possible extension queue 1244. Compared 97952 event pairs, 1837 based on Foata normal form. 4/11759 useless extension candidates. Maximal degree in co-relation 198929. Up to 10632 conditions per place. [2022-12-05 22:47:10,767 INFO L137 encePairwiseOnDemand]: 21/71 looper letters, 1637 selfloop transitions, 290 changer transitions 32/1959 dead transitions. [2022-12-05 22:47:10,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 1959 transitions, 86264 flow [2022-12-05 22:47:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-05 22:47:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-05 22:47:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 157 transitions. [2022-12-05 22:47:10,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11056338028169015 [2022-12-05 22:47:10,768 INFO L175 Difference]: Start difference. First operand has 628 places, 1813 transitions, 80438 flow. Second operand 20 states and 157 transitions. [2022-12-05 22:47:10,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 1959 transitions, 86264 flow [2022-12-05 22:47:30,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 1959 transitions, 84241 flow, removed 937 selfloop flow, removed 10 redundant places. [2022-12-05 22:47:30,677 INFO L231 Difference]: Finished difference. Result has 640 places, 1813 transitions, 79236 flow [2022-12-05 22:47:30,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=78421, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=79236, PETRI_PLACES=640, PETRI_TRANSITIONS=1813} [2022-12-05 22:47:30,678 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 622 predicate places. [2022-12-05 22:47:30,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:47:30,678 INFO L89 Accepts]: Start accepts. Operand has 640 places, 1813 transitions, 79236 flow [2022-12-05 22:47:30,690 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:47:30,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:47:30,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 640 places, 1813 transitions, 79236 flow [2022-12-05 22:47:30,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 639 places, 1813 transitions, 79236 flow [2022-12-05 22:47:32,439 INFO L130 PetriNetUnfolder]: 1326/3761 cut-off events. [2022-12-05 22:47:32,439 INFO L131 PetriNetUnfolder]: For 1009919/1010369 co-relation queries the response was YES. [2022-12-05 22:47:32,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79789 conditions, 3761 events. 1326/3761 cut-off events. For 1009919/1010369 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 39630 event pairs, 15 based on Foata normal form. 18/3778 useless extension candidates. Maximal degree in co-relation 79569. Up to 2108 conditions per place. [2022-12-05 22:47:32,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 639 places, 1813 transitions, 79236 flow [2022-12-05 22:47:32,712 INFO L188 LiptonReduction]: Number of co-enabled transitions 5314 [2022-12-05 22:47:32,716 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:47:32,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2039 [2022-12-05 22:47:32,717 INFO L495 AbstractCegarLoop]: Abstraction has has 639 places, 1813 transitions, 79236 flow [2022-12-05 22:47:32,717 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:32,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:47:32,717 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:47:32,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-05 22:47:32,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-05 22:47:32,919 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:47:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:47:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1756060670, now seen corresponding path program 1 times [2022-12-05 22:47:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:47:32,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659417254] [2022-12-05 22:47:32,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:47:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:33,021 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:47:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:47:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659417254] [2022-12-05 22:47:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659417254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:47:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319021497] [2022-12-05 22:47:33,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:47:33,023 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:47:33,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-05 22:47:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:33,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:47:33,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:47:33,227 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:47:33,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:47:33,476 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:47:33,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319021497] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:47:33,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:47:33,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:47:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309528704] [2022-12-05 22:47:33,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:47:33,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:47:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:47:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:47:33,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:47:33,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-05 22:47:33,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 1813 transitions, 79236 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:47:33,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:47:33,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-05 22:47:33,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:47:48,744 INFO L130 PetriNetUnfolder]: 6755/12048 cut-off events. [2022-12-05 22:47:48,744 INFO L131 PetriNetUnfolder]: For 3323263/3323263 co-relation queries the response was YES. [2022-12-05 22:47:48,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202020 conditions, 12048 events. 6755/12048 cut-off events. For 3323263/3323263 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 101162 event pairs, 788 based on Foata normal form. 92/12138 useless extension candidates. Maximal degree in co-relation 201797. Up to 8139 conditions per place. [2022-12-05 22:47:48,921 INFO L137 encePairwiseOnDemand]: 8/70 looper letters, 1212 selfloop transitions, 918 changer transitions 25/2155 dead transitions. [2022-12-05 22:47:48,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 2155 transitions, 90769 flow [2022-12-05 22:47:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-05 22:47:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-05 22:47:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 248 transitions. [2022-12-05 22:47:48,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09575289575289575 [2022-12-05 22:47:48,923 INFO L175 Difference]: Start difference. First operand has 639 places, 1813 transitions, 79236 flow. Second operand 37 states and 248 transitions. [2022-12-05 22:47:48,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 2155 transitions, 90769 flow [2022-12-05 22:48:06,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 2155 transitions, 90429 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-12-05 22:48:06,067 INFO L231 Difference]: Finished difference. Result has 673 places, 1888 transitions, 85890 flow [2022-12-05 22:48:06,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=78592, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=847, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=85890, PETRI_PLACES=673, PETRI_TRANSITIONS=1888} [2022-12-05 22:48:06,068 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 655 predicate places. [2022-12-05 22:48:06,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:06,068 INFO L89 Accepts]: Start accepts. Operand has 673 places, 1888 transitions, 85890 flow [2022-12-05 22:48:06,083 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:06,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:06,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 673 places, 1888 transitions, 85890 flow [2022-12-05 22:48:06,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 673 places, 1888 transitions, 85890 flow [2022-12-05 22:48:08,020 INFO L130 PetriNetUnfolder]: 1358/3871 cut-off events. [2022-12-05 22:48:08,020 INFO L131 PetriNetUnfolder]: For 1102250/1102737 co-relation queries the response was YES. [2022-12-05 22:48:08,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84271 conditions, 3871 events. 1358/3871 cut-off events. For 1102250/1102737 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 41148 event pairs, 11 based on Foata normal form. 18/3888 useless extension candidates. Maximal degree in co-relation 84041. Up to 2179 conditions per place. [2022-12-05 22:48:08,130 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 673 places, 1888 transitions, 85890 flow [2022-12-05 22:48:08,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 5476 [2022-12-05 22:48:08,323 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:48:08,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2255 [2022-12-05 22:48:08,323 INFO L495 AbstractCegarLoop]: Abstraction has has 673 places, 1888 transitions, 85951 flow [2022-12-05 22:48:08,323 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:48:08,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:08,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:08,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-05 22:48:08,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-05 22:48:08,527 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:48:08,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1659650267, now seen corresponding path program 1 times [2022-12-05 22:48:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:08,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009384982] [2022-12-05 22:48:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:08,746 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:48:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009384982] [2022-12-05 22:48:08,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009384982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455172576] [2022-12-05 22:48:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:08,772 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:48:08,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-05 22:48:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:08,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:48:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:08,971 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:48:08,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:48:09,261 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:48:09,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455172576] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:48:09,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:48:09,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:48:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621483554] [2022-12-05 22:48:09,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:48:09,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:48:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:48:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:48:09,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:48:09,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 1888 transitions, 85951 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:09,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:09,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:48:09,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:48:21,504 INFO L130 PetriNetUnfolder]: 7126/12716 cut-off events. [2022-12-05 22:48:21,504 INFO L131 PetriNetUnfolder]: For 4166419/4166419 co-relation queries the response was YES. [2022-12-05 22:48:21,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220790 conditions, 12716 events. 7126/12716 cut-off events. For 4166419/4166419 co-relation queries the response was YES. Maximal size of possible extension queue 1356. Compared 107824 event pairs, 908 based on Foata normal form. 114/12828 useless extension candidates. Maximal degree in co-relation 220557. Up to 8238 conditions per place. [2022-12-05 22:48:21,702 INFO L137 encePairwiseOnDemand]: 8/69 looper letters, 1248 selfloop transitions, 990 changer transitions 25/2263 dead transitions. [2022-12-05 22:48:21,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 2263 transitions, 99523 flow [2022-12-05 22:48:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-05 22:48:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-05 22:48:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 247 transitions. [2022-12-05 22:48:21,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10528559249786872 [2022-12-05 22:48:21,704 INFO L175 Difference]: Start difference. First operand has 673 places, 1888 transitions, 85951 flow. Second operand 34 states and 247 transitions. [2022-12-05 22:48:21,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 2263 transitions, 99523 flow [2022-12-05 22:48:43,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 2263 transitions, 98480 flow, removed 456 selfloop flow, removed 11 redundant places. [2022-12-05 22:48:43,998 INFO L231 Difference]: Finished difference. Result has 706 places, 1989 transitions, 93265 flow [2022-12-05 22:48:44,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=84387, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=902, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=952, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=93265, PETRI_PLACES=706, PETRI_TRANSITIONS=1989} [2022-12-05 22:48:44,000 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 688 predicate places. [2022-12-05 22:48:44,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:44,000 INFO L89 Accepts]: Start accepts. Operand has 706 places, 1989 transitions, 93265 flow [2022-12-05 22:48:44,016 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:44,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:44,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 706 places, 1989 transitions, 93265 flow [2022-12-05 22:48:44,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 706 places, 1989 transitions, 93265 flow [2022-12-05 22:48:46,272 INFO L130 PetriNetUnfolder]: 1428/4073 cut-off events. [2022-12-05 22:48:46,272 INFO L131 PetriNetUnfolder]: For 1281877/1282389 co-relation queries the response was YES. [2022-12-05 22:48:46,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91610 conditions, 4073 events. 1428/4073 cut-off events. For 1281877/1282389 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 43535 event pairs, 12 based on Foata normal form. 18/4090 useless extension candidates. Maximal degree in co-relation 91368. Up to 2310 conditions per place. [2022-12-05 22:48:46,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 706 places, 1989 transitions, 93265 flow [2022-12-05 22:48:46,406 INFO L188 LiptonReduction]: Number of co-enabled transitions 5738 [2022-12-05 22:48:46,603 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:48:46,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2604 [2022-12-05 22:48:46,604 INFO L495 AbstractCegarLoop]: Abstraction has has 705 places, 1988 transitions, 93260 flow [2022-12-05 22:48:46,604 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:48:46,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:46,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:46,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-05 22:48:46,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-05 22:48:46,809 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:48:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:46,809 INFO L85 PathProgramCache]: Analyzing trace with hash -124887713, now seen corresponding path program 1 times [2022-12-05 22:48:46,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:46,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204422223] [2022-12-05 22:48:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:46,916 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:48:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204422223] [2022-12-05 22:48:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204422223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997296724] [2022-12-05 22:48:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:46,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:46,918 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:48:46,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-05 22:48:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:47,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-05 22:48:47,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:47,117 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:48:47,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:48:47,362 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:48:47,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997296724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:48:47,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:48:47,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:48:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043614570] [2022-12-05 22:48:47,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:48:47,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:48:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:48:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:48:47,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-05 22:48:47,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 1988 transitions, 93260 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:48:47,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:47,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-05 22:48:47,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:49:07,701 INFO L130 PetriNetUnfolder]: 7201/12885 cut-off events. [2022-12-05 22:49:07,701 INFO L131 PetriNetUnfolder]: For 4123061/4123061 co-relation queries the response was YES. [2022-12-05 22:49:07,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227659 conditions, 12885 events. 7201/12885 cut-off events. For 4123061/4123061 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 109724 event pairs, 1452 based on Foata normal form. 77/12960 useless extension candidates. Maximal degree in co-relation 227414. Up to 10666 conditions per place. [2022-12-05 22:49:08,023 INFO L137 encePairwiseOnDemand]: 16/70 looper letters, 1629 selfloop transitions, 554 changer transitions 19/2202 dead transitions. [2022-12-05 22:49:08,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 2202 transitions, 102089 flow [2022-12-05 22:49:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:49:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:49:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-12-05 22:49:08,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10892857142857143 [2022-12-05 22:49:08,024 INFO L175 Difference]: Start difference. First operand has 705 places, 1988 transitions, 93260 flow. Second operand 24 states and 183 transitions. [2022-12-05 22:49:08,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 2202 transitions, 102089 flow [2022-12-05 22:49:33,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 2202 transitions, 100364 flow, removed 716 selfloop flow, removed 15 redundant places. [2022-12-05 22:49:33,903 INFO L231 Difference]: Finished difference. Result has 717 places, 2036 transitions, 95838 flow [2022-12-05 22:49:33,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=91541, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1988, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=514, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=95838, PETRI_PLACES=717, PETRI_TRANSITIONS=2036} [2022-12-05 22:49:33,904 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 699 predicate places. [2022-12-05 22:49:33,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:49:33,905 INFO L89 Accepts]: Start accepts. Operand has 717 places, 2036 transitions, 95838 flow [2022-12-05 22:49:33,922 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:49:33,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:49:33,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 717 places, 2036 transitions, 95838 flow [2022-12-05 22:49:33,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 717 places, 2036 transitions, 95838 flow [2022-12-05 22:49:36,875 INFO L130 PetriNetUnfolder]: 1444/4134 cut-off events. [2022-12-05 22:49:36,876 INFO L131 PetriNetUnfolder]: For 1290071/1290533 co-relation queries the response was YES. [2022-12-05 22:49:36,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92664 conditions, 4134 events. 1444/4134 cut-off events. For 1290071/1290533 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 44443 event pairs, 9 based on Foata normal form. 18/4151 useless extension candidates. Maximal degree in co-relation 92418. Up to 2312 conditions per place. [2022-12-05 22:49:37,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 717 places, 2036 transitions, 95838 flow [2022-12-05 22:49:37,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 5842 [2022-12-05 22:49:37,117 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:49:37,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3213 [2022-12-05 22:49:37,117 INFO L495 AbstractCegarLoop]: Abstraction has has 717 places, 2036 transitions, 95876 flow [2022-12-05 22:49:37,117 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:49:37,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:49:37,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:49:37,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-05 22:49:37,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-05 22:49:37,325 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:49:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:49:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1660185947, now seen corresponding path program 2 times [2022-12-05 22:49:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:49:37,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225307504] [2022-12-05 22:49:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:37,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:49:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:37,454 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:49:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:49:37,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225307504] [2022-12-05 22:49:37,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225307504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:49:37,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305046705] [2022-12-05 22:49:37,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:49:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:49:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:49:37,464 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:49:37,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-05 22:49:37,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:49:37,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:49:37,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:49:37,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:49:37,665 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:49:37,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:49:37,975 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:49:37,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305046705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:49:37,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:49:37,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:49:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473460588] [2022-12-05 22:49:37,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:49:37,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:49:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:49:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:49:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:49:37,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-05 22:49:37,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 2036 transitions, 95876 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:49:37,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:49:37,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-05 22:49:37,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:49:53,999 INFO L130 PetriNetUnfolder]: 7552/13532 cut-off events. [2022-12-05 22:49:53,999 INFO L131 PetriNetUnfolder]: For 4149122/4149122 co-relation queries the response was YES. [2022-12-05 22:49:54,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240742 conditions, 13532 events. 7552/13532 cut-off events. For 4149122/4149122 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 115953 event pairs, 618 based on Foata normal form. 45/13575 useless extension candidates. Maximal degree in co-relation 240493. Up to 8083 conditions per place. [2022-12-05 22:49:54,218 INFO L137 encePairwiseOnDemand]: 8/72 looper letters, 1211 selfloop transitions, 1213 changer transitions 16/2440 dead transitions. [2022-12-05 22:49:54,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 751 places, 2440 transitions, 110434 flow [2022-12-05 22:49:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-05 22:49:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-05 22:49:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 252 transitions. [2022-12-05 22:49:54,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1 [2022-12-05 22:49:54,233 INFO L175 Difference]: Start difference. First operand has 717 places, 2036 transitions, 95876 flow. Second operand 35 states and 252 transitions. [2022-12-05 22:49:54,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 751 places, 2440 transitions, 110434 flow [2022-12-05 22:50:22,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 2440 transitions, 110026 flow, removed 140 selfloop flow, removed 7 redundant places. [2022-12-05 22:50:22,676 INFO L231 Difference]: Finished difference. Result has 755 places, 2146 transitions, 105065 flow [2022-12-05 22:50:22,677 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=95480, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=851, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=105065, PETRI_PLACES=755, PETRI_TRANSITIONS=2146} [2022-12-05 22:50:22,677 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 737 predicate places. [2022-12-05 22:50:22,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:22,677 INFO L89 Accepts]: Start accepts. Operand has 755 places, 2146 transitions, 105065 flow [2022-12-05 22:50:22,702 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:22,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:22,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 755 places, 2146 transitions, 105065 flow [2022-12-05 22:50:22,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 755 places, 2146 transitions, 105065 flow [2022-12-05 22:50:25,111 INFO L130 PetriNetUnfolder]: 1503/4317 cut-off events. [2022-12-05 22:50:25,111 INFO L131 PetriNetUnfolder]: For 1430139/1430622 co-relation queries the response was YES. [2022-12-05 22:50:25,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100106 conditions, 4317 events. 1503/4317 cut-off events. For 1430139/1430622 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 46903 event pairs, 10 based on Foata normal form. 18/4334 useless extension candidates. Maximal degree in co-relation 99848. Up to 2435 conditions per place. [2022-12-05 22:50:25,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 755 places, 2146 transitions, 105065 flow [2022-12-05 22:50:25,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 6126 [2022-12-05 22:50:25,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L705-6-->L705-6: Formula: (and (= (+ (* 3 v_~prev~0_130) (* 21 v_~prev~0_132) (* 34 v_~cur~0_104)) (* 2 v_~next~0_65)) (= v_~cur~0_102 v_~next~0_65) (< v_~x~0_116 1) (= (+ 12 v_~x~0_116) v_~x~0_114) (= (+ (* 21 v_~cur~0_104) (* 3 v_~next~0_65) (* v_~prev~0_132 13)) (* 5 v_~prev~0_130))) InVars {~prev~0=v_~prev~0_132, ~cur~0=v_~cur~0_104, ~x~0=v_~x~0_116} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_69|, ~next~0=v_~next~0_65, ~prev~0=v_~prev~0_130, ~cur~0=v_~cur~0_102, ~x~0=v_~x~0_114} 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_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 5)) 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:25,345 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:50:25,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2669 [2022-12-05 22:50:25,346 INFO L495 AbstractCegarLoop]: Abstraction has has 754 places, 2145 transitions, 105067 flow [2022-12-05 22:50:25,346 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:50:25,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:25,346 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:25,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-05 22:50:25,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-05 22:50:25,547 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:50:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 426605562, now seen corresponding path program 1 times [2022-12-05 22:50:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:25,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55414163] [2022-12-05 22:50:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:25,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:25,574 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:50:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:25,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55414163] [2022-12-05 22:50:25,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55414163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:50:25,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:50:25,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:50:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271167748] [2022-12-05 22:50:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:50:25,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:50:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:50:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:50:25,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-05 22:50:25,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 2145 transitions, 105067 flow. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:25,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:25,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-05 22:50:25,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:38,774 INFO L130 PetriNetUnfolder]: 7696/13757 cut-off events. [2022-12-05 22:50:38,774 INFO L131 PetriNetUnfolder]: For 4246282/4246282 co-relation queries the response was YES. [2022-12-05 22:50:38,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253265 conditions, 13757 events. 7696/13757 cut-off events. For 4246282/4246282 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 120443 event pairs, 874 based on Foata normal form. 14/13769 useless extension candidates. Maximal degree in co-relation 253004. Up to 7026 conditions per place. [2022-12-05 22:50:39,007 INFO L137 encePairwiseOnDemand]: 47/74 looper letters, 2939 selfloop transitions, 93 changer transitions 205/3237 dead transitions. [2022-12-05 22:50:39,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 3237 transitions, 164440 flow [2022-12-05 22:50:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:50:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:50:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-05 22:50:39,008 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 22:50:39,008 INFO L175 Difference]: Start difference. First operand has 754 places, 2145 transitions, 105067 flow. Second operand 5 states and 111 transitions. [2022-12-05 22:50:39,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 3237 transitions, 164440 flow [2022-12-05 22:51:08,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 3237 transitions, 160805 flow, removed 1571 selfloop flow, removed 15 redundant places. [2022-12-05 22:51:08,630 INFO L231 Difference]: Finished difference. Result has 746 places, 2155 transitions, 103294 flow [2022-12-05 22:51:08,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=102427, PETRI_DIFFERENCE_MINUEND_PLACES=739, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103294, PETRI_PLACES=746, PETRI_TRANSITIONS=2155} [2022-12-05 22:51:08,632 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 728 predicate places. [2022-12-05 22:51:08,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:51:08,632 INFO L89 Accepts]: Start accepts. Operand has 746 places, 2155 transitions, 103294 flow [2022-12-05 22:51:08,656 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:51:08,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:51:08,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 746 places, 2155 transitions, 103294 flow [2022-12-05 22:51:08,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 746 places, 2155 transitions, 103294 flow [2022-12-05 22:51:11,169 INFO L130 PetriNetUnfolder]: 1534/4400 cut-off events. [2022-12-05 22:51:11,170 INFO L131 PetriNetUnfolder]: For 1549068/1549539 co-relation queries the response was YES. [2022-12-05 22:51:11,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103246 conditions, 4400 events. 1534/4400 cut-off events. For 1549068/1549539 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 47982 event pairs, 11 based on Foata normal form. 34/4433 useless extension candidates. Maximal degree in co-relation 102987. Up to 2470 conditions per place. [2022-12-05 22:51:11,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 746 places, 2155 transitions, 103294 flow [2022-12-05 22:51:11,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 6220 [2022-12-05 22:51:11,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:51:11,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2739 [2022-12-05 22:51:11,371 INFO L495 AbstractCegarLoop]: Abstraction has has 746 places, 2155 transitions, 103294 flow [2022-12-05 22:51:11,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:51:11,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:51:11,371 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:51:11,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-05 22:51:11,372 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:51:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:51:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash 94735244, now seen corresponding path program 1 times [2022-12-05 22:51:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:51:11,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359624678] [2022-12-05 22:51:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:51:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:11,470 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:51:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:51:11,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359624678] [2022-12-05 22:51:11,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359624678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:51:11,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108242469] [2022-12-05 22:51:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:11,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:51:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:51:11,488 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:51:11,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-05 22:51:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:11,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:51:11,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:51:11,713 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:51:11,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:51:11,986 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:51:11,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108242469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:51:11,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:51:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:51:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871986218] [2022-12-05 22:51:11,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:51:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:51:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:51:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:51:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:51:11,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-05 22:51:11,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 746 places, 2155 transitions, 103294 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:11,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:51:11,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-05 22:51:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:51:36,215 INFO L130 PetriNetUnfolder]: 7764/13930 cut-off events. [2022-12-05 22:51:36,215 INFO L131 PetriNetUnfolder]: For 4757751/4757751 co-relation queries the response was YES. [2022-12-05 22:51:36,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258934 conditions, 13930 events. 7764/13930 cut-off events. For 4757751/4757751 co-relation queries the response was YES. Maximal size of possible extension queue 1481. Compared 120668 event pairs, 1546 based on Foata normal form. 62/13990 useless extension candidates. Maximal degree in co-relation 258672. Up to 11128 conditions per place. [2022-12-05 22:51:36,440 INFO L137 encePairwiseOnDemand]: 16/74 looper letters, 1673 selfloop transitions, 679 changer transitions 50/2402 dead transitions. [2022-12-05 22:51:36,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 2402 transitions, 113282 flow [2022-12-05 22:51:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-05 22:51:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-05 22:51:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 211 transitions. [2022-12-05 22:51:36,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08910472972972973 [2022-12-05 22:51:36,441 INFO L175 Difference]: Start difference. First operand has 746 places, 2155 transitions, 103294 flow. Second operand 32 states and 211 transitions. [2022-12-05 22:51:36,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 777 places, 2402 transitions, 113282 flow [2022-12-05 22:52:07,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 2402 transitions, 113206 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-05 22:52:07,836 INFO L231 Difference]: Finished difference. Result has 781 places, 2173 transitions, 106593 flow [2022-12-05 22:52:07,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=103218, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=646, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=106593, PETRI_PLACES=781, PETRI_TRANSITIONS=2173} [2022-12-05 22:52:07,839 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 763 predicate places. [2022-12-05 22:52:07,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:52:07,839 INFO L89 Accepts]: Start accepts. Operand has 781 places, 2173 transitions, 106593 flow [2022-12-05 22:52:07,861 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:52:07,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:52:07,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 781 places, 2173 transitions, 106593 flow [2022-12-05 22:52:07,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 779 places, 2173 transitions, 106593 flow [2022-12-05 22:52:11,114 INFO L130 PetriNetUnfolder]: 1540/4435 cut-off events. [2022-12-05 22:52:11,115 INFO L131 PetriNetUnfolder]: For 1579933/1580423 co-relation queries the response was YES. [2022-12-05 22:52:11,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105308 conditions, 4435 events. 1540/4435 cut-off events. For 1579933/1580423 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 48547 event pairs, 11 based on Foata normal form. 34/4468 useless extension candidates. Maximal degree in co-relation 105043. Up to 2492 conditions per place. [2022-12-05 22:52:11,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 779 places, 2173 transitions, 106593 flow [2022-12-05 22:52:11,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 6264 [2022-12-05 22:52:11,574 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:52:11,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3736 [2022-12-05 22:52:11,575 INFO L495 AbstractCegarLoop]: Abstraction has has 777 places, 2171 transitions, 106559 flow [2022-12-05 22:52:11,575 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:52:11,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:52:11,575 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:11,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-12-05 22:52:11,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-05 22:52:11,776 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 22:52:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:52:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1690145122, now seen corresponding path program 1 times [2022-12-05 22:52:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:52:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154965323] [2022-12-05 22:52:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:52:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:11,897 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:52:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:52:11,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154965323] [2022-12-05 22:52:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154965323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:52:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18012499] [2022-12-05 22:52:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:52:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:52:11,899 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 22:52:11,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-05 22:52:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:52:12,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 22:52:12,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:52:12,157 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:52:12,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:52:12,452 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:52:12,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18012499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:52:12,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:52:12,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:52:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026658415] [2022-12-05 22:52:12,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:52:12,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:52:12,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:52:12,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:52:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:52:12,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-05 22:52:12,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 2171 transitions, 106559 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:52:12,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:52:12,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-05 22:52:12,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:52:30,925 INFO L130 PetriNetUnfolder]: 7841/14072 cut-off events. [2022-12-05 22:52:30,925 INFO L131 PetriNetUnfolder]: For 5219050/5219050 co-relation queries the response was YES. [2022-12-05 22:52:31,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264096 conditions, 14072 events. 7841/14072 cut-off events. For 5219050/5219050 co-relation queries the response was YES. Maximal size of possible extension queue 1481. Compared 121703 event pairs, 1487 based on Foata normal form. 92/14162 useless extension candidates. Maximal degree in co-relation 263828. Up to 11074 conditions per place. [2022-12-05 22:52:31,160 INFO L137 encePairwiseOnDemand]: 9/76 looper letters, 1728 selfloop transitions, 694 changer transitions 49/2471 dead transitions. [2022-12-05 22:52:31,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 2471 transitions, 117301 flow [2022-12-05 22:52:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-05 22:52:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-05 22:52:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 241 transitions. [2022-12-05 22:52:31,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.07927631578947368 [2022-12-05 22:52:31,161 INFO L175 Difference]: Start difference. First operand has 777 places, 2171 transitions, 106559 flow. Second operand 40 states and 241 transitions. [2022-12-05 22:52:31,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 816 places, 2471 transitions, 117301 flow Received shutdown request... [2022-12-05 22:52:38,504 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 22:52:38,509 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:38,509 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 22:52:38,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-05 22:52:38,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:52:38,709 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-05 22:52:38,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 22:52:38,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 22:52:38,711 INFO L458 BasicCegarLoop]: Path program histogram: [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:52:38,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:52:38,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:52:38,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:52:38 BasicIcfg [2022-12-05 22:52:38,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:52:38,715 INFO L158 Benchmark]: Toolchain (without parser) took 846396.74ms. Allocated memory was 207.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 182.1MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-05 22:52:38,715 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 185.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:52:38,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.14ms. Allocated memory is still 207.6MB. Free memory was 182.1MB in the beginning and 161.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 22:52:38,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.08ms. Allocated memory is still 207.6MB. Free memory was 161.6MB in the beginning and 160.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:38,716 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 207.6MB. Free memory was 160.0MB in the beginning and 158.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 22:52:38,716 INFO L158 Benchmark]: RCFGBuilder took 295.30ms. Allocated memory is still 207.6MB. Free memory was 158.5MB in the beginning and 144.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 22:52:38,716 INFO L158 Benchmark]: TraceAbstraction took 845677.09ms. Allocated memory was 207.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 144.3MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-12-05 22:52:38,717 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 185.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.14ms. Allocated memory is still 207.6MB. Free memory was 182.1MB in the beginning and 161.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.08ms. Allocated memory is still 207.6MB. Free memory was 161.6MB in the beginning and 160.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 207.6MB. Free memory was 160.0MB in the beginning and 158.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 295.30ms. Allocated memory is still 207.6MB. Free memory was 158.5MB in the beginning and 144.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 845677.09ms. Allocated memory was 207.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 144.3MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 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: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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.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): 150, Positive cache size: 150, Positive conditional cache size: 150, 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): 186, Positive cache size: 186, Positive conditional cache size: 186, 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, 21 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 6, independent: 0, independent conditional: 0, 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): 204, Positive cache size: 204, Positive conditional cache size: 204, 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, 27 PlacesAfterwards, 33 TransitionsBefore, 33 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): 236, Positive cache size: 236, Positive conditional cache size: 236, 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, 26 PlacesBefore, 26 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): 236, Positive cache size: 236, Positive conditional cache size: 236, 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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): 336, Positive cache size: 336, Positive conditional cache size: 336, 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: 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): 380, Positive cache size: 380, Positive conditional cache size: 380, 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): 429, Positive cache size: 429, Positive conditional cache size: 429, 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): 561, Positive cache size: 561, Positive conditional cache size: 561, 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, 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): 660, Positive cache size: 660, Positive conditional cache size: 660, 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, 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): 718, Positive cache size: 718, Positive conditional cache size: 718, 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): 821, Positive cache size: 821, Positive conditional cache size: 821, 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, 137 PlacesBefore, 137 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): 884, Positive cache size: 884, Positive conditional cache size: 884, 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): 884, Positive cache size: 884, Positive conditional cache size: 884, 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, 152 PlacesBefore, 152 PlacesAfterwards, 321 TransitionsBefore, 321 TransitionsAfterwards, 974 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): 884, Positive cache size: 884, Positive conditional cache size: 884, 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, 169 PlacesBefore, 169 PlacesAfterwards, 369 TransitionsBefore, 369 TransitionsAfterwards, 1138 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): 993, Positive cache size: 993, Positive conditional cache size: 993, 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, 170 PlacesBefore, 170 PlacesAfterwards, 361 TransitionsBefore, 361 TransitionsAfterwards, 1162 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): 993, Positive cache size: 993, Positive conditional cache size: 993, 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, 175 PlacesBefore, 175 PlacesAfterwards, 364 TransitionsBefore, 364 TransitionsAfterwards, 1196 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): 993, Positive cache size: 993, Positive conditional cache size: 993, 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, 200 PlacesBefore, 200 PlacesAfterwards, 408 TransitionsBefore, 408 TransitionsAfterwards, 1286 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): 1053, Positive cache size: 1053, Positive conditional cache size: 1053, 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, 221 PlacesBefore, 221 PlacesAfterwards, 457 TransitionsBefore, 457 TransitionsAfterwards, 1400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, 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, 235 PlacesBefore, 235 PlacesAfterwards, 497 TransitionsBefore, 497 TransitionsAfterwards, 1486 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 238 PlacesBefore, 238 PlacesAfterwards, 527 TransitionsBefore, 527 TransitionsAfterwards, 1656 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, 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, 282 PlacesBefore, 282 PlacesAfterwards, 681 TransitionsBefore, 681 TransitionsAfterwards, 2084 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): 1060, Positive cache size: 1060, Positive conditional cache size: 1060, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 278 PlacesBefore, 278 PlacesAfterwards, 667 TransitionsBefore, 667 TransitionsAfterwards, 2100 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): 1121, Positive cache size: 1121, Positive conditional cache size: 1121, 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, 321 PlacesBefore, 321 PlacesAfterwards, 819 TransitionsBefore, 819 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 8, independent conditional: 8, 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, 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, 315 PlacesBefore, 315 PlacesAfterwards, 815 TransitionsBefore, 815 TransitionsAfterwards, 2556 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, 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, 336 PlacesBefore, 336 PlacesAfterwards, 844 TransitionsBefore, 844 TransitionsAfterwards, 2614 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): 1200, Positive cache size: 1200, Positive conditional cache size: 1200, 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, 353 PlacesBefore, 353 PlacesAfterwards, 890 TransitionsBefore, 890 TransitionsAfterwards, 2710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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: 5, independent: 2, independent conditional: 2, 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): 1396, Positive cache size: 1396, Positive conditional cache size: 1396, 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, 350 PlacesBefore, 350 PlacesAfterwards, 860 TransitionsBefore, 860 TransitionsAfterwards, 2650 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): 1396, Positive cache size: 1396, Positive conditional cache size: 1396, 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.5s, 377 PlacesBefore, 377 PlacesAfterwards, 890 TransitionsBefore, 890 TransitionsAfterwards, 2710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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): 1579, Positive cache size: 1579, Positive conditional cache size: 1579, 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, 402 PlacesBefore, 402 PlacesAfterwards, 919 TransitionsBefore, 919 TransitionsAfterwards, 2768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 9, independent: 3, independent conditional: 3, 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): 1765, Positive cache size: 1765, Positive conditional cache size: 1765, 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, 420 PlacesBefore, 419 PlacesAfterwards, 976 TransitionsBefore, 975 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 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: 4, independent: 2, independent conditional: 2, 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1932, 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, 409 PlacesBefore, 409 PlacesAfterwards, 965 TransitionsBefore, 965 TransitionsAfterwards, 2882 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1932, 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, 437 PlacesBefore, 437 PlacesAfterwards, 1012 TransitionsBefore, 1012 TransitionsAfterwards, 2982 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): 1932, Positive cache size: 1932, Positive conditional cache size: 1932, 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, 450 PlacesBefore, 449 PlacesAfterwards, 1036 TransitionsBefore, 1035 TransitionsAfterwards, 3020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 1987, Positive cache size: 1987, Positive conditional cache size: 1987, 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, 438 PlacesBefore, 438 PlacesAfterwards, 1075 TransitionsBefore, 1075 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): 1987, Positive cache size: 1987, Positive conditional cache size: 1987, 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, 474 PlacesBefore, 473 PlacesAfterwards, 1124 TransitionsBefore, 1123 TransitionsAfterwards, 3472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 6, independent: 4, independent conditional: 4, 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): 2299, Positive cache size: 2299, Positive conditional cache size: 2299, 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, 497 PlacesBefore, 497 PlacesAfterwards, 1201 TransitionsBefore, 1201 TransitionsAfterwards, 3668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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): 2461, Positive cache size: 2461, Positive conditional cache size: 2461, 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, 504 PlacesBefore, 504 PlacesAfterwards, 1374 TransitionsBefore, 1374 TransitionsAfterwards, 4248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 20, independent: 16, independent conditional: 16, 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): 2561, Positive cache size: 2561, Positive conditional cache size: 2561, 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, 529 PlacesBefore, 528 PlacesAfterwards, 1448 TransitionsBefore, 1447 TransitionsAfterwards, 4402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 2562, Positive cache size: 2562, Positive conditional cache size: 2562, 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, 548 PlacesBefore, 548 PlacesAfterwards, 1691 TransitionsBefore, 1691 TransitionsAfterwards, 5112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 20, independent: 15, independent conditional: 15, 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): 2778, Positive cache size: 2778, Positive conditional cache size: 2778, 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, 560 PlacesBefore, 560 PlacesAfterwards, 1732 TransitionsBefore, 1732 TransitionsAfterwards, 5180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 2779, Positive cache size: 2779, Positive conditional cache size: 2779, 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, 562 PlacesBefore, 561 PlacesAfterwards, 1745 TransitionsBefore, 1744 TransitionsAfterwards, 5198 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 2852, Positive cache size: 2852, Positive conditional cache size: 2852, 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, 575 PlacesBefore, 575 PlacesAfterwards, 1731 TransitionsBefore, 1731 TransitionsAfterwards, 5166 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): 2852, Positive cache size: 2852, Positive conditional cache size: 2852, 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, 606 PlacesBefore, 604 PlacesAfterwards, 1765 TransitionsBefore, 1763 TransitionsAfterwards, 5206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 2967, Positive cache size: 2967, Positive conditional cache size: 2967, 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, 598 PlacesBefore, 597 PlacesAfterwards, 1764 TransitionsBefore, 1763 TransitionsAfterwards, 5192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 2968, Positive cache size: 2968, Positive conditional cache size: 2968, 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, 628 PlacesBefore, 628 PlacesAfterwards, 1813 TransitionsBefore, 1813 TransitionsAfterwards, 5310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 9, independent: 7, independent conditional: 7, 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): 2973, Positive cache size: 2973, Positive conditional cache size: 2973, 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, 639 PlacesBefore, 639 PlacesAfterwards, 1813 TransitionsBefore, 1813 TransitionsAfterwards, 5314 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): 2973, Positive cache size: 2973, Positive conditional cache size: 2973, 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, 673 PlacesBefore, 673 PlacesAfterwards, 1888 TransitionsBefore, 1888 TransitionsAfterwards, 5476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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): 3038, Positive cache size: 3038, Positive conditional cache size: 3038, 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, 706 PlacesBefore, 705 PlacesAfterwards, 1989 TransitionsBefore, 1988 TransitionsAfterwards, 5738 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 3042, Positive cache size: 3042, Positive conditional cache size: 3042, 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, 717 PlacesBefore, 717 PlacesAfterwards, 2036 TransitionsBefore, 2036 TransitionsAfterwards, 5842 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 2, independent: 1, independent conditional: 1, 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): 3115, Positive cache size: 3115, Positive conditional cache size: 3115, 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, 755 PlacesBefore, 754 PlacesAfterwards, 2146 TransitionsBefore, 2145 TransitionsAfterwards, 6126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 5, independent: 2, independent conditional: 2, 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): 3187, Positive cache size: 3187, Positive conditional cache size: 3187, 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, 746 PlacesBefore, 746 PlacesAfterwards, 2155 TransitionsBefore, 2155 TransitionsAfterwards, 6220 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): 3187, Positive cache size: 3187, Positive conditional cache size: 3187, 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, 779 PlacesBefore, 777 PlacesAfterwards, 2173 TransitionsBefore, 2171 TransitionsAfterwards, 6264 CoEnabledTransitionPairs, 2 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 3362, Positive cache size: 3362, Positive conditional cache size: 3362, 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 executing RemoveRedundantFlow. - 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 executing RemoveRedundantFlow. - 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 executing RemoveRedundantFlow. - 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: 845.5s, OverallIterations: 61, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 755.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 6882 SdHoareTripleChecker+Valid, 89.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6882 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 86.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25795 IncrementalHoareTripleChecker+Invalid, 34279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8471 mSolverCounterUnsat, 0 mSDtfsCounter, 25795 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1970 GetRequests, 634 SyntacticMatches, 2 SemanticMatches, 1334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9792 ImplicationChecksByTransitivity, 132.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106593occurred in iteration=60, InterpolantAutomatonStates: 1021, 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, 1.0s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 1290 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 1652 ConstructedInterpolants, 339 QuantifiedInterpolants, 42081 SizeOfPredicates, 42 NumberOfNonLiveVariables, 8627 ConjunctsInSsa, 868 ConjunctsInUnsatCore, 163 InterpolantComputations, 14 PerfectInterpolantSequences, 77/463 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