/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:01:10,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:01:10,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:01:10,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:01:10,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:01:10,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:01:10,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:01:10,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:01:10,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:01:10,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:01:10,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:01:10,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:01:10,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:01:10,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:01:10,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:01:10,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:01:10,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:01:10,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:01:10,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:01:10,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:01:10,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:01:10,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:01:10,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:01:10,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:01:10,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:01:10,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:01:10,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:01:10,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:01:10,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:01:10,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:01:10,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:01:10,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:01:10,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:01:10,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:01:10,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:01:10,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:01:10,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:01:10,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:01:10,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:01:10,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:01:10,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:01:10,537 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:01:10,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:01:10,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:01:10,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:01:10,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:01:10,587 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:01:10,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:01:10,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:01:10,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:01:10,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:01:10,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:01:10,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:01:10,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:01:10,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:01:10,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:01:10,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:01:10,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:01:10,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:01:10,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:01:10,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:01:10,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:01:10,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:01:10,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:10,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:01:10,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:01:10,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:01:10,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:01:10,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:01:10,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:01:10,592 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-06 06:01:11,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:01:11,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:01:11,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:01:11,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:01:11,104 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:01:11,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-12.i [2022-12-06 06:01:12,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:01:12,882 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:01:12,882 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-12.i [2022-12-06 06:01:12,913 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5385f1017/d36bc248333f40e8a9c5afb49969f6cb/FLAGcf3ee08b4 [2022-12-06 06:01:12,926 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5385f1017/d36bc248333f40e8a9c5afb49969f6cb [2022-12-06 06:01:12,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:01:12,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:01:12,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:12,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:01:12,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:01:12,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f25b852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:12, skipping insertion in model container [2022-12-06 06:01:12,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:01:12" (1/1) ... [2022-12-06 06:01:12,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:01:12,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:01:13,184 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_safe-12.i[30241,30254] [2022-12-06 06:01:13,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:13,212 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:01:13,237 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_safe-12.i[30241,30254] [2022-12-06 06:01:13,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:01:13,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:01:13,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:01:13,284 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:01:13,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13 WrapperNode [2022-12-06 06:01:13,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:01:13,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:13,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:01:13,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:01:13,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,349 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-06 06:01:13,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:01:13,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:01:13,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:01:13,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:01:13,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:01:13,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:01:13,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:01:13,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:01:13,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (1/1) ... [2022-12-06 06:01:13,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:01:13,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:13,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:01:13,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:01:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:01:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:01:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:01:13,483 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:01:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:01:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:01:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:01:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:01:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:01:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:01:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:01:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:01:13,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:01:13,485 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:01:13,712 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:01:13,713 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:01:13,989 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:01:13,994 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:01:13,994 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 06:01:13,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:13 BoogieIcfgContainer [2022-12-06 06:01:13,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:01:13,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:01:13,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:01:14,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:01:14,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:01:12" (1/3) ... [2022-12-06 06:01:14,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53158162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:14, skipping insertion in model container [2022-12-06 06:01:14,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:01:13" (2/3) ... [2022-12-06 06:01:14,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53158162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:01:14, skipping insertion in model container [2022-12-06 06:01:14,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:01:13" (3/3) ... [2022-12-06 06:01:14,003 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-12.i [2022-12-06 06:01:14,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:01:14,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:01:14,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:01:14,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:01:14,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 06:01:14,203 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:01:14,204 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:14,209 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-06 06:01:14,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-06 06:01:14,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:14,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:14,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:14,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:14,275 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-06 06:01:14,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:14,276 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-06 06:01:14,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-06 06:01:14,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 06:01:17,910 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-06 06:01:17,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:01:17,924 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;@4ae91088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:01:17,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 06:01:17,927 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-06 06:01:17,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:17,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:17,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:01:17,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-06 06:01:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:17,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252359914] [2022-12-06 06:01:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:18,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252359914] [2022-12-06 06:01:18,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252359914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:18,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:01:18,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:01:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624583948] [2022-12-06 06:01:18,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:18,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:01:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:01:18,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:01:18,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:18,093 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-06 06:01:18,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:18,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:18,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:18,146 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 06:01:18,146 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:01:18,146 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-06 06:01:18,147 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-06 06:01:18,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-06 06:01:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:01:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:01:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:01:18,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:01:18,156 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:01:18,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-06 06:01:18,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:18,158 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:18,160 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-06 06:01:18,162 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 06:01:18,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:18,162 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:18,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:18,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:18,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-06 06:01:18,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:18,167 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 06:01:18,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:01:18,168 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-06 06:01:18,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:18,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 06:01:18,168 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:18,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 06:01:18,169 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-06 06:01:18,170 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-06 06:01:18,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:18,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:18,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:01:18,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-06 06:01:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:18,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283993452] [2022-12-06 06:01:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,228 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-06 06:01:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283993452] [2022-12-06 06:01:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283993452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963504787] [2022-12-06 06:01:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:18,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:18,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 06:01:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:18,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:18,363 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-06 06:01:18,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:18,374 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-06 06:01:18,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963504787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:18,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:18,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624364381] [2022-12-06 06:01:18,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:18,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:18,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:01:18,376 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-06 06:01:18,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:18,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:01:18,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:18,433 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:18,433 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:18,433 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-06 06:01:18,434 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:18,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-06 06:01:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:18,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-06 06:01:18,436 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:18,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-06 06:01:18,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:01:18,437 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,437 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-06 06:01:18,437 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:18,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:18,438 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:18,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:18,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,441 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:18,441 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:18,441 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-06 06:01:18,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:18,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:18,663 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:18,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 06:01:18,664 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:18,664 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-06 06:01:18,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:18,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:18,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 06:01:18,865 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-06 06:01:18,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-06 06:01:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:18,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532496401] [2022-12-06 06:01:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:18,941 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-06 06:01:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:18,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532496401] [2022-12-06 06:01:18,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532496401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:18,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841822820] [2022-12-06 06:01:18,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:18,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:18,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:18,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 06:01:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:19,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:19,058 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-06 06:01:19,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:19,074 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-06 06:01:19,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841822820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:19,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:19,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798927153] [2022-12-06 06:01:19,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:19,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:19,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:19,077 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-06 06:01:19,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:19,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:19,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:19,173 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:19,173 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:19,175 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-06 06:01:19,179 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:19,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:19,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:19,181 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:19,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:19,184 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,184 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-06 06:01:19,184 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:19,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:19,185 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:19,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:19,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,188 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:19,189 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:19,189 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-06 06:01:19,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:19,435 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:19,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 06:01:19,436 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:19,437 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-06 06:01:19,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:19,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:19,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 06:01:19,642 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-06 06:01:19,643 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-06 06:01:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315366958] [2022-12-06 06:01:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,696 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-06 06:01:19,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:19,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315366958] [2022-12-06 06:01:19,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315366958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:19,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056000238] [2022-12-06 06:01:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:19,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:19,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:19,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:19,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 06:01:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:19,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:19,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:19,802 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-06 06:01:19,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:19,816 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-06 06:01:19,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056000238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:19,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:19,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160185014] [2022-12-06 06:01:19,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:19,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:19,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:19,820 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-06 06:01:19,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:19,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:19,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:19,887 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:19,887 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:19,888 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-06 06:01:19,890 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:19,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:19,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:19,893 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:19,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:19,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:19,898 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,898 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-06 06:01:19,902 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:19,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:19,902 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:19,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:19,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,909 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:19,909 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:19,909 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-06 06:01:19,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:19,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:20,091 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:20,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 06:01:20,092 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:20,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:20,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:20,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:20,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:20,293 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-06 06:01:20,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149165, now seen corresponding path program 1 times [2022-12-06 06:01:20,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:20,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450328972] [2022-12-06 06:01:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,324 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-06 06:01:20,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450328972] [2022-12-06 06:01:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450328972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018086748] [2022-12-06 06:01:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:20,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:20,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:20,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 06:01:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:20,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:20,437 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-06 06:01:20,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:20,451 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-06 06:01:20,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018086748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:20,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:20,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952816876] [2022-12-06 06:01:20,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:20,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:20,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:20,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:20,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:20,453 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-06 06:01:20,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:20,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:20,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:20,508 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-06 06:01:20,508 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 06:01:20,509 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-06 06:01:20,510 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-06 06:01:20,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:01:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:01:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-06 06:01:20,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:01:20,511 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-06 06:01:20,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-06 06:01:20,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:20,512 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,512 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-06 06:01:20,513 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 06:01:20,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:20,513 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:20,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:20,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,516 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-06 06:01:20,516 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 06:01:20,516 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-06 06:01:20,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-06 06:01:20,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:01:20,717 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:20,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 06:01:20,718 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-06 06:01:20,718 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-06 06:01:20,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:20,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:20,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 06:01:20,919 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-06 06:01:20,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149072, now seen corresponding path program 1 times [2022-12-06 06:01:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:20,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418732256] [2022-12-06 06:01:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:20,962 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-06 06:01:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418732256] [2022-12-06 06:01:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418732256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900521059] [2022-12-06 06:01:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:20,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:20,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:20,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 06:01:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:21,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:21,029 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-06 06:01:21,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:21,039 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-06 06:01:21,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900521059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:21,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:21,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:21,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193498144] [2022-12-06 06:01:21,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:21,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:21,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:21,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:21,043 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-06 06:01:21,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:21,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:21,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:21,096 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:21,096 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-06 06:01:21,096 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-06 06:01:21,097 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:21,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-06 06:01:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:21,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:21,098 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:21,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-06 06:01:21,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:21,101 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,101 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-06 06:01:21,103 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:21,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:21,103 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:21,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:21,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,106 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:21,106 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:21,106 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-06 06:01:21,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:21,225 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:21,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 06:01:21,225 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:21,225 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-06 06:01:21,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:21,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:21,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:21,426 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-06 06:01:21,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149010, now seen corresponding path program 1 times [2022-12-06 06:01:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:21,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876478479] [2022-12-06 06:01:21,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,477 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-06 06:01:21,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876478479] [2022-12-06 06:01:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876478479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894316056] [2022-12-06 06:01:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:21,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:21,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 06:01:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:21,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:21,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:21,554 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-06 06:01:21,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:21,565 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-06 06:01:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894316056] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:21,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772167718] [2022-12-06 06:01:21,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:21,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:21,567 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-06 06:01:21,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:21,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:21,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:21,610 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:21,610 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:21,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 377 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 06:01:21,611 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:21,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:21,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:21,612 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:21,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:21,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:21,613 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,614 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-06 06:01:21,614 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:21,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:21,614 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:21,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:21,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,617 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:21,617 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:21,617 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-06 06:01:21,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:21,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:21,796 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:21,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 06:01:21,798 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:21,798 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-06 06:01:21,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:21,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:21,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:21,998 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-06 06:01:21,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148948, now seen corresponding path program 1 times [2022-12-06 06:01:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824788273] [2022-12-06 06:01:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,072 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-06 06:01:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:22,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824788273] [2022-12-06 06:01:22,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824788273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:22,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490792117] [2022-12-06 06:01:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:22,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:22,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 06:01:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:22,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:22,178 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-06 06:01:22,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:22,186 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-06 06:01:22,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490792117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:22,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:22,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432032769] [2022-12-06 06:01:22,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:22,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:22,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:22,188 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-06 06:01:22,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:22,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:22,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:22,245 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:22,245 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:22,246 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-06 06:01:22,247 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:22,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:22,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:22,265 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:22,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:22,266 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,266 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-06 06:01:22,267 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:22,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:22,268 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:22,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:22,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,272 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:22,272 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:22,272 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-06 06:01:22,272 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:22,474 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:22,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 06:01:22,475 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:22,475 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-06 06:01:22,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:22,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:22,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:22,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148886, now seen corresponding path program 1 times [2022-12-06 06:01:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:22,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968514259] [2022-12-06 06:01:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,779 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-06 06:01:22,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:22,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968514259] [2022-12-06 06:01:22,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968514259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:22,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194700716] [2022-12-06 06:01:22,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:22,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:22,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:22,796 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:22,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 06:01:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:22,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:22,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:22,895 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-06 06:01:22,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:22,903 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-06 06:01:22,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194700716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:22,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:22,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:22,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216592706] [2022-12-06 06:01:22,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:22,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:22,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:22,917 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-06 06:01:22,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:22,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:22,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:22,975 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:22,975 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:22,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 377 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-06 06:01:22,976 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:22,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:22,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:22,977 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:22,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:22,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:22,978 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,979 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-06 06:01:22,995 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:22,996 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:22,996 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:22,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:22,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,999 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:22,999 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:22,999 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-06 06:01:22,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:22,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:23,174 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:23,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 06:01:23,175 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:23,175 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-06 06:01:23,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:23,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:23,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 06:01:23,375 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,SelfDestructingSolverStorable8 [2022-12-06 06:01:23,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148824, now seen corresponding path program 1 times [2022-12-06 06:01:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:23,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298531000] [2022-12-06 06:01:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,467 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-06 06:01:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:23,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298531000] [2022-12-06 06:01:23,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298531000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:23,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343035004] [2022-12-06 06:01:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:23,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:23,478 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:23,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 06:01:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:23,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:23,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:23,591 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-06 06:01:23,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:23,599 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-06 06:01:23,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343035004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:23,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:23,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802575147] [2022-12-06 06:01:23,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:23,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:23,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:23,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:23,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:23,600 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-06 06:01:23,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:23,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:23,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:23,675 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:23,675 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:23,675 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-06 06:01:23,676 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:23,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:23,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:23,677 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:23,678 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,678 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-06 06:01:23,678 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:23,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:23,678 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:23,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:23,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,681 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:23,681 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:23,681 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-06 06:01:23,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:23,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:23,881 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:23,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 06:01:23,881 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:23,881 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-06 06:01:23,882 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:23,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:23,888 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-06 06:01:24,082 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,SelfDestructingSolverStorable9 [2022-12-06 06:01:24,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:24,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148762, now seen corresponding path program 1 times [2022-12-06 06:01:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:24,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72924241] [2022-12-06 06:01:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,123 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-06 06:01:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72924241] [2022-12-06 06:01:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72924241] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656565505] [2022-12-06 06:01:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:24,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:24,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 06:01:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:24,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:24,249 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-06 06:01:24,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:24,260 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-06 06:01:24,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656565505] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:24,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:24,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 06:01:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136047067] [2022-12-06 06:01:24,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:24,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:01:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:01:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:01:24,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:24,262 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-06 06:01:24,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:24,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:24,339 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-06 06:01:24,340 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-06 06:01:24,340 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-06 06:01:24,341 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:01:24,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:01:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:01:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 06:01:24,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:01:24,343 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-06 06:01:24,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-06 06:01:24,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:24,344 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:24,344 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-06 06:01:24,344 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 06:01:24,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:24,345 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:24,359 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:24,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:24,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:24,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:24,362 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 06:01:24,363 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:24,363 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-06 06:01:24,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-06 06:01:24,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 06:01:24,522 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:24,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 06:01:24,523 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-06 06:01:24,523 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-06 06:01:24,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:24,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:24,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:24,724 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,SelfDestructingSolverStorable10 [2022-12-06 06:01:24,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148700, now seen corresponding path program 1 times [2022-12-06 06:01:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:24,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550569072] [2022-12-06 06:01:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,827 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-06 06:01:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550569072] [2022-12-06 06:01:24,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550569072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:24,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682775130] [2022-12-06 06:01:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:24,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:24,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:24,830 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:24,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 06:01:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:24,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:24,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:24,908 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-06 06:01:24,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:24,918 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-06 06:01:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682775130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:24,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:24,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-06 06:01:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657092700] [2022-12-06 06:01:24,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:24,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:01:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:24,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:01:24,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:01:24,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:24,920 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-06 06:01:24,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:24,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:24,955 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-06 06:01:24,955 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-06 06:01:24,956 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 309 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-06 06:01:24,957 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 06:01:24,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-06 06:01:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 06:01:24,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:01:24,958 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-06 06:01:24,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-06 06:01:24,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 06:01:24,959 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,959 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-06 06:01:24,960 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 06:01:24,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:24,960 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:24,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:24,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,965 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 06:01:24,965 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:01:24,965 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-06 06:01:24,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-06 06:01:24,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:01:25,039 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:25,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 06:01:25,040 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-06 06:01:25,040 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-06 06:01:25,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:25,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:25,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 06:01:25,244 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,SelfDestructingSolverStorable11 [2022-12-06 06:01:25,245 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148669, now seen corresponding path program 1 times [2022-12-06 06:01:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:25,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460134103] [2022-12-06 06:01:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:25,342 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-06 06:01:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:25,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460134103] [2022-12-06 06:01:25,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460134103] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:25,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107290770] [2022-12-06 06:01:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:25,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:25,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:25,344 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:25,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 06:01:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:25,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:01:25,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:25,440 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-06 06:01:25,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:25,486 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-06 06:01:25,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107290770] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:25,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:25,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-06 06:01:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921270293] [2022-12-06 06:01:25,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:25,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:01:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:25,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:01:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:01:25,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:01:25,488 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-06 06:01:25,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:25,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:01:25,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:25,614 INFO L130 PetriNetUnfolder]: 247/378 cut-off events. [2022-12-06 06:01:25,614 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 06:01:25,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 378 events. 247/378 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1185 event pairs, 31 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 973. Up to 167 conditions per place. [2022-12-06 06:01:25,616 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 45 selfloop transitions, 19 changer transitions 0/64 dead transitions. [2022-12-06 06:01:25,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 64 transitions, 318 flow [2022-12-06 06:01:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:01:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:01:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-06 06:01:25,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:01:25,617 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-06 06:01:25,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 64 transitions, 318 flow [2022-12-06 06:01:25,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 64 transitions, 288 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:25,618 INFO L231 Difference]: Finished difference. Result has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,618 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=164, PETRI_PLACES=28, PETRI_TRANSITIONS=33} [2022-12-06 06:01:25,619 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 10 predicate places. [2022-12-06 06:01:25,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:25,619 INFO L89 Accepts]: Start accepts. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:25,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:25,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,623 INFO L130 PetriNetUnfolder]: 35/77 cut-off events. [2022-12-06 06:01:25,624 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 06:01:25,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 77 events. 35/77 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 218 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 187. Up to 41 conditions per place. [2022-12-06 06:01:25,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 33 transitions, 164 flow [2022-12-06 06:01:25,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 06:01:25,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (= (+ (* 28657 v_~cur~0_194) (* 3 v_~prev~0_220) (* v_~prev~0_222 17711)) (* 2 v_~next~0_127)) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (+ (* 46368 v_~prev~0_222) (* 75025 v_~cur~0_194) v_~prev~0_220) v_~next~0_127)) InVars {~prev~0=v_~prev~0_222, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} 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_32 12) (= v_~q~0_31 (+ v_~q~0_32 1)) (= 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-06 06:01:25,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (= (+ (* 28657 v_~cur~0_194) (* 3 v_~prev~0_220) (* v_~prev~0_222 17711)) (* 2 v_~next~0_127)) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (+ (* 46368 v_~prev~0_222) (* 75025 v_~cur~0_194) v_~prev~0_220) v_~next~0_127)) InVars {~prev~0=v_~prev~0_222, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} 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_~p~0_34 12) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 06:01:25,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (= (+ (* 28657 v_~cur~0_194) (* 3 v_~prev~0_220) (* v_~prev~0_222 17711)) (* 2 v_~next~0_127)) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (+ (* 46368 v_~prev~0_222) (* 75025 v_~cur~0_194) v_~prev~0_220) v_~next~0_127)) InVars {~prev~0=v_~prev~0_222, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} 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_~p~0_34 12) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 06:01:25,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L705-6-->L705-6: Formula: (and (= v_~next~0_127 v_~cur~0_192) (= (+ (* 28657 v_~cur~0_194) (* 3 v_~prev~0_220) (* v_~prev~0_222 17711)) (* 2 v_~next~0_127)) (< v_~x~0_218 1) (= (+ 26 v_~x~0_218) v_~x~0_216) (= (+ (* 46368 v_~prev~0_222) (* 75025 v_~cur~0_194) v_~prev~0_220) v_~next~0_127)) InVars {~prev~0=v_~prev~0_222, ~cur~0=v_~cur~0_194, ~x~0=v_~x~0_218} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_137|, ~next~0=v_~next~0_127, ~prev~0=v_~prev~0_220, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_216} 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_32 12) (= v_~q~0_31 (+ v_~q~0_32 1)) (= 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-06 06:01:25,921 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:25,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-06 06:01:25,921 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 33 transitions, 186 flow [2022-12-06 06:01:25,921 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-06 06:01:25,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:25,922 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:25,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 06:01:26,122 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,SelfDestructingSolverStorable12 [2022-12-06 06:01:26,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 66809980, now seen corresponding path program 1 times [2022-12-06 06:01:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:26,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902005124] [2022-12-06 06:01:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:26,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:26,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902005124] [2022-12-06 06:01:26,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902005124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:26,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251412599] [2022-12-06 06:01:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:26,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:26,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:26,336 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:26,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 06:01:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:26,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 06:01:26,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:26,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:26,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251412599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:26,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:26,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:26,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997413867] [2022-12-06 06:01:26,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:26,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:26,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:01:26,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 33 transitions, 186 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-06 06:01:26,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:26,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:01:26,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:27,239 INFO L130 PetriNetUnfolder]: 637/971 cut-off events. [2022-12-06 06:01:27,239 INFO L131 PetriNetUnfolder]: For 1393/1393 co-relation queries the response was YES. [2022-12-06 06:01:27,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 971 events. 637/971 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4010 event pairs, 35 based on Foata normal form. 38/997 useless extension candidates. Maximal degree in co-relation 2976. Up to 370 conditions per place. [2022-12-06 06:01:27,243 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 89 selfloop transitions, 67 changer transitions 3/159 dead transitions. [2022-12-06 06:01:27,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 159 transitions, 986 flow [2022-12-06 06:01:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:01:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:01:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 144 transitions. [2022-12-06 06:01:27,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 06:01:27,260 INFO L175 Difference]: Start difference. First operand has 28 places, 33 transitions, 186 flow. Second operand 16 states and 144 transitions. [2022-12-06 06:01:27,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 159 transitions, 986 flow [2022-12-06 06:01:27,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 159 transitions, 952 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-06 06:01:27,266 INFO L231 Difference]: Finished difference. Result has 48 places, 84 transitions, 614 flow [2022-12-06 06:01:27,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=614, PETRI_PLACES=48, PETRI_TRANSITIONS=84} [2022-12-06 06:01:27,267 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-06 06:01:27,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:27,267 INFO L89 Accepts]: Start accepts. Operand has 48 places, 84 transitions, 614 flow [2022-12-06 06:01:27,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:27,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:27,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 84 transitions, 614 flow [2022-12-06 06:01:27,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 84 transitions, 614 flow [2022-12-06 06:01:27,312 INFO L130 PetriNetUnfolder]: 89/180 cut-off events. [2022-12-06 06:01:27,312 INFO L131 PetriNetUnfolder]: For 446/449 co-relation queries the response was YES. [2022-12-06 06:01:27,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 180 events. 89/180 cut-off events. For 446/449 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 717 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 628. Up to 119 conditions per place. [2022-12-06 06:01:27,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 84 transitions, 614 flow [2022-12-06 06:01:27,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 06:01:27,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] L705-6-->L705-6: Formula: (and (= v_~next~0_136 v_~cur~0_207) (< v_~x~0_232 27) (= (+ (* 3 v_~next~0_136) (* 28657 v_~cur~0_209) (* v_~prev~0_238 17711)) (* 5 v_~prev~0_236)) (= (+ v_~x~0_234 27) v_~x~0_232) (= (+ (* 75025 v_~cur~0_209) v_~next~0_136 (* 46368 v_~prev~0_238)) (* 2 v_~prev~0_236))) InVars {~prev~0=v_~prev~0_238, ~cur~0=v_~cur~0_209, ~x~0=v_~x~0_234} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_147|, ~next~0=v_~next~0_136, ~prev~0=v_~prev~0_236, ~cur~0=v_~cur~0_207, ~x~0=v_~x~0_232} 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_32 12) (= v_~q~0_31 (+ v_~q~0_32 1)) (= 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-06 06:01:27,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] L705-6-->L705-6: Formula: (and (= v_~next~0_136 v_~cur~0_207) (< v_~x~0_232 27) (= (+ (* 3 v_~next~0_136) (* 28657 v_~cur~0_209) (* v_~prev~0_238 17711)) (* 5 v_~prev~0_236)) (= (+ v_~x~0_234 27) v_~x~0_232) (= (+ (* 75025 v_~cur~0_209) v_~next~0_136 (* 46368 v_~prev~0_238)) (* 2 v_~prev~0_236))) InVars {~prev~0=v_~prev~0_238, ~cur~0=v_~cur~0_209, ~x~0=v_~x~0_234} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_147|, ~next~0=v_~next~0_136, ~prev~0=v_~prev~0_236, ~cur~0=v_~cur~0_207, ~x~0=v_~x~0_232} 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_~p~0_34 12) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-06 06:01:27,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (< v_~p~0_34 12) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90))) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [359] L705-6-->L687-5: Formula: (and (= v_~x~0_238 (+ 26 v_~x~0_239)) (= (+ (* v_~prev~0_243 17711) (* 3 v_~prev~0_242) (* 28657 v_~cur~0_214)) (* 2 v_~next~0_140)) (= v_~p~0_43 (+ v_~p~0_44 1)) (< v_~x~0_239 1) (= v_~next~0_140 v_~cur~0_213) (= (+ (* 75025 v_~cur~0_214) (* 46368 v_~prev~0_243) v_~prev~0_242) v_~next~0_140) (= (+ v_~j~0_121 v_~i~0_108) v_~i~0_107) (< v_~p~0_44 12)) InVars {~j~0=v_~j~0_121, ~prev~0=v_~prev~0_243, ~i~0=v_~i~0_108, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_214, ~x~0=v_~x~0_239} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_151|, ~j~0=v_~j~0_121, ~next~0=v_~next~0_140, ~prev~0=v_~prev~0_242, ~i~0=v_~i~0_107, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_30|, ~p~0=v_~p~0_43, ~cur~0=v_~cur~0_213, ~x~0=v_~x~0_238} 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-06 06:01:27,796 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:01:27,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 529 [2022-12-06 06:01:27,797 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 84 transitions, 632 flow [2022-12-06 06:01:27,797 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-06 06:01:27,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:27,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:27,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:27,997 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,SelfDestructingSolverStorable13 [2022-12-06 06:01:27,997 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1106189867, now seen corresponding path program 1 times [2022-12-06 06:01:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:27,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594917006] [2022-12-06 06:01:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:27,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:28,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:28,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594917006] [2022-12-06 06:01:28,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594917006] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:28,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024829338] [2022-12-06 06:01:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:28,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:28,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:28,062 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:28,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 06:01:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:28,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-06 06:01:28,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:28,170 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-06 06:01:28,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 06:01:28,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024829338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:01:28,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 06:01:28,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-06 06:01:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406871998] [2022-12-06 06:01:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:01:28,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:01:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:01:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:01:28,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:01:28,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 84 transitions, 632 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-06 06:01:28,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:28,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:01:28,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:28,268 INFO L130 PetriNetUnfolder]: 344/561 cut-off events. [2022-12-06 06:01:28,268 INFO L131 PetriNetUnfolder]: For 1845/1845 co-relation queries the response was YES. [2022-12-06 06:01:28,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 561 events. 344/561 cut-off events. For 1845/1845 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2224 event pairs, 153 based on Foata normal form. 81/626 useless extension candidates. Maximal degree in co-relation 1877. Up to 337 conditions per place. [2022-12-06 06:01:28,271 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-06 06:01:28,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 492 flow [2022-12-06 06:01:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:01:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:01:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 06:01:28,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-06 06:01:28,288 INFO L175 Difference]: Start difference. First operand has 46 places, 84 transitions, 632 flow. Second operand 4 states and 32 transitions. [2022-12-06 06:01:28,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 492 flow [2022-12-06 06:01:28,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 431 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:01:28,293 INFO L231 Difference]: Finished difference. Result has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:28,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=39, PETRI_TRANSITIONS=47} [2022-12-06 06:01:28,294 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 21 predicate places. [2022-12-06 06:01:28,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:28,294 INFO L89 Accepts]: Start accepts. Operand has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:28,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:28,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:28,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 47 transitions, 309 flow [2022-12-06 06:01:28,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 47 transitions, 309 flow [2022-12-06 06:01:28,302 INFO L130 PetriNetUnfolder]: 48/121 cut-off events. [2022-12-06 06:01:28,302 INFO L131 PetriNetUnfolder]: For 239/253 co-relation queries the response was YES. [2022-12-06 06:01:28,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 121 events. 48/121 cut-off events. For 239/253 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 478 event pairs, 0 based on Foata normal form. 3/122 useless extension candidates. Maximal degree in co-relation 318. Up to 34 conditions per place. [2022-12-06 06:01:28,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 47 transitions, 309 flow [2022-12-06 06:01:28,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 06:01:28,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:28,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 06:01:28,411 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 315 flow [2022-12-06 06:01:28,411 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-06 06:01:28,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:28,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:28,439 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-06 06:01:28,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:28,616 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1429422806, now seen corresponding path program 1 times [2022-12-06 06:01:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357049041] [2022-12-06 06:01:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:28,803 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-06 06:01:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357049041] [2022-12-06 06:01:28,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357049041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062235190] [2022-12-06 06:01:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:28,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:28,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:28,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:28,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 06:01:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:28,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 06:01:28,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:29,013 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-06 06:01:29,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:29,143 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-06 06:01:29,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062235190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:29,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:29,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 06:01:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394832122] [2022-12-06 06:01:29,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:29,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 06:01:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 06:01:29,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-06 06:01:29,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:01:29,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 315 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:29,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:29,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:01:29,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:31,376 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 [] [2022-12-06 06:01:31,511 INFO L130 PetriNetUnfolder]: 402/671 cut-off events. [2022-12-06 06:01:31,511 INFO L131 PetriNetUnfolder]: For 1204/1204 co-relation queries the response was YES. [2022-12-06 06:01:31,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 671 events. 402/671 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2925 event pairs, 40 based on Foata normal form. 26/681 useless extension candidates. Maximal degree in co-relation 2027. Up to 383 conditions per place. [2022-12-06 06:01:31,515 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-06 06:01:31,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 101 transitions, 700 flow [2022-12-06 06:01:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:01:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:01:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-06 06:01:31,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-06 06:01:31,516 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 315 flow. Second operand 10 states and 74 transitions. [2022-12-06 06:01:31,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 101 transitions, 700 flow [2022-12-06 06:01:31,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 101 transitions, 683 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:31,536 INFO L231 Difference]: Finished difference. Result has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=581, PETRI_PLACES=51, PETRI_TRANSITIONS=68} [2022-12-06 06:01:31,538 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2022-12-06 06:01:31,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:31,538 INFO L89 Accepts]: Start accepts. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:31,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:31,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,548 INFO L130 PetriNetUnfolder]: 63/155 cut-off events. [2022-12-06 06:01:31,548 INFO L131 PetriNetUnfolder]: For 420/466 co-relation queries the response was YES. [2022-12-06 06:01:31,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 155 events. 63/155 cut-off events. For 420/466 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 677 event pairs, 1 based on Foata normal form. 5/157 useless extension candidates. Maximal degree in co-relation 548. Up to 48 conditions per place. [2022-12-06 06:01:31,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 68 transitions, 581 flow [2022-12-06 06:01:31,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:01:31,778 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:31,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 06:01:31,779 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 68 transitions, 598 flow [2022-12-06 06:01:31,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:01:31,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:31,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:31,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:31,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 06:01:31,980 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash 68211986, now seen corresponding path program 1 times [2022-12-06 06:01:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:31,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534421702] [2022-12-06 06:01:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534421702] [2022-12-06 06:01:32,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534421702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831265366] [2022-12-06 06:01:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:32,210 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 06:01:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:32,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 06:01:32,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:32,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:32,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831265366] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:32,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:32,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:32,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705673474] [2022-12-06 06:01:32,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:32,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:32,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:32,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:01:32,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 68 transitions, 598 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-06 06:01:32,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:32,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:01:32,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:01:39,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:01:39,207 INFO L130 PetriNetUnfolder]: 548/935 cut-off events. [2022-12-06 06:01:39,207 INFO L131 PetriNetUnfolder]: For 3120/3120 co-relation queries the response was YES. [2022-12-06 06:01:39,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 935 events. 548/935 cut-off events. For 3120/3120 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4536 event pairs, 31 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 3268. Up to 295 conditions per place. [2022-12-06 06:01:39,227 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 73 selfloop transitions, 97 changer transitions 0/170 dead transitions. [2022-12-06 06:01:39,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 170 transitions, 1411 flow [2022-12-06 06:01:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:01:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:01:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-06 06:01:39,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33229813664596275 [2022-12-06 06:01:39,229 INFO L175 Difference]: Start difference. First operand has 51 places, 68 transitions, 598 flow. Second operand 14 states and 107 transitions. [2022-12-06 06:01:39,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 170 transitions, 1411 flow [2022-12-06 06:01:39,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 170 transitions, 1374 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 06:01:39,253 INFO L231 Difference]: Finished difference. Result has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:39,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1241, PETRI_PLACES=69, PETRI_TRANSITIONS=120} [2022-12-06 06:01:39,254 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 51 predicate places. [2022-12-06 06:01:39,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:39,254 INFO L89 Accepts]: Start accepts. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:39,256 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:39,256 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:39,256 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:39,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:39,281 INFO L130 PetriNetUnfolder]: 81/205 cut-off events. [2022-12-06 06:01:39,281 INFO L131 PetriNetUnfolder]: For 786/822 co-relation queries the response was YES. [2022-12-06 06:01:39,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 205 events. 81/205 cut-off events. For 786/822 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1016 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 895. Up to 86 conditions per place. [2022-12-06 06:01:39,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:39,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 06:01:39,284 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:01:39,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 06:01:39,284 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 120 transitions, 1241 flow [2022-12-06 06:01:39,284 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-06 06:01:39,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:39,285 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:39,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 06:01:39,492 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1361987638, now seen corresponding path program 1 times [2022-12-06 06:01:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050169062] [2022-12-06 06:01:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:39,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050169062] [2022-12-06 06:01:39,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050169062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:39,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029348616] [2022-12-06 06:01:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:39,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:39,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:39,720 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:39,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 06:01:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:39,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:01:39,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:39,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:40,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029348616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:40,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:40,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625354440] [2022-12-06 06:01:40,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:40,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:40,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:01:40,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 120 transitions, 1241 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-06 06:01:40,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:40,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:01:40,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:46,357 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 [] [2022-12-06 06:01:48,440 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 [] [2022-12-06 06:01:48,608 INFO L130 PetriNetUnfolder]: 592/1023 cut-off events. [2022-12-06 06:01:48,608 INFO L131 PetriNetUnfolder]: For 5402/5402 co-relation queries the response was YES. [2022-12-06 06:01:48,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1023 events. 592/1023 cut-off events. For 5402/5402 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5179 event pairs, 66 based on Foata normal form. 24/1028 useless extension candidates. Maximal degree in co-relation 4181. Up to 656 conditions per place. [2022-12-06 06:01:48,613 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 113 selfloop transitions, 61 changer transitions 0/174 dead transitions. [2022-12-06 06:01:48,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1819 flow [2022-12-06 06:01:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:01:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:01:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-06 06:01:48,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-06 06:01:48,615 INFO L175 Difference]: Start difference. First operand has 69 places, 120 transitions, 1241 flow. Second operand 11 states and 82 transitions. [2022-12-06 06:01:48,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1819 flow [2022-12-06 06:01:48,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 174 transitions, 1737 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:48,626 INFO L231 Difference]: Finished difference. Result has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:48,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1515, PETRI_PLACES=80, PETRI_TRANSITIONS=138} [2022-12-06 06:01:48,627 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 62 predicate places. [2022-12-06 06:01:48,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:48,627 INFO L89 Accepts]: Start accepts. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:48,628 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:48,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:48,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:48,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:48,642 INFO L130 PetriNetUnfolder]: 92/237 cut-off events. [2022-12-06 06:01:48,643 INFO L131 PetriNetUnfolder]: For 995/1031 co-relation queries the response was YES. [2022-12-06 06:01:48,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 237 events. 92/237 cut-off events. For 995/1031 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1223 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 1104. Up to 106 conditions per place. [2022-12-06 06:01:48,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 138 transitions, 1515 flow [2022-12-06 06:01:48,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 06:01:48,732 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:01:48,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 06:01:48,735 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 138 transitions, 1526 flow [2022-12-06 06:01:48,736 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-06 06:01:48,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:48,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:48,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:48,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 06:01:48,941 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 548616381, now seen corresponding path program 1 times [2022-12-06 06:01:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111001928] [2022-12-06 06:01:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:49,075 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-06 06:01:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111001928] [2022-12-06 06:01:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111001928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366015709] [2022-12-06 06:01:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:49,077 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:49,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 06:01:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:49,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:01:49,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:49,236 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-06 06:01:49,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:49,349 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-06 06:01:49,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366015709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:49,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:49,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767110080] [2022-12-06 06:01:49,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:49,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:49,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:49,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:01:49,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 138 transitions, 1526 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-06 06:01:49,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:49,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:01:49,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:55,719 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 [] [2022-12-06 06:01:57,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:01:57,147 INFO L130 PetriNetUnfolder]: 706/1215 cut-off events. [2022-12-06 06:01:57,147 INFO L131 PetriNetUnfolder]: For 6324/6324 co-relation queries the response was YES. [2022-12-06 06:01:57,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5231 conditions, 1215 events. 706/1215 cut-off events. For 6324/6324 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6418 event pairs, 43 based on Foata normal form. 14/1210 useless extension candidates. Maximal degree in co-relation 5194. Up to 676 conditions per place. [2022-12-06 06:01:57,153 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 128 selfloop transitions, 96 changer transitions 2/226 dead transitions. [2022-12-06 06:01:57,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 226 transitions, 2420 flow [2022-12-06 06:01:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:01:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:01:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-12-06 06:01:57,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-06 06:01:57,155 INFO L175 Difference]: Start difference. First operand has 80 places, 138 transitions, 1526 flow. Second operand 18 states and 117 transitions. [2022-12-06 06:01:57,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 226 transitions, 2420 flow [2022-12-06 06:01:57,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 2358 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-06 06:01:57,172 INFO L231 Difference]: Finished difference. Result has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:57,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2118, PETRI_PLACES=99, PETRI_TRANSITIONS=170} [2022-12-06 06:01:57,172 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 81 predicate places. [2022-12-06 06:01:57,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:57,172 INFO L89 Accepts]: Start accepts. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:57,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:57,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:57,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:57,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:57,190 INFO L130 PetriNetUnfolder]: 109/282 cut-off events. [2022-12-06 06:01:57,190 INFO L131 PetriNetUnfolder]: For 1381/1413 co-relation queries the response was YES. [2022-12-06 06:01:57,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 282 events. 109/282 cut-off events. For 1381/1413 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1601 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 1480. Up to 125 conditions per place. [2022-12-06 06:01:57,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 170 transitions, 2118 flow [2022-12-06 06:01:57,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 06:01:57,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (< v_~q~0_32 12) (= v_~q~0_31 (+ v_~q~0_32 1)) (= 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 [361] L705-6-->L695-5: Formula: (and (= v_~next~0_146 v_~cur~0_223) (= v_~q~0_59 (+ v_~q~0_60 1)) (= (* 2 v_~next~0_146) (+ (* 28657 v_~cur~0_224) (* 3 v_~prev~0_252) (* v_~prev~0_253 17711))) (< v_~q~0_60 12) (= (+ 26 v_~x~0_249) v_~x~0_248) (< v_~x~0_249 1) (= v_~j~0_123 (+ v_~j~0_124 v_~i~0_111)) (= v_~next~0_146 (+ (* 46368 v_~prev~0_253) v_~prev~0_252 (* 75025 v_~cur~0_224)))) InVars {~j~0=v_~j~0_124, ~prev~0=v_~prev~0_253, ~i~0=v_~i~0_111, ~q~0=v_~q~0_60, ~cur~0=v_~cur~0_224, ~x~0=v_~x~0_249} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_157|, ~j~0=v_~j~0_123, ~next~0=v_~next~0_146, ~prev~0=v_~prev~0_252, ~i~0=v_~i~0_111, ~q~0=v_~q~0_59, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_40|, ~cur~0=v_~cur~0_223, ~x~0=v_~x~0_248} 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-06 06:01:57,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (< v_~q~0_32 12) (= v_~q~0_31 (+ v_~q~0_32 1)) (= 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 [378] L705-6-->L695-5: Formula: (and (< v_~x~0_311 1) (= v_~j~0_205 (+ v_~j~0_207 (* 2 v_~i~0_175))) (= (+ 26 v_~x~0_311) v_~x~0_310) (= (+ (* 75025 v_~cur~0_279) (* 46368 v_~prev~0_313) v_~prev~0_312) v_~next~0_177) (< v_~q~0_127 11) (= (+ 2 v_~q~0_127) v_~q~0_125) (= (+ (* v_~prev~0_313 17711) (* 28657 v_~cur~0_279) (* 3 v_~prev~0_312)) (* 2 v_~next~0_177)) (= v_~next~0_177 v_~cur~0_278)) InVars {~j~0=v_~j~0_207, ~prev~0=v_~prev~0_313, ~i~0=v_~i~0_175, ~q~0=v_~q~0_127, ~cur~0=v_~cur~0_279, ~x~0=v_~x~0_311} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_193|, ~j~0=v_~j~0_205, ~next~0=v_~next~0_177, ~prev~0=v_~prev~0_312, ~i~0=v_~i~0_175, ~q~0=v_~q~0_125, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_88|, ~cur~0=v_~cur~0_278, ~x~0=v_~x~0_310} 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-06 06:01:57,770 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:01:57,771 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 599 [2022-12-06 06:01:57,771 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 170 transitions, 2154 flow [2022-12-06 06:01:57,771 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-06 06:01:57,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:57,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:57,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:57,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:57,975 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:57,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1361747698, now seen corresponding path program 1 times [2022-12-06 06:01:57,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:57,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487259234] [2022-12-06 06:01:57,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:57,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:58,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487259234] [2022-12-06 06:01:58,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487259234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:58,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779197538] [2022-12-06 06:01:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:58,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:58,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:58,120 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:58,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 06:01:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:58,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 06:01:58,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:58,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:01:58,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779197538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:58,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:58,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336547931] [2022-12-06 06:01:58,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:58,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:58,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:01:58,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 170 transitions, 2154 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-06 06:01:58,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:58,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:01:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:01:58,801 INFO L130 PetriNetUnfolder]: 874/1499 cut-off events. [2022-12-06 06:01:58,801 INFO L131 PetriNetUnfolder]: For 12514/12514 co-relation queries the response was YES. [2022-12-06 06:01:58,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1499 events. 874/1499 cut-off events. For 12514/12514 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8339 event pairs, 46 based on Foata normal form. 22/1502 useless extension candidates. Maximal degree in co-relation 7150. Up to 501 conditions per place. [2022-12-06 06:01:58,809 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 103 selfloop transitions, 152 changer transitions 0/255 dead transitions. [2022-12-06 06:01:58,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 255 transitions, 3262 flow [2022-12-06 06:01:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 06:01:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 06:01:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2022-12-06 06:01:58,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972222222222222 [2022-12-06 06:01:58,810 INFO L175 Difference]: Start difference. First operand has 99 places, 170 transitions, 2154 flow. Second operand 12 states and 107 transitions. [2022-12-06 06:01:58,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 255 transitions, 3262 flow [2022-12-06 06:01:58,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 255 transitions, 3132 flow, removed 36 selfloop flow, removed 8 redundant places. [2022-12-06 06:01:58,840 INFO L231 Difference]: Finished difference. Result has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:58,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2974, PETRI_PLACES=107, PETRI_TRANSITIONS=206} [2022-12-06 06:01:58,840 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 89 predicate places. [2022-12-06 06:01:58,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:01:58,840 INFO L89 Accepts]: Start accepts. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:58,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:01:58,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:01:58,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:58,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:58,867 INFO L130 PetriNetUnfolder]: 137/352 cut-off events. [2022-12-06 06:01:58,867 INFO L131 PetriNetUnfolder]: For 2696/2750 co-relation queries the response was YES. [2022-12-06 06:01:58,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 352 events. 137/352 cut-off events. For 2696/2750 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2140 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 2176. Up to 169 conditions per place. [2022-12-06 06:01:58,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 206 transitions, 2974 flow [2022-12-06 06:01:58,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-06 06:01:58,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:01:58,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 06:01:58,908 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 206 transitions, 2978 flow [2022-12-06 06:01:58,908 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-06 06:01:58,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:01:58,908 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:58,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 06:01:59,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:59,113 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:01:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:01:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1361689728, now seen corresponding path program 1 times [2022-12-06 06:01:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:01:59,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800542184] [2022-12-06 06:01:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:01:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:59,235 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-06 06:01:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:01:59,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800542184] [2022-12-06 06:01:59,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800542184] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:01:59,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780177566] [2022-12-06 06:01:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:01:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:01:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:01:59,239 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:01:59,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 06:01:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:01:59,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:01:59,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:01:59,385 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-06 06:01:59,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:01:59,525 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-06 06:01:59,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780177566] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:01:59,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:01:59,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:01:59,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483039534] [2022-12-06 06:01:59,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:01:59,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:01:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:01:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:01:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:01:59,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:01:59,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 206 transitions, 2978 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-06 06:01:59,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:01:59,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:01:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:08,022 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 [] [2022-12-06 06:02:10,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:02:10,358 INFO L130 PetriNetUnfolder]: 914/1579 cut-off events. [2022-12-06 06:02:10,359 INFO L131 PetriNetUnfolder]: For 20255/20255 co-relation queries the response was YES. [2022-12-06 06:02:10,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 1579 events. 914/1579 cut-off events. For 20255/20255 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8895 event pairs, 102 based on Foata normal form. 32/1586 useless extension candidates. Maximal degree in co-relation 8328. Up to 1020 conditions per place. [2022-12-06 06:02:10,371 INFO L137 encePairwiseOnDemand]: 8/31 looper letters, 155 selfloop transitions, 108 changer transitions 2/265 dead transitions. [2022-12-06 06:02:10,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 265 transitions, 3844 flow [2022-12-06 06:02:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 06:02:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 06:02:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-12-06 06:02:10,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2456575682382134 [2022-12-06 06:02:10,373 INFO L175 Difference]: Start difference. First operand has 107 places, 206 transitions, 2978 flow. Second operand 13 states and 99 transitions. [2022-12-06 06:02:10,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 265 transitions, 3844 flow [2022-12-06 06:02:10,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 265 transitions, 3743 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:10,431 INFO L231 Difference]: Finished difference. Result has 118 places, 222 transitions, 3473 flow [2022-12-06 06:02:10,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3473, PETRI_PLACES=118, PETRI_TRANSITIONS=222} [2022-12-06 06:02:10,431 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 100 predicate places. [2022-12-06 06:02:10,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:10,432 INFO L89 Accepts]: Start accepts. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 06:02:10,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:10,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:10,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 06:02:10,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 222 transitions, 3473 flow [2022-12-06 06:02:10,460 INFO L130 PetriNetUnfolder]: 147/382 cut-off events. [2022-12-06 06:02:10,461 INFO L131 PetriNetUnfolder]: For 3376/3468 co-relation queries the response was YES. [2022-12-06 06:02:10,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 382 events. 147/382 cut-off events. For 3376/3468 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2329 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 2522. Up to 183 conditions per place. [2022-12-06 06:02:10,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 222 transitions, 3473 flow [2022-12-06 06:02:10,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-06 06:02:10,599 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:02:10,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 06:02:10,600 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 222 transitions, 3485 flow [2022-12-06 06:02:10,601 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-06 06:02:10,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:10,601 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:10,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:10,806 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,SelfDestructingSolverStorable20 [2022-12-06 06:02:10,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash 549165112, now seen corresponding path program 1 times [2022-12-06 06:02:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:10,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627079601] [2022-12-06 06:02:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:10,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-06 06:02:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:10,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627079601] [2022-12-06 06:02:10,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627079601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:10,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036364084] [2022-12-06 06:02:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:10,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:10,918 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 06:02:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:10,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:02:10,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:11,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:02:11,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036364084] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:11,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:11,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:02:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622869227] [2022-12-06 06:02:11,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:02:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:02:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:02:11,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:02:11,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 222 transitions, 3485 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-06 06:02:11,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:11,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:02:11,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:19,299 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 37 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:02:31,362 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:02:33,488 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 [] [2022-12-06 06:02:35,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:02:41,604 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 [] [2022-12-06 06:02:45,673 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 [] [2022-12-06 06:02:45,824 INFO L130 PetriNetUnfolder]: 1032/1791 cut-off events. [2022-12-06 06:02:45,824 INFO L131 PetriNetUnfolder]: For 20723/20723 co-relation queries the response was YES. [2022-12-06 06:02:45,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 1791 events. 1032/1791 cut-off events. For 20723/20723 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 10501 event pairs, 86 based on Foata normal form. 20/1786 useless extension candidates. Maximal degree in co-relation 9859. Up to 1048 conditions per place. [2022-12-06 06:02:45,877 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 167 selfloop transitions, 150 changer transitions 3/320 dead transitions. [2022-12-06 06:02:45,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 320 transitions, 4900 flow [2022-12-06 06:02:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:02:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:02:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 118 transitions. [2022-12-06 06:02:45,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22348484848484848 [2022-12-06 06:02:45,878 INFO L175 Difference]: Start difference. First operand has 118 places, 222 transitions, 3485 flow. Second operand 16 states and 118 transitions. [2022-12-06 06:02:45,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 320 transitions, 4900 flow [2022-12-06 06:02:45,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 320 transitions, 4802 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:45,942 INFO L231 Difference]: Finished difference. Result has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:45,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4573, PETRI_PLACES=133, PETRI_TRANSITIONS=265} [2022-12-06 06:02:45,942 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 115 predicate places. [2022-12-06 06:02:45,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:45,942 INFO L89 Accepts]: Start accepts. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:45,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:45,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:45,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:45,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:45,982 INFO L130 PetriNetUnfolder]: 168/439 cut-off events. [2022-12-06 06:02:45,982 INFO L131 PetriNetUnfolder]: For 3976/4036 co-relation queries the response was YES. [2022-12-06 06:02:45,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 439 events. 168/439 cut-off events. For 3976/4036 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2852 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 3126. Up to 210 conditions per place. [2022-12-06 06:02:45,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:45,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-06 06:02:45,990 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:02:45,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:02:45,991 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 265 transitions, 4573 flow [2022-12-06 06:02:45,991 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-06 06:02:45,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:45,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:45,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:46,195 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,SelfDestructingSolverStorable21 [2022-12-06 06:02:46,196 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 550781917, now seen corresponding path program 1 times [2022-12-06 06:02:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:46,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530110404] [2022-12-06 06:02:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:46,292 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-06 06:02:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530110404] [2022-12-06 06:02:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530110404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877405027] [2022-12-06 06:02:46,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:46,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:46,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:46,294 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 06:02:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:46,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:02:46,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:46,447 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-06 06:02:46,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:46,536 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-06 06:02:46,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877405027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:46,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:46,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 06:02:46,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548084765] [2022-12-06 06:02:46,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:46,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 06:02:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:46,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 06:02:46,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-06 06:02:46,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:02:46,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 265 transitions, 4573 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-06 06:02:46,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:46,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:02:46,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:02:57,263 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 [] [2022-12-06 06:02:57,559 INFO L130 PetriNetUnfolder]: 1096/1919 cut-off events. [2022-12-06 06:02:57,559 INFO L131 PetriNetUnfolder]: For 25623/25623 co-relation queries the response was YES. [2022-12-06 06:02:57,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11429 conditions, 1919 events. 1096/1919 cut-off events. For 25623/25623 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 11559 event pairs, 112 based on Foata normal form. 22/1924 useless extension candidates. Maximal degree in co-relation 11375. Up to 1124 conditions per place. [2022-12-06 06:02:57,571 INFO L137 encePairwiseOnDemand]: 8/33 looper letters, 181 selfloop transitions, 162 changer transitions 1/344 dead transitions. [2022-12-06 06:02:57,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 344 transitions, 5907 flow [2022-12-06 06:02:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 06:02:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 06:02:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-12-06 06:02:57,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2159090909090909 [2022-12-06 06:02:57,572 INFO L175 Difference]: Start difference. First operand has 133 places, 265 transitions, 4573 flow. Second operand 16 states and 114 transitions. [2022-12-06 06:02:57,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 344 transitions, 5907 flow [2022-12-06 06:02:57,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 344 transitions, 5746 flow, removed 65 selfloop flow, removed 5 redundant places. [2022-12-06 06:02:57,643 INFO L231 Difference]: Finished difference. Result has 147 places, 295 transitions, 5490 flow [2022-12-06 06:02:57,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4432, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5490, PETRI_PLACES=147, PETRI_TRANSITIONS=295} [2022-12-06 06:02:57,643 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 129 predicate places. [2022-12-06 06:02:57,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:02:57,643 INFO L89 Accepts]: Start accepts. Operand has 147 places, 295 transitions, 5490 flow [2022-12-06 06:02:57,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:02:57,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:02:57,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 295 transitions, 5490 flow [2022-12-06 06:02:57,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 295 transitions, 5490 flow [2022-12-06 06:02:57,683 INFO L130 PetriNetUnfolder]: 185/486 cut-off events. [2022-12-06 06:02:57,683 INFO L131 PetriNetUnfolder]: For 5239/5337 co-relation queries the response was YES. [2022-12-06 06:02:57,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3714 conditions, 486 events. 185/486 cut-off events. For 5239/5337 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3237 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 3659. Up to 236 conditions per place. [2022-12-06 06:02:57,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 295 transitions, 5490 flow [2022-12-06 06:02:57,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 910 [2022-12-06 06:02:57,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:02:57,722 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 06:02:57,722 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 295 transitions, 5497 flow [2022-12-06 06:02:57,722 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-06 06:02:57,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:02:57,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:02:57,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 06:02:57,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:57,927 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:02:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:02:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 737847334, now seen corresponding path program 1 times [2022-12-06 06:02:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:02:57,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090763596] [2022-12-06 06:02:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:02:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:58,040 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-06 06:02:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:02:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090763596] [2022-12-06 06:02:58,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090763596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:02:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616599901] [2022-12-06 06:02:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:02:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:02:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:02:58,042 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:02:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 06:02:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:02:58,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:02:58,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:02:58,199 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-06 06:02:58,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:02:58,311 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-06 06:02:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616599901] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:02:58,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:02:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:02:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372992941] [2022-12-06 06:02:58,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:02:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:02:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:02:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:02:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:02:58,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:02:58,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 295 transitions, 5497 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-06 06:02:58,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:02:58,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:02:58,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:03,579 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 [] [2022-12-06 06:03:04,210 INFO L130 PetriNetUnfolder]: 1384/2419 cut-off events. [2022-12-06 06:03:04,211 INFO L131 PetriNetUnfolder]: For 56668/56668 co-relation queries the response was YES. [2022-12-06 06:03:04,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 2419 events. 1384/2419 cut-off events. For 56668/56668 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 15081 event pairs, 109 based on Foata normal form. 60/2462 useless extension candidates. Maximal degree in co-relation 15143. Up to 1059 conditions per place. [2022-12-06 06:03:04,226 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 190 selfloop transitions, 249 changer transitions 0/439 dead transitions. [2022-12-06 06:03:04,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 439 transitions, 8088 flow [2022-12-06 06:03:04,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:03:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:03:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 142 transitions. [2022-12-06 06:03:04,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23202614379084968 [2022-12-06 06:03:04,228 INFO L175 Difference]: Start difference. First operand has 147 places, 295 transitions, 5497 flow. Second operand 18 states and 142 transitions. [2022-12-06 06:03:04,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 439 transitions, 8088 flow [2022-12-06 06:03:04,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 439 transitions, 7930 flow, removed 48 selfloop flow, removed 5 redundant places. [2022-12-06 06:03:04,337 INFO L231 Difference]: Finished difference. Result has 169 places, 375 transitions, 7682 flow [2022-12-06 06:03:04,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5343, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7682, PETRI_PLACES=169, PETRI_TRANSITIONS=375} [2022-12-06 06:03:04,337 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 151 predicate places. [2022-12-06 06:03:04,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:04,337 INFO L89 Accepts]: Start accepts. Operand has 169 places, 375 transitions, 7682 flow [2022-12-06 06:03:04,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:04,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:04,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 375 transitions, 7682 flow [2022-12-06 06:03:04,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 375 transitions, 7682 flow [2022-12-06 06:03:04,410 INFO L130 PetriNetUnfolder]: 229/599 cut-off events. [2022-12-06 06:03:04,410 INFO L131 PetriNetUnfolder]: For 9946/10028 co-relation queries the response was YES. [2022-12-06 06:03:04,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5162 conditions, 599 events. 229/599 cut-off events. For 9946/10028 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4106 event pairs, 0 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 5096. Up to 309 conditions per place. [2022-12-06 06:03:04,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 375 transitions, 7682 flow [2022-12-06 06:03:04,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 1144 [2022-12-06 06:03:04,417 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:03:04,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 06:03:04,417 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 375 transitions, 7682 flow [2022-12-06 06:03:04,418 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-06 06:03:04,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:04,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:04,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:04,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:04,623 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash 739813540, now seen corresponding path program 1 times [2022-12-06 06:03:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:04,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673307498] [2022-12-06 06:03:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:04,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:04,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673307498] [2022-12-06 06:03:04,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673307498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:04,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000047352] [2022-12-06 06:03:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:04,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:04,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:04,728 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:04,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 06:03:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:04,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:03:04,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:04,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:05,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000047352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:05,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:05,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:05,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733683389] [2022-12-06 06:03:05,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:05,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:05,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:05,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:03:05,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 375 transitions, 7682 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-06 06:03:05,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:05,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:03:05,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:16,082 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 [] [2022-12-06 06:03:18,158 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 [] [2022-12-06 06:03:19,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:03:19,871 INFO L130 PetriNetUnfolder]: 1452/2557 cut-off events. [2022-12-06 06:03:19,871 INFO L131 PetriNetUnfolder]: For 59492/59492 co-relation queries the response was YES. [2022-12-06 06:03:19,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17481 conditions, 2557 events. 1452/2557 cut-off events. For 59492/59492 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 16228 event pairs, 189 based on Foata normal form. 30/2570 useless extension candidates. Maximal degree in co-relation 17412. Up to 1685 conditions per place. [2022-12-06 06:03:19,888 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 262 selfloop transitions, 190 changer transitions 0/452 dead transitions. [2022-12-06 06:03:19,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 452 transitions, 9378 flow [2022-12-06 06:03:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 06:03:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 06:03:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2022-12-06 06:03:19,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22899159663865545 [2022-12-06 06:03:19,889 INFO L175 Difference]: Start difference. First operand has 169 places, 375 transitions, 7682 flow. Second operand 14 states and 109 transitions. [2022-12-06 06:03:19,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 452 transitions, 9378 flow [2022-12-06 06:03:20,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 452 transitions, 9044 flow, removed 150 selfloop flow, removed 3 redundant places. [2022-12-06 06:03:20,094 INFO L231 Difference]: Finished difference. Result has 184 places, 407 transitions, 8695 flow [2022-12-06 06:03:20,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7352, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8695, PETRI_PLACES=184, PETRI_TRANSITIONS=407} [2022-12-06 06:03:20,095 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 166 predicate places. [2022-12-06 06:03:20,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:20,095 INFO L89 Accepts]: Start accepts. Operand has 184 places, 407 transitions, 8695 flow [2022-12-06 06:03:20,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:20,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:20,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 407 transitions, 8695 flow [2022-12-06 06:03:20,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 407 transitions, 8695 flow [2022-12-06 06:03:20,196 INFO L130 PetriNetUnfolder]: 249/654 cut-off events. [2022-12-06 06:03:20,197 INFO L131 PetriNetUnfolder]: For 11818/11944 co-relation queries the response was YES. [2022-12-06 06:03:20,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 654 events. 249/654 cut-off events. For 11818/11944 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4573 event pairs, 0 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 5723. Up to 330 conditions per place. [2022-12-06 06:03:20,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 407 transitions, 8695 flow [2022-12-06 06:03:20,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 1214 [2022-12-06 06:03:20,204 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:03:20,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 06:03:20,205 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 407 transitions, 8695 flow [2022-12-06 06:03:20,205 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-06 06:03:20,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:20,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:20,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:20,409 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,SelfDestructingSolverStorable24 [2022-12-06 06:03:20,410 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -114815472, now seen corresponding path program 1 times [2022-12-06 06:03:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:20,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805301713] [2022-12-06 06:03:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:20,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805301713] [2022-12-06 06:03:20,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805301713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:20,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437407285] [2022-12-06 06:03:20,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:20,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:20,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:20,516 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:20,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 06:03:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:20,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:03:20,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:20,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:20,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437407285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:20,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:20,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811941324] [2022-12-06 06:03:20,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:20,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:20,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:20,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 06:03:20,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 407 transitions, 8695 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-06 06:03:20,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:20,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 06:03:20,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:24,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:03:26,537 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 [] [2022-12-06 06:03:28,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:03:29,175 INFO L130 PetriNetUnfolder]: 1700/2997 cut-off events. [2022-12-06 06:03:29,175 INFO L131 PetriNetUnfolder]: For 87425/87425 co-relation queries the response was YES. [2022-12-06 06:03:29,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20811 conditions, 2997 events. 1700/2997 cut-off events. For 87425/87425 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 19618 event pairs, 174 based on Foata normal form. 34/3014 useless extension candidates. Maximal degree in co-relation 20736. Up to 1589 conditions per place. [2022-12-06 06:03:29,195 INFO L137 encePairwiseOnDemand]: 9/34 looper letters, 288 selfloop transitions, 268 changer transitions 0/556 dead transitions. [2022-12-06 06:03:29,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 556 transitions, 11374 flow [2022-12-06 06:03:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:03:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:03:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 161 transitions. [2022-12-06 06:03:29,197 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22549019607843138 [2022-12-06 06:03:29,197 INFO L175 Difference]: Start difference. First operand has 184 places, 407 transitions, 8695 flow. Second operand 21 states and 161 transitions. [2022-12-06 06:03:29,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 556 transitions, 11374 flow [2022-12-06 06:03:29,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 556 transitions, 11147 flow, removed 49 selfloop flow, removed 8 redundant places. [2022-12-06 06:03:29,413 INFO L231 Difference]: Finished difference. Result has 204 places, 478 transitions, 10589 flow [2022-12-06 06:03:29,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8472, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=10589, PETRI_PLACES=204, PETRI_TRANSITIONS=478} [2022-12-06 06:03:29,414 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 186 predicate places. [2022-12-06 06:03:29,414 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:29,414 INFO L89 Accepts]: Start accepts. Operand has 204 places, 478 transitions, 10589 flow [2022-12-06 06:03:29,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:29,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:29,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 478 transitions, 10589 flow [2022-12-06 06:03:29,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 478 transitions, 10589 flow [2022-12-06 06:03:29,525 INFO L130 PetriNetUnfolder]: 290/760 cut-off events. [2022-12-06 06:03:29,525 INFO L131 PetriNetUnfolder]: For 16110/16239 co-relation queries the response was YES. [2022-12-06 06:03:29,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 760 events. 290/760 cut-off events. For 16110/16239 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 5587 event pairs, 0 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 6968. Up to 395 conditions per place. [2022-12-06 06:03:29,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 478 transitions, 10589 flow [2022-12-06 06:03:29,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 1418 [2022-12-06 06:03:29,600 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:03:29,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 06:03:29,600 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 478 transitions, 10612 flow [2022-12-06 06:03:29,600 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-06 06:03:29,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:29,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:29,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:29,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 06:03:29,805 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2115555804, now seen corresponding path program 1 times [2022-12-06 06:03:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:29,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762895799] [2022-12-06 06:03:29,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:29,919 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-06 06:03:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:29,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762895799] [2022-12-06 06:03:29,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762895799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:29,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641792364] [2022-12-06 06:03:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:29,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:29,921 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:29,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 06:03:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:29,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:03:29,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:30,097 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-06 06:03:30,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:30,208 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-06 06:03:30,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641792364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:30,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:30,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739968720] [2022-12-06 06:03:30,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:30,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:30,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 06:03:30,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 478 transitions, 10612 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-06 06:03:30,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:30,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 06:03:30,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:31,300 INFO L130 PetriNetUnfolder]: 1954/3417 cut-off events. [2022-12-06 06:03:31,300 INFO L131 PetriNetUnfolder]: For 118303/118303 co-relation queries the response was YES. [2022-12-06 06:03:31,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25356 conditions, 3417 events. 1954/3417 cut-off events. For 118303/118303 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 22721 event pairs, 155 based on Foata normal form. 30/3430 useless extension candidates. Maximal degree in co-relation 25274. Up to 1389 conditions per place. [2022-12-06 06:03:31,327 INFO L137 encePairwiseOnDemand]: 9/36 looper letters, 256 selfloop transitions, 341 changer transitions 0/597 dead transitions. [2022-12-06 06:03:31,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 597 transitions, 13308 flow [2022-12-06 06:03:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 06:03:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 06:03:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 143 transitions. [2022-12-06 06:03:31,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26481481481481484 [2022-12-06 06:03:31,333 INFO L175 Difference]: Start difference. First operand has 204 places, 478 transitions, 10612 flow. Second operand 15 states and 143 transitions. [2022-12-06 06:03:31,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 597 transitions, 13308 flow [2022-12-06 06:03:31,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 597 transitions, 12985 flow, removed 141 selfloop flow, removed 4 redundant places. [2022-12-06 06:03:31,702 INFO L231 Difference]: Finished difference. Result has 218 places, 526 transitions, 12401 flow [2022-12-06 06:03:31,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=10347, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12401, PETRI_PLACES=218, PETRI_TRANSITIONS=526} [2022-12-06 06:03:31,703 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 200 predicate places. [2022-12-06 06:03:31,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:31,703 INFO L89 Accepts]: Start accepts. Operand has 218 places, 526 transitions, 12401 flow [2022-12-06 06:03:31,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:31,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:31,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 526 transitions, 12401 flow [2022-12-06 06:03:31,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 526 transitions, 12401 flow [2022-12-06 06:03:31,841 INFO L130 PetriNetUnfolder]: 323/843 cut-off events. [2022-12-06 06:03:31,842 INFO L131 PetriNetUnfolder]: For 20818/20944 co-relation queries the response was YES. [2022-12-06 06:03:31,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8323 conditions, 843 events. 323/843 cut-off events. For 20818/20944 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 6303 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 8240. Up to 454 conditions per place. [2022-12-06 06:03:31,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 526 transitions, 12401 flow [2022-12-06 06:03:31,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 1606 [2022-12-06 06:03:31,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:03:31,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 06:03:31,895 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 526 transitions, 12402 flow [2022-12-06 06:03:31,895 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-06 06:03:31,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:31,895 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:31,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-06 06:03:32,100 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,SelfDestructingSolverStorable26 [2022-12-06 06:03:32,100 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -103732662, now seen corresponding path program 1 times [2022-12-06 06:03:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:32,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084850395] [2022-12-06 06:03:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:32,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084850395] [2022-12-06 06:03:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084850395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920984306] [2022-12-06 06:03:32,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:32,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:32,215 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:32,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 06:03:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:32,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:03:32,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:32,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920984306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:32,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:32,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:03:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127409227] [2022-12-06 06:03:32,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:03:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:03:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:03:32,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 06:03:32,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 526 transitions, 12402 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-06 06:03:32,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:32,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 06:03:32,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:03:40,797 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 36 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:03:43,179 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 [] [2022-12-06 06:03:45,334 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 [] [2022-12-06 06:03:53,537 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:03:54,245 INFO L130 PetriNetUnfolder]: 2232/3901 cut-off events. [2022-12-06 06:03:54,245 INFO L131 PetriNetUnfolder]: For 153644/153644 co-relation queries the response was YES. [2022-12-06 06:03:54,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30481 conditions, 3901 events. 2232/3901 cut-off events. For 153644/153644 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 26577 event pairs, 196 based on Foata normal form. 32/3916 useless extension candidates. Maximal degree in co-relation 30395. Up to 2095 conditions per place. [2022-12-06 06:03:54,301 INFO L137 encePairwiseOnDemand]: 9/37 looper letters, 355 selfloop transitions, 342 changer transitions 2/699 dead transitions. [2022-12-06 06:03:54,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 699 transitions, 16057 flow [2022-12-06 06:03:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:03:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:03:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 184 transitions. [2022-12-06 06:03:54,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19126819126819128 [2022-12-06 06:03:54,304 INFO L175 Difference]: Start difference. First operand has 218 places, 526 transitions, 12402 flow. Second operand 26 states and 184 transitions. [2022-12-06 06:03:54,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 699 transitions, 16057 flow [2022-12-06 06:03:54,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 699 transitions, 15803 flow, removed 76 selfloop flow, removed 6 redundant places. [2022-12-06 06:03:54,997 INFO L231 Difference]: Finished difference. Result has 247 places, 610 transitions, 15238 flow [2022-12-06 06:03:54,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12186, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=15238, PETRI_PLACES=247, PETRI_TRANSITIONS=610} [2022-12-06 06:03:55,002 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 229 predicate places. [2022-12-06 06:03:55,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:03:55,002 INFO L89 Accepts]: Start accepts. Operand has 247 places, 610 transitions, 15238 flow [2022-12-06 06:03:55,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:03:55,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:03:55,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 610 transitions, 15238 flow [2022-12-06 06:03:55,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 610 transitions, 15238 flow [2022-12-06 06:03:55,183 INFO L130 PetriNetUnfolder]: 373/966 cut-off events. [2022-12-06 06:03:55,183 INFO L131 PetriNetUnfolder]: For 27486/27586 co-relation queries the response was YES. [2022-12-06 06:03:55,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10142 conditions, 966 events. 373/966 cut-off events. For 27486/27586 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 7449 event pairs, 0 based on Foata normal form. 0/963 useless extension candidates. Maximal degree in co-relation 10050. Up to 540 conditions per place. [2022-12-06 06:03:55,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 610 transitions, 15238 flow [2022-12-06 06:03:55,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 1834 [2022-12-06 06:03:55,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:03:55,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-06 06:03:55,262 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 610 transitions, 15251 flow [2022-12-06 06:03:55,262 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-06 06:03:55,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:03:55,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:03:55,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 06:03:55,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 06:03:55,468 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:03:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:03:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1159746353, now seen corresponding path program 1 times [2022-12-06 06:03:55,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:03:55,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252606239] [2022-12-06 06:03:55,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:03:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:03:55,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252606239] [2022-12-06 06:03:55,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252606239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:03:55,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824628608] [2022-12-06 06:03:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:03:55,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:03:55,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:03:55,588 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:03:55,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 06:03:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:03:55,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:03:55,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:03:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:55,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:03:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:03:55,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824628608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:03:55,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:03:55,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:03:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444071280] [2022-12-06 06:03:55,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:03:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:03:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:03:55,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:03:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:03:55,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 06:03:55,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 610 transitions, 15251 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:03:55,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:03:55,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 06:03:55,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:01,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:03,077 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 [] [2022-12-06 06:04:05,088 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 [] [2022-12-06 06:04:05,907 INFO L130 PetriNetUnfolder]: 2490/4343 cut-off events. [2022-12-06 06:04:05,908 INFO L131 PetriNetUnfolder]: For 238711/238711 co-relation queries the response was YES. [2022-12-06 06:04:05,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36162 conditions, 4343 events. 2490/4343 cut-off events. For 238711/238711 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 29799 event pairs, 300 based on Foata normal form. 62/4388 useless extension candidates. Maximal degree in co-relation 36067. Up to 2210 conditions per place. [2022-12-06 06:04:05,953 INFO L137 encePairwiseOnDemand]: 9/38 looper letters, 392 selfloop transitions, 368 changer transitions 0/760 dead transitions. [2022-12-06 06:04:05,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 760 transitions, 19031 flow [2022-12-06 06:04:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:04:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:04:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 175 transitions. [2022-12-06 06:04:05,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21929824561403508 [2022-12-06 06:04:05,963 INFO L175 Difference]: Start difference. First operand has 247 places, 610 transitions, 15251 flow. Second operand 21 states and 175 transitions. [2022-12-06 06:04:05,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 760 transitions, 19031 flow [2022-12-06 06:04:06,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 760 transitions, 18413 flow, removed 223 selfloop flow, removed 12 redundant places. [2022-12-06 06:04:06,814 INFO L231 Difference]: Finished difference. Result has 264 places, 674 transitions, 17523 flow [2022-12-06 06:04:06,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14645, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=17523, PETRI_PLACES=264, PETRI_TRANSITIONS=674} [2022-12-06 06:04:06,815 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 246 predicate places. [2022-12-06 06:04:06,815 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:06,815 INFO L89 Accepts]: Start accepts. Operand has 264 places, 674 transitions, 17523 flow [2022-12-06 06:04:06,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:06,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:06,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 674 transitions, 17523 flow [2022-12-06 06:04:06,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 674 transitions, 17523 flow [2022-12-06 06:04:06,971 INFO L130 PetriNetUnfolder]: 410/1061 cut-off events. [2022-12-06 06:04:06,971 INFO L131 PetriNetUnfolder]: For 40869/40969 co-relation queries the response was YES. [2022-12-06 06:04:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11759 conditions, 1061 events. 410/1061 cut-off events. For 40869/40969 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 8247 event pairs, 0 based on Foata normal form. 0/1057 useless extension candidates. Maximal degree in co-relation 11660. Up to 600 conditions per place. [2022-12-06 06:04:06,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 674 transitions, 17523 flow [2022-12-06 06:04:06,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 2040 [2022-12-06 06:04:06,988 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:04:06,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 06:04:06,989 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 674 transitions, 17523 flow [2022-12-06 06:04:06,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:06,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:06,989 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:06,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 06:04:07,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 06:04:07,194 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -599424657, now seen corresponding path program 1 times [2022-12-06 06:04:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:07,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93523062] [2022-12-06 06:04:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:07,359 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-06 06:04:07,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:07,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93523062] [2022-12-06 06:04:07,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93523062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:07,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662945739] [2022-12-06 06:04:07,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:07,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:07,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:07,372 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:07,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 06:04:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:07,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:04:07,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:07,583 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-06 06:04:07,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:07,756 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-06 06:04:07,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662945739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:07,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:07,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:04:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467661719] [2022-12-06 06:04:07,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:07,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:04:07,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:04:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:04:07,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 06:04:07,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 674 transitions, 17523 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:07,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:07,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 06:04:07,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:09,676 INFO L130 PetriNetUnfolder]: 2928/5083 cut-off events. [2022-12-06 06:04:09,677 INFO L131 PetriNetUnfolder]: For 264547/264547 co-relation queries the response was YES. [2022-12-06 06:04:09,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44413 conditions, 5083 events. 2928/5083 cut-off events. For 264547/264547 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 35901 event pairs, 231 based on Foata normal form. 24/5082 useless extension candidates. Maximal degree in co-relation 44311. Up to 2039 conditions per place. [2022-12-06 06:04:09,779 INFO L137 encePairwiseOnDemand]: 8/38 looper letters, 324 selfloop transitions, 554 changer transitions 2/880 dead transitions. [2022-12-06 06:04:09,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 880 transitions, 22875 flow [2022-12-06 06:04:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 06:04:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 06:04:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 179 transitions. [2022-12-06 06:04:09,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21411483253588517 [2022-12-06 06:04:09,787 INFO L175 Difference]: Start difference. First operand has 264 places, 674 transitions, 17523 flow. Second operand 22 states and 179 transitions. [2022-12-06 06:04:09,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 880 transitions, 22875 flow [2022-12-06 06:04:11,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 880 transitions, 21721 flow, removed 500 selfloop flow, removed 9 redundant places. [2022-12-06 06:04:11,465 INFO L231 Difference]: Finished difference. Result has 284 places, 790 transitions, 21400 flow [2022-12-06 06:04:11,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=16481, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=452, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21400, PETRI_PLACES=284, PETRI_TRANSITIONS=790} [2022-12-06 06:04:11,466 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 266 predicate places. [2022-12-06 06:04:11,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:11,467 INFO L89 Accepts]: Start accepts. Operand has 284 places, 790 transitions, 21400 flow [2022-12-06 06:04:11,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:11,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:11,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 790 transitions, 21400 flow [2022-12-06 06:04:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 790 transitions, 21400 flow [2022-12-06 06:04:11,781 INFO L130 PetriNetUnfolder]: 479/1240 cut-off events. [2022-12-06 06:04:11,781 INFO L131 PetriNetUnfolder]: For 51469/51544 co-relation queries the response was YES. [2022-12-06 06:04:11,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14311 conditions, 1240 events. 479/1240 cut-off events. For 51469/51544 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 10108 event pairs, 0 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 14207. Up to 676 conditions per place. [2022-12-06 06:04:11,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 790 transitions, 21400 flow [2022-12-06 06:04:11,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 2386 [2022-12-06 06:04:11,990 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:04:11,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 525 [2022-12-06 06:04:11,991 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 790 transitions, 21413 flow [2022-12-06 06:04:11,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:11,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:11,992 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:12,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 06:04:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:12,195 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash -597859281, now seen corresponding path program 2 times [2022-12-06 06:04:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:12,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863166845] [2022-12-06 06:04:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:12,302 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-06 06:04:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:12,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863166845] [2022-12-06 06:04:12,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863166845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:12,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346557608] [2022-12-06 06:04:12,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:04:12,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:12,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:12,315 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:12,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 06:04:12,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:04:12,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:04:12,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 06:04:12,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:12,514 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-06 06:04:12,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:12,645 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-06 06:04:12,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346557608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:12,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:12,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:04:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466120704] [2022-12-06 06:04:12,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:12,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:04:12,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:12,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:04:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:04:12,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 06:04:12,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 790 transitions, 21413 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:12,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:12,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 06:04:12,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:04:17,094 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 [] [2022-12-06 06:04:21,305 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 [] [2022-12-06 06:04:23,335 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 [] [2022-12-06 06:04:27,764 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 [] [2022-12-06 06:04:29,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:33,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:36,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:38,120 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 [] [2022-12-06 06:04:42,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:44,614 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 [] [2022-12-06 06:04:46,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:48,355 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 [] [2022-12-06 06:04:50,360 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 [] [2022-12-06 06:04:52,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:04:53,661 INFO L130 PetriNetUnfolder]: 3166/5539 cut-off events. [2022-12-06 06:04:53,661 INFO L131 PetriNetUnfolder]: For 308896/308896 co-relation queries the response was YES. [2022-12-06 06:04:53,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49544 conditions, 5539 events. 3166/5539 cut-off events. For 308896/308896 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 40070 event pairs, 271 based on Foata normal form. 48/5552 useless extension candidates. Maximal degree in co-relation 49437. Up to 3239 conditions per place. [2022-12-06 06:04:53,718 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 512 selfloop transitions, 488 changer transitions 3/1003 dead transitions. [2022-12-06 06:04:53,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1003 transitions, 26967 flow [2022-12-06 06:04:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 06:04:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 06:04:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 212 transitions. [2022-12-06 06:04:53,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16282642089093702 [2022-12-06 06:04:53,719 INFO L175 Difference]: Start difference. First operand has 284 places, 790 transitions, 21413 flow. Second operand 31 states and 212 transitions. [2022-12-06 06:04:53,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1003 transitions, 26967 flow [2022-12-06 06:04:55,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1003 transitions, 26476 flow, removed 185 selfloop flow, removed 8 redundant places. [2022-12-06 06:04:55,139 INFO L231 Difference]: Finished difference. Result has 317 places, 900 transitions, 25942 flow [2022-12-06 06:04:55,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=21023, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=394, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=25942, PETRI_PLACES=317, PETRI_TRANSITIONS=900} [2022-12-06 06:04:55,140 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 299 predicate places. [2022-12-06 06:04:55,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:04:55,140 INFO L89 Accepts]: Start accepts. Operand has 317 places, 900 transitions, 25942 flow [2022-12-06 06:04:55,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:04:55,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:04:55,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 900 transitions, 25942 flow [2022-12-06 06:04:55,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 900 transitions, 25942 flow [2022-12-06 06:04:55,429 INFO L130 PetriNetUnfolder]: 537/1391 cut-off events. [2022-12-06 06:04:55,429 INFO L131 PetriNetUnfolder]: For 60920/60996 co-relation queries the response was YES. [2022-12-06 06:04:55,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 1391 events. 537/1391 cut-off events. For 60920/60996 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 11676 event pairs, 0 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 16702. Up to 770 conditions per place. [2022-12-06 06:04:55,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 900 transitions, 25942 flow [2022-12-06 06:04:55,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 2616 [2022-12-06 06:04:55,453 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:04:55,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-06 06:04:55,453 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 900 transitions, 25942 flow [2022-12-06 06:04:55,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:04:55,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:04:55,454 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:04:55,461 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-06 06:04:55,658 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,SelfDestructingSolverStorable30 [2022-12-06 06:04:55,659 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:04:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:04:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 751769341, now seen corresponding path program 1 times [2022-12-06 06:04:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:04:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690250788] [2022-12-06 06:04:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:04:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:55,751 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-06 06:04:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:04:55,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690250788] [2022-12-06 06:04:55,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690250788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:04:55,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651627535] [2022-12-06 06:04:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:04:55,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:04:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:04:55,753 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:04:55,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 06:04:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:04:55,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:04:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:04:55,947 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-06 06:04:55,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:04:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:04:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651627535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:04:56,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:04:56,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:04:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129539259] [2022-12-06 06:04:56,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:04:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:04:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:04:56,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:04:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:04:56,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 06:04:56,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 900 transitions, 25942 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-06 06:04:56,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:04:56,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 06:04:56,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:17,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:19,302 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 [] [2022-12-06 06:05:21,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:23,035 INFO L130 PetriNetUnfolder]: 3316/5833 cut-off events. [2022-12-06 06:05:23,036 INFO L131 PetriNetUnfolder]: For 355132/355132 co-relation queries the response was YES. [2022-12-06 06:05:23,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53653 conditions, 5833 events. 3316/5833 cut-off events. For 355132/355132 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 43001 event pairs, 464 based on Foata normal form. 52/5850 useless extension candidates. Maximal degree in co-relation 53536. Up to 3946 conditions per place. [2022-12-06 06:05:23,100 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 616 selfloop transitions, 417 changer transitions 1/1034 dead transitions. [2022-12-06 06:05:23,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1034 transitions, 30248 flow [2022-12-06 06:05:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 06:05:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 06:05:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 146 transitions. [2022-12-06 06:05:23,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18295739348370926 [2022-12-06 06:05:23,102 INFO L175 Difference]: Start difference. First operand has 317 places, 900 transitions, 25942 flow. Second operand 19 states and 146 transitions. [2022-12-06 06:05:23,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1034 transitions, 30248 flow [2022-12-06 06:05:25,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 1034 transitions, 29303 flow, removed 426 selfloop flow, removed 10 redundant places. [2022-12-06 06:05:25,784 INFO L231 Difference]: Finished difference. Result has 333 places, 971 transitions, 28510 flow [2022-12-06 06:05:25,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=25029, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=28510, PETRI_PLACES=333, PETRI_TRANSITIONS=971} [2022-12-06 06:05:25,787 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 315 predicate places. [2022-12-06 06:05:25,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:25,787 INFO L89 Accepts]: Start accepts. Operand has 333 places, 971 transitions, 28510 flow [2022-12-06 06:05:25,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:25,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:25,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 333 places, 971 transitions, 28510 flow [2022-12-06 06:05:25,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 333 places, 971 transitions, 28510 flow [2022-12-06 06:05:26,252 INFO L130 PetriNetUnfolder]: 571/1484 cut-off events. [2022-12-06 06:05:26,253 INFO L131 PetriNetUnfolder]: For 60503/60595 co-relation queries the response was YES. [2022-12-06 06:05:26,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18133 conditions, 1484 events. 571/1484 cut-off events. For 60503/60595 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 12530 event pairs, 0 based on Foata normal form. 0/1478 useless extension candidates. Maximal degree in co-relation 18011. Up to 811 conditions per place. [2022-12-06 06:05:26,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 333 places, 971 transitions, 28510 flow [2022-12-06 06:05:26,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 2784 [2022-12-06 06:05:26,351 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:05:26,352 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 565 [2022-12-06 06:05:26,352 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 971 transitions, 28521 flow [2022-12-06 06:05:26,352 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-06 06:05:26,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:26,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:26,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-06 06:05:26,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:26,557 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:05:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash -89492564, now seen corresponding path program 1 times [2022-12-06 06:05:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:26,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680813018] [2022-12-06 06:05:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:26,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680813018] [2022-12-06 06:05:26,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680813018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:26,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639822068] [2022-12-06 06:05:26,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:26,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:26,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:26,780 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:05:26,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 06:05:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:26,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 06:05:26,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:27,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:27,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:27,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639822068] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:27,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:27,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:05:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832097131] [2022-12-06 06:05:27,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:05:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:05:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:05:27,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 06:05:27,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 971 transitions, 28521 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-06 06:05:27,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:27,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 06:05:27,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:31,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:33,885 INFO L130 PetriNetUnfolder]: 3564/6273 cut-off events. [2022-12-06 06:05:33,885 INFO L131 PetriNetUnfolder]: For 353628/353628 co-relation queries the response was YES. [2022-12-06 06:05:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59556 conditions, 6273 events. 3564/6273 cut-off events. For 353628/353628 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 46893 event pairs, 472 based on Foata normal form. 28/6266 useless extension candidates. Maximal degree in co-relation 59431. Up to 3963 conditions per place. [2022-12-06 06:05:33,964 INFO L137 encePairwiseOnDemand]: 9/43 looper letters, 621 selfloop transitions, 494 changer transitions 0/1115 dead transitions. [2022-12-06 06:05:33,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1115 transitions, 33639 flow [2022-12-06 06:05:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:05:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:05:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 159 transitions. [2022-12-06 06:05:33,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1760797342192691 [2022-12-06 06:05:33,966 INFO L175 Difference]: Start difference. First operand has 333 places, 971 transitions, 28521 flow. Second operand 21 states and 159 transitions. [2022-12-06 06:05:33,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1115 transitions, 33639 flow [2022-12-06 06:05:36,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1115 transitions, 32913 flow, removed 352 selfloop flow, removed 2 redundant places. [2022-12-06 06:05:36,574 INFO L231 Difference]: Finished difference. Result has 359 places, 1046 transitions, 31915 flow [2022-12-06 06:05:36,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=27895, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=971, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=431, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=31915, PETRI_PLACES=359, PETRI_TRANSITIONS=1046} [2022-12-06 06:05:36,576 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 341 predicate places. [2022-12-06 06:05:36,576 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:36,576 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1046 transitions, 31915 flow [2022-12-06 06:05:36,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:36,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:36,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1046 transitions, 31915 flow [2022-12-06 06:05:36,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 359 places, 1046 transitions, 31915 flow [2022-12-06 06:05:36,994 INFO L130 PetriNetUnfolder]: 614/1596 cut-off events. [2022-12-06 06:05:36,994 INFO L131 PetriNetUnfolder]: For 74631/74737 co-relation queries the response was YES. [2022-12-06 06:05:37,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20337 conditions, 1596 events. 614/1596 cut-off events. For 74631/74737 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 13735 event pairs, 0 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 20206. Up to 850 conditions per place. [2022-12-06 06:05:37,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 1046 transitions, 31915 flow [2022-12-06 06:05:37,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 2976 [2022-12-06 06:05:37,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:05:37,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 487 [2022-12-06 06:05:37,063 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1046 transitions, 31922 flow [2022-12-06 06:05:37,064 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-06 06:05:37,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:37,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:37,069 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-06 06:05:37,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:37,269 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:05:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash -88956884, now seen corresponding path program 2 times [2022-12-06 06:05:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:37,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380052673] [2022-12-06 06:05:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:37,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-06 06:05:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:37,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380052673] [2022-12-06 06:05:37,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380052673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:37,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955092594] [2022-12-06 06:05:37,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 06:05:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:37,364 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:05:37,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 06:05:37,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 06:05:37,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 06:05:37,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 06:05:37,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:05:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:37,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:05:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:37,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955092594] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:05:37,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:05:37,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:05:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678309950] [2022-12-06 06:05:37,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:05:37,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:05:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:05:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:05:37,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:05:37,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 06:05:37,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1046 transitions, 31922 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-06 06:05:37,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:05:37,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 06:05:37,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:05:43,046 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 [] [2022-12-06 06:05:44,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:46,601 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 [] [2022-12-06 06:05:51,775 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 [] [2022-12-06 06:05:53,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:05:55,854 INFO L130 PetriNetUnfolder]: 3832/6749 cut-off events. [2022-12-06 06:05:55,854 INFO L131 PetriNetUnfolder]: For 448989/448989 co-relation queries the response was YES. [2022-12-06 06:05:55,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66732 conditions, 6749 events. 3832/6749 cut-off events. For 448989/448989 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 51220 event pairs, 413 based on Foata normal form. 42/6756 useless extension candidates. Maximal degree in co-relation 66598. Up to 3517 conditions per place. [2022-12-06 06:05:55,976 INFO L137 encePairwiseOnDemand]: 9/44 looper letters, 556 selfloop transitions, 669 changer transitions 0/1225 dead transitions. [2022-12-06 06:05:55,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1225 transitions, 37990 flow [2022-12-06 06:05:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 06:05:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 06:05:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 192 transitions. [2022-12-06 06:05:55,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16783216783216784 [2022-12-06 06:05:55,978 INFO L175 Difference]: Start difference. First operand has 359 places, 1046 transitions, 31922 flow. Second operand 26 states and 192 transitions. [2022-12-06 06:05:55,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1225 transitions, 37990 flow [2022-12-06 06:05:58,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 1225 transitions, 37611 flow, removed 140 selfloop flow, removed 7 redundant places. [2022-12-06 06:05:59,008 INFO L231 Difference]: Finished difference. Result has 386 places, 1136 transitions, 36834 flow [2022-12-06 06:05:59,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=31509, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=584, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=36834, PETRI_PLACES=386, PETRI_TRANSITIONS=1136} [2022-12-06 06:05:59,009 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 368 predicate places. [2022-12-06 06:05:59,009 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:05:59,009 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1136 transitions, 36834 flow [2022-12-06 06:05:59,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:05:59,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:05:59,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1136 transitions, 36834 flow [2022-12-06 06:05:59,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 1136 transitions, 36834 flow [2022-12-06 06:05:59,540 INFO L130 PetriNetUnfolder]: 662/1725 cut-off events. [2022-12-06 06:05:59,541 INFO L131 PetriNetUnfolder]: For 86432/86544 co-relation queries the response was YES. [2022-12-06 06:05:59,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23169 conditions, 1725 events. 662/1725 cut-off events. For 86432/86544 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 15133 event pairs, 0 based on Foata normal form. 0/1719 useless extension candidates. Maximal degree in co-relation 23029. Up to 934 conditions per place. [2022-12-06 06:05:59,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 1136 transitions, 36834 flow [2022-12-06 06:05:59,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 3202 [2022-12-06 06:05:59,576 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:05:59,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 568 [2022-12-06 06:05:59,577 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 1136 transitions, 36834 flow [2022-12-06 06:05:59,577 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-06 06:05:59,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:05:59,577 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:05:59,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 06:05:59,782 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,SelfDestructingSolverStorable33 [2022-12-06 06:05:59,783 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:05:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:05:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1868802108, now seen corresponding path program 1 times [2022-12-06 06:05:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:05:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817989639] [2022-12-06 06:05:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:05:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:05:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:05:59,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:05:59,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817989639] [2022-12-06 06:05:59,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817989639] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:05:59,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228087716] [2022-12-06 06:05:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:05:59,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:05:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:05:59,943 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:05:59,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 06:06:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:00,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:06:00,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:06:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:00,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:06:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:06:00,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228087716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:06:00,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:06:00,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:06:00,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272866860] [2022-12-06 06:06:00,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:06:00,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:06:00,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:06:00,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:06:00,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:06:00,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 06:06:00,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1136 transitions, 36834 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:00,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:06:00,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 06:06:00,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:06:03,525 INFO L130 PetriNetUnfolder]: 4246/7453 cut-off events. [2022-12-06 06:06:03,525 INFO L131 PetriNetUnfolder]: For 561295/561295 co-relation queries the response was YES. [2022-12-06 06:06:03,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77772 conditions, 7453 events. 4246/7453 cut-off events. For 561295/561295 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 57058 event pairs, 496 based on Foata normal form. 36/7454 useless extension candidates. Maximal degree in co-relation 77629. Up to 3807 conditions per place. [2022-12-06 06:06:03,622 INFO L137 encePairwiseOnDemand]: 9/44 looper letters, 614 selfloop transitions, 696 changer transitions 0/1310 dead transitions. [2022-12-06 06:06:03,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1310 transitions, 43866 flow [2022-12-06 06:06:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 06:06:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 06:06:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 161 transitions. [2022-12-06 06:06:03,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2032828282828283 [2022-12-06 06:06:03,623 INFO L175 Difference]: Start difference. First operand has 386 places, 1136 transitions, 36834 flow. Second operand 18 states and 161 transitions. [2022-12-06 06:06:03,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1310 transitions, 43866 flow [2022-12-06 06:06:07,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 1310 transitions, 42480 flow, removed 595 selfloop flow, removed 9 redundant places. [2022-12-06 06:06:07,792 INFO L231 Difference]: Finished difference. Result has 400 places, 1237 transitions, 41339 flow [2022-12-06 06:06:07,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=35604, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=617, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=41339, PETRI_PLACES=400, PETRI_TRANSITIONS=1237} [2022-12-06 06:06:07,793 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 382 predicate places. [2022-12-06 06:06:07,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:06:07,794 INFO L89 Accepts]: Start accepts. Operand has 400 places, 1237 transitions, 41339 flow [2022-12-06 06:06:07,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:06:07,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:06:07,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 400 places, 1237 transitions, 41339 flow [2022-12-06 06:06:07,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 400 places, 1237 transitions, 41339 flow [2022-12-06 06:06:08,428 INFO L130 PetriNetUnfolder]: 728/1896 cut-off events. [2022-12-06 06:06:08,428 INFO L131 PetriNetUnfolder]: For 108445/108549 co-relation queries the response was YES. [2022-12-06 06:06:08,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26443 conditions, 1896 events. 728/1896 cut-off events. For 108445/108549 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 16682 event pairs, 0 based on Foata normal form. 0/1891 useless extension candidates. Maximal degree in co-relation 26298. Up to 1033 conditions per place. [2022-12-06 06:06:08,485 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 400 places, 1237 transitions, 41339 flow [2022-12-06 06:06:08,485 INFO L188 LiptonReduction]: Number of co-enabled transitions 3518 [2022-12-06 06:06:08,584 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:06:08,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 792 [2022-12-06 06:06:08,585 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 1237 transitions, 41361 flow [2022-12-06 06:06:08,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:08,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:06:08,585 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:06:08,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 06:06:08,790 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,SelfDestructingSolverStorable34 [2022-12-06 06:06:08,790 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:06:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:06:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash -533856278, now seen corresponding path program 1 times [2022-12-06 06:06:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:06:08,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430807765] [2022-12-06 06:06:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:06:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:09,105 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-06 06:06:09,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:06:09,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430807765] [2022-12-06 06:06:09,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430807765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:06:09,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901016372] [2022-12-06 06:06:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:06:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:06:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:06:09,120 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:06:09,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 06:06:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:06:09,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 06:06:09,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:06:09,454 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-06 06:06:09,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:06:09,587 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-06 06:06:09,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901016372] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:06:09,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:06:09,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:06:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133854425] [2022-12-06 06:06:09,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:06:09,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:06:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:06:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:06:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:06:09,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 06:06:09,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 1237 transitions, 41361 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:06:09,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:06:09,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 06:06:09,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:06:14,959 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 42 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:06:23,009 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:06:31,055 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 38 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:06:38,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:06:40,318 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 [] [2022-12-06 06:06:42,323 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 [] [2022-12-06 06:06:44,349 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 [] [2022-12-06 06:06:52,671 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 28 DAG size of output: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:06:54,763 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 [] [2022-12-06 06:06:56,915 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 [] [2022-12-06 06:06:58,927 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 [] [2022-12-06 06:07:00,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:07:03,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:07:06,522 INFO L130 PetriNetUnfolder]: 4326/7613 cut-off events. [2022-12-06 06:07:06,522 INFO L131 PetriNetUnfolder]: For 670321/670321 co-relation queries the response was YES. [2022-12-06 06:07:06,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81135 conditions, 7613 events. 4326/7613 cut-off events. For 670321/670321 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 58632 event pairs, 860 based on Foata normal form. 60/7642 useless extension candidates. Maximal degree in co-relation 80987. Up to 6004 conditions per place. [2022-12-06 06:07:06,653 INFO L137 encePairwiseOnDemand]: 11/46 looper letters, 999 selfloop transitions, 369 changer transitions 6/1374 dead transitions. [2022-12-06 06:07:06,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1374 transitions, 45937 flow [2022-12-06 06:07:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 06:07:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 06:07:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 204 transitions. [2022-12-06 06:07:06,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13858695652173914 [2022-12-06 06:07:06,655 INFO L175 Difference]: Start difference. First operand has 400 places, 1237 transitions, 41361 flow. Second operand 32 states and 204 transitions. [2022-12-06 06:07:06,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1374 transitions, 45937 flow [2022-12-06 06:07:10,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 1374 transitions, 45024 flow, removed 415 selfloop flow, removed 4 redundant places. [2022-12-06 06:07:10,510 INFO L231 Difference]: Finished difference. Result has 432 places, 1277 transitions, 43236 flow [2022-12-06 06:07:10,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=40476, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=43236, PETRI_PLACES=432, PETRI_TRANSITIONS=1277} [2022-12-06 06:07:10,511 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 414 predicate places. [2022-12-06 06:07:10,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:10,512 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1277 transitions, 43236 flow [2022-12-06 06:07:10,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:10,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:10,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1277 transitions, 43236 flow [2022-12-06 06:07:10,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 1277 transitions, 43236 flow [2022-12-06 06:07:11,155 INFO L130 PetriNetUnfolder]: 748/1955 cut-off events. [2022-12-06 06:07:11,156 INFO L131 PetriNetUnfolder]: For 118638/118742 co-relation queries the response was YES. [2022-12-06 06:07:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27403 conditions, 1955 events. 748/1955 cut-off events. For 118638/118742 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 17416 event pairs, 0 based on Foata normal form. 0/1950 useless extension candidates. Maximal degree in co-relation 27252. Up to 1010 conditions per place. [2022-12-06 06:07:11,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 1277 transitions, 43236 flow [2022-12-06 06:07:11,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 3598 [2022-12-06 06:07:11,882 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 06:07:11,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1371 [2022-12-06 06:07:11,883 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 1277 transitions, 43651 flow [2022-12-06 06:07:11,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:07:11,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:11,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:11,888 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-06 06:07:12,083 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,SelfDestructingSolverStorable35 [2022-12-06 06:07:12,084 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:07:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1871710404, now seen corresponding path program 1 times [2022-12-06 06:07:12,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:12,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930043982] [2022-12-06 06:07:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:12,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:12,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930043982] [2022-12-06 06:07:12,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930043982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:07:12,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813080683] [2022-12-06 06:07:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:12,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:12,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:07:12,205 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:07:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 06:07:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:12,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:07:12,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:07:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:12,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:07:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:12,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813080683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:07:12,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:07:12,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:07:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581556757] [2022-12-06 06:07:12,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:07:12,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:07:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:07:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:07:12,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 06:07:12,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 1277 transitions, 43651 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:07:12,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:12,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 06:07:12,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:19,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:07:21,428 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 [] [2022-12-06 06:07:24,824 INFO L130 PetriNetUnfolder]: 4682/8233 cut-off events. [2022-12-06 06:07:24,824 INFO L131 PetriNetUnfolder]: For 896709/896709 co-relation queries the response was YES. [2022-12-06 06:07:24,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90866 conditions, 8233 events. 4682/8233 cut-off events. For 896709/896709 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 63861 event pairs, 615 based on Foata normal form. 70/8272 useless extension candidates. Maximal degree in co-relation 90712. Up to 4826 conditions per place. [2022-12-06 06:07:24,925 INFO L137 encePairwiseOnDemand]: 9/55 looper letters, 758 selfloop transitions, 687 changer transitions 0/1445 dead transitions. [2022-12-06 06:07:24,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1445 transitions, 50848 flow [2022-12-06 06:07:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 06:07:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 06:07:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-12-06 06:07:24,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15670995670995672 [2022-12-06 06:07:24,938 INFO L175 Difference]: Start difference. First operand has 432 places, 1277 transitions, 43651 flow. Second operand 21 states and 181 transitions. [2022-12-06 06:07:24,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1445 transitions, 50848 flow [2022-12-06 06:07:29,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1445 transitions, 49872 flow, removed 394 selfloop flow, removed 16 redundant places. [2022-12-06 06:07:29,502 INFO L231 Difference]: Finished difference. Result has 445 places, 1371 transitions, 48540 flow [2022-12-06 06:07:29,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=42707, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=609, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=48540, PETRI_PLACES=445, PETRI_TRANSITIONS=1371} [2022-12-06 06:07:29,504 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 427 predicate places. [2022-12-06 06:07:29,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:29,504 INFO L89 Accepts]: Start accepts. Operand has 445 places, 1371 transitions, 48540 flow [2022-12-06 06:07:29,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:29,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:29,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 445 places, 1371 transitions, 48540 flow [2022-12-06 06:07:29,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 445 places, 1371 transitions, 48540 flow [2022-12-06 06:07:30,113 INFO L130 PetriNetUnfolder]: 793/2080 cut-off events. [2022-12-06 06:07:30,114 INFO L131 PetriNetUnfolder]: For 154233/154381 co-relation queries the response was YES. [2022-12-06 06:07:30,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30725 conditions, 2080 events. 793/2080 cut-off events. For 154233/154381 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 18660 event pairs, 0 based on Foata normal form. 0/2075 useless extension candidates. Maximal degree in co-relation 30564. Up to 1070 conditions per place. [2022-12-06 06:07:30,158 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 445 places, 1371 transitions, 48540 flow [2022-12-06 06:07:30,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 3882 [2022-12-06 06:07:30,162 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:07:30,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 658 [2022-12-06 06:07:30,162 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 1371 transitions, 48540 flow [2022-12-06 06:07:30,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:07:30,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:30,163 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 06:07:30,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:30,364 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:07:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1366405072, now seen corresponding path program 1 times [2022-12-06 06:07:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608931593] [2022-12-06 06:07:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:30,397 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-06 06:07:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608931593] [2022-12-06 06:07:30,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608931593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:07:30,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:07:30,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:07:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005803845] [2022-12-06 06:07:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:07:30,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:07:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:07:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:07:30,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 06:07:30,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1371 transitions, 48540 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-06 06:07:30,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:30,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 06:07:30,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:34,559 INFO L130 PetriNetUnfolder]: 4666/8179 cut-off events. [2022-12-06 06:07:34,559 INFO L131 PetriNetUnfolder]: For 855863/855863 co-relation queries the response was YES. [2022-12-06 06:07:34,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96224 conditions, 8179 events. 4666/8179 cut-off events. For 855863/855863 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 64499 event pairs, 522 based on Foata normal form. 147/8300 useless extension candidates. Maximal degree in co-relation 96060. Up to 3698 conditions per place. [2022-12-06 06:07:34,721 INFO L137 encePairwiseOnDemand]: 34/55 looper letters, 2039 selfloop transitions, 78 changer transitions 0/2117 dead transitions. [2022-12-06 06:07:34,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 2117 transitions, 79905 flow [2022-12-06 06:07:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:07:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:07:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2022-12-06 06:07:34,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23376623376623376 [2022-12-06 06:07:34,723 INFO L175 Difference]: Start difference. First operand has 445 places, 1371 transitions, 48540 flow. Second operand 7 states and 90 transitions. [2022-12-06 06:07:34,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 2117 transitions, 79905 flow [2022-12-06 06:07:39,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 2117 transitions, 77405 flow, removed 1177 selfloop flow, removed 5 redundant places. [2022-12-06 06:07:39,962 INFO L231 Difference]: Finished difference. Result has 450 places, 1386 transitions, 47618 flow [2022-12-06 06:07:39,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=46908, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=47618, PETRI_PLACES=450, PETRI_TRANSITIONS=1386} [2022-12-06 06:07:39,963 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 432 predicate places. [2022-12-06 06:07:39,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:07:39,963 INFO L89 Accepts]: Start accepts. Operand has 450 places, 1386 transitions, 47618 flow [2022-12-06 06:07:39,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:07:39,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:07:39,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 1386 transitions, 47618 flow [2022-12-06 06:07:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 450 places, 1386 transitions, 47618 flow [2022-12-06 06:07:40,675 INFO L130 PetriNetUnfolder]: 814/2131 cut-off events. [2022-12-06 06:07:40,676 INFO L131 PetriNetUnfolder]: For 179539/179689 co-relation queries the response was YES. [2022-12-06 06:07:40,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31591 conditions, 2131 events. 814/2131 cut-off events. For 179539/179689 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 19237 event pairs, 0 based on Foata normal form. 2/2128 useless extension candidates. Maximal degree in co-relation 31425. Up to 1047 conditions per place. [2022-12-06 06:07:40,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 1386 transitions, 47618 flow [2022-12-06 06:07:40,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 3870 [2022-12-06 06:07:40,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:07:40,854 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 891 [2022-12-06 06:07:40,854 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1386 transitions, 47692 flow [2022-12-06 06:07:40,854 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-06 06:07:40,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:07:40,854 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:07:40,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 06:07:40,854 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:07:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:07:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1861572081, now seen corresponding path program 1 times [2022-12-06 06:07:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:07:40,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548900536] [2022-12-06 06:07:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:07:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:07:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548900536] [2022-12-06 06:07:40,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548900536] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:07:40,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3957653] [2022-12-06 06:07:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:07:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:07:40,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:07:40,973 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:07:40,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 06:07:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:07:41,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 06:07:41,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:07:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:41,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:07:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:07:41,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3957653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:07:41,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:07:41,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:07:41,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040170894] [2022-12-06 06:07:41,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:07:41,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:07:41,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:07:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:07:41,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:07:41,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 06:07:41,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1386 transitions, 47692 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:07:41,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:07:41,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 06:07:41,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:07:52,828 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 [] [2022-12-06 06:07:54,903 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 [] [2022-12-06 06:07:56,566 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 [] [2022-12-06 06:07:58,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:08:00,391 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 [] [2022-12-06 06:08:02,406 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 [] [2022-12-06 06:08:04,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:08:06,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:08:08,400 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 [] [2022-12-06 06:08:10,447 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 [] [2022-12-06 06:08:12,452 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 [] [2022-12-06 06:08:14,464 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 [] [2022-12-06 06:08:16,469 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 [] [2022-12-06 06:08:18,479 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 [] [2022-12-06 06:08:20,484 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 [] [2022-12-06 06:08:22,503 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 [] [2022-12-06 06:08:24,515 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 [] [2022-12-06 06:08:26,520 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 [] [2022-12-06 06:08:34,603 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 41 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:08:44,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 [] [2022-12-06 06:08:51,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:08:53,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 [] [2022-12-06 06:08:55,387 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 [] [2022-12-06 06:08:57,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:09:02,492 INFO L130 PetriNetUnfolder]: 4854/8557 cut-off events. [2022-12-06 06:09:02,492 INFO L131 PetriNetUnfolder]: For 1081265/1081265 co-relation queries the response was YES. [2022-12-06 06:09:02,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100233 conditions, 8557 events. 4854/8557 cut-off events. For 1081265/1081265 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 66979 event pairs, 883 based on Foata normal form. 70/8601 useless extension candidates. Maximal degree in co-relation 100064. Up to 6631 conditions per place. [2022-12-06 06:09:02,706 INFO L137 encePairwiseOnDemand]: 11/57 looper letters, 1100 selfloop transitions, 473 changer transitions 3/1576 dead transitions. [2022-12-06 06:09:02,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1576 transitions, 54870 flow [2022-12-06 06:09:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 06:09:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 06:09:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 199 transitions. [2022-12-06 06:09:02,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11637426900584795 [2022-12-06 06:09:02,724 INFO L175 Difference]: Start difference. First operand has 450 places, 1386 transitions, 47692 flow. Second operand 30 states and 199 transitions. [2022-12-06 06:09:02,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 1576 transitions, 54870 flow [2022-12-06 06:09:09,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 1576 transitions, 54840 flow, removed 15 selfloop flow, removed 0 redundant places. [2022-12-06 06:09:09,925 INFO L231 Difference]: Finished difference. Result has 485 places, 1480 transitions, 53012 flow [2022-12-06 06:09:09,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=47668, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=53012, PETRI_PLACES=485, PETRI_TRANSITIONS=1480} [2022-12-06 06:09:09,928 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 467 predicate places. [2022-12-06 06:09:09,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:09:09,928 INFO L89 Accepts]: Start accepts. Operand has 485 places, 1480 transitions, 53012 flow [2022-12-06 06:09:09,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:09:09,937 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:09:09,937 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 485 places, 1480 transitions, 53012 flow [2022-12-06 06:09:09,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 485 places, 1480 transitions, 53012 flow [2022-12-06 06:09:10,679 INFO L130 PetriNetUnfolder]: 879/2302 cut-off events. [2022-12-06 06:09:10,680 INFO L131 PetriNetUnfolder]: For 210528/210681 co-relation queries the response was YES. [2022-12-06 06:09:10,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35204 conditions, 2302 events. 879/2302 cut-off events. For 210528/210681 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 21150 event pairs, 0 based on Foata normal form. 1/2298 useless extension candidates. Maximal degree in co-relation 35030. Up to 1153 conditions per place. [2022-12-06 06:09:10,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 485 places, 1480 transitions, 53012 flow [2022-12-06 06:09:10,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 4034 [2022-12-06 06:09:10,957 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:09:10,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1030 [2022-12-06 06:09:10,958 INFO L495 AbstractCegarLoop]: Abstraction has has 485 places, 1480 transitions, 53098 flow [2022-12-06 06:09:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:09:10,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:09:10,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:09:10,964 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-06 06:09:11,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 06:09:11,163 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:09:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:09:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash -102799531, now seen corresponding path program 1 times [2022-12-06 06:09:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:09:11,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361940073] [2022-12-06 06:09:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:09:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:09:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:09:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361940073] [2022-12-06 06:09:11,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361940073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:09:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958068087] [2022-12-06 06:09:11,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:11,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:09:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:09:11,267 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:09:11,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 06:09:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:11,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:09:11,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:09:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:09:11,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:09:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:09:11,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958068087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:09:11,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:09:11,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:09:11,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183646193] [2022-12-06 06:09:11,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:09:11,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:09:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:09:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:09:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:09:11,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 06:09:11,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 1480 transitions, 53098 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-06 06:09:11,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:09:11,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 06:09:11,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:09:16,279 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 [] [2022-12-06 06:09:18,293 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 [] [2022-12-06 06:09:19,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:09:21,724 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 [] [2022-12-06 06:09:23,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:09:25,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:09:30,171 INFO L130 PetriNetUnfolder]: 4918/8701 cut-off events. [2022-12-06 06:09:30,172 INFO L131 PetriNetUnfolder]: For 1086431/1086431 co-relation queries the response was YES. [2022-12-06 06:09:30,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104464 conditions, 8701 events. 4918/8701 cut-off events. For 1086431/1086431 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 68699 event pairs, 1123 based on Foata normal form. 48/8723 useless extension candidates. Maximal degree in co-relation 104287. Up to 7116 conditions per place. [2022-12-06 06:09:30,317 INFO L137 encePairwiseOnDemand]: 17/62 looper letters, 1194 selfloop transitions, 387 changer transitions 1/1582 dead transitions. [2022-12-06 06:09:30,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1582 transitions, 58361 flow [2022-12-06 06:09:30,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 06:09:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 06:09:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-12-06 06:09:30,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14623655913978495 [2022-12-06 06:09:30,318 INFO L175 Difference]: Start difference. First operand has 485 places, 1480 transitions, 53098 flow. Second operand 15 states and 136 transitions. [2022-12-06 06:09:30,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 1582 transitions, 58361 flow [2022-12-06 06:09:38,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 1582 transitions, 57126 flow, removed 542 selfloop flow, removed 12 redundant places. [2022-12-06 06:09:38,091 INFO L231 Difference]: Finished difference. Result has 492 places, 1521 transitions, 55113 flow [2022-12-06 06:09:38,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=51901, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=55113, PETRI_PLACES=492, PETRI_TRANSITIONS=1521} [2022-12-06 06:09:38,093 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 474 predicate places. [2022-12-06 06:09:38,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:09:38,093 INFO L89 Accepts]: Start accepts. Operand has 492 places, 1521 transitions, 55113 flow [2022-12-06 06:09:38,113 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:09:38,113 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:09:38,113 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 492 places, 1521 transitions, 55113 flow [2022-12-06 06:09:38,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 492 places, 1521 transitions, 55113 flow [2022-12-06 06:09:38,815 INFO L130 PetriNetUnfolder]: 910/2379 cut-off events. [2022-12-06 06:09:38,816 INFO L131 PetriNetUnfolder]: For 221994/222180 co-relation queries the response was YES. [2022-12-06 06:09:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36699 conditions, 2379 events. 910/2379 cut-off events. For 221994/222180 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 21954 event pairs, 1 based on Foata normal form. 0/2373 useless extension candidates. Maximal degree in co-relation 36520. Up to 1194 conditions per place. [2022-12-06 06:09:38,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 492 places, 1521 transitions, 55113 flow [2022-12-06 06:09:38,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 4108 [2022-12-06 06:09:38,959 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:09:38,960 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 867 [2022-12-06 06:09:38,960 INFO L495 AbstractCegarLoop]: Abstraction has has 492 places, 1521 transitions, 55135 flow [2022-12-06 06:09:38,960 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-06 06:09:38,960 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:09:38,960 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:09:38,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 06:09:39,161 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,SelfDestructingSolverStorable39 [2022-12-06 06:09:39,161 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:09:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:09:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash -154410036, now seen corresponding path program 1 times [2022-12-06 06:09:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:09:39,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901414514] [2022-12-06 06:09:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:39,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:09:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:39,250 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-06 06:09:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:09:39,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901414514] [2022-12-06 06:09:39,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901414514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:09:39,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813798050] [2022-12-06 06:09:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:09:39,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:09:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:09:39,252 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:09:39,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 06:09:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:09:39,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:09:39,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:09:39,427 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-06 06:09:39,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:09:39,534 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-06 06:09:39,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813798050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:09:39,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:09:39,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 06:09:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087529817] [2022-12-06 06:09:39,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:09:39,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 06:09:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:09:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 06:09:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-06 06:09:39,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 06:09:39,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 1521 transitions, 55135 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-06 06:09:39,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:09:39,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 06:09:39,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:09:49,763 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 38 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:09:54,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:09:56,585 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 [] [2022-12-06 06:09:59,760 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 [] [2022-12-06 06:10:01,765 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 [] [2022-12-06 06:10:03,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:10:05,200 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 [] [2022-12-06 06:10:07,237 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 [] [2022-12-06 06:10:10,248 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 [] [2022-12-06 06:10:12,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:10:14,270 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 [] [2022-12-06 06:10:16,305 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 [] [2022-12-06 06:10:18,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:10:30,506 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 39 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:10:32,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:10:39,640 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 [] [2022-12-06 06:10:41,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:10:43,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:10:45,690 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 [] [2022-12-06 06:10:50,298 INFO L130 PetriNetUnfolder]: 4994/8849 cut-off events. [2022-12-06 06:10:50,298 INFO L131 PetriNetUnfolder]: For 1017984/1017984 co-relation queries the response was YES. [2022-12-06 06:10:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107437 conditions, 8849 events. 4994/8849 cut-off events. For 1017984/1017984 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 70236 event pairs, 994 based on Foata normal form. 16/8839 useless extension candidates. Maximal degree in co-relation 107255. Up to 7061 conditions per place. [2022-12-06 06:10:50,435 INFO L137 encePairwiseOnDemand]: 11/63 looper letters, 1165 selfloop transitions, 465 changer transitions 4/1634 dead transitions. [2022-12-06 06:10:50,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 1634 transitions, 60232 flow [2022-12-06 06:10:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 06:10:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 06:10:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2022-12-06 06:10:50,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11574074074074074 [2022-12-06 06:10:50,436 INFO L175 Difference]: Start difference. First operand has 492 places, 1521 transitions, 55135 flow. Second operand 24 states and 175 transitions. [2022-12-06 06:10:50,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 1634 transitions, 60232 flow [2022-12-06 06:10:59,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 1634 transitions, 60018 flow, removed 65 selfloop flow, removed 4 redundant places. [2022-12-06 06:11:00,026 INFO L231 Difference]: Finished difference. Result has 517 places, 1556 transitions, 58021 flow [2022-12-06 06:11:00,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=54921, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=58021, PETRI_PLACES=517, PETRI_TRANSITIONS=1556} [2022-12-06 06:11:00,028 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 499 predicate places. [2022-12-06 06:11:00,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:11:00,028 INFO L89 Accepts]: Start accepts. Operand has 517 places, 1556 transitions, 58021 flow [2022-12-06 06:11:00,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:11:00,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:11:00,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 517 places, 1556 transitions, 58021 flow [2022-12-06 06:11:00,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 1556 transitions, 58021 flow [2022-12-06 06:11:00,866 INFO L130 PetriNetUnfolder]: 929/2436 cut-off events. [2022-12-06 06:11:00,866 INFO L131 PetriNetUnfolder]: For 237936/238114 co-relation queries the response was YES. [2022-12-06 06:11:00,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38515 conditions, 2436 events. 929/2436 cut-off events. For 237936/238114 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 22710 event pairs, 1 based on Foata normal form. 0/2430 useless extension candidates. Maximal degree in co-relation 38329. Up to 1233 conditions per place. [2022-12-06 06:11:00,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 517 places, 1556 transitions, 58021 flow [2022-12-06 06:11:00,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 4182 [2022-12-06 06:11:01,107 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:11:01,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1080 [2022-12-06 06:11:01,108 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 1556 transitions, 58039 flow [2022-12-06 06:11:01,108 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-06 06:11:01,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:11:01,108 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:11:01,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-06 06:11:01,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:11:01,309 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:11:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:11:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -499059832, now seen corresponding path program 1 times [2022-12-06 06:11:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:11:01,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957069652] [2022-12-06 06:11:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:11:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:11:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:11:01,447 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-06 06:11:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:11:01,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957069652] [2022-12-06 06:11:01,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957069652] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:11:01,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722453885] [2022-12-06 06:11:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:11:01,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:11:01,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:11:01,449 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:11:01,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 06:11:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:11:01,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 06:11:01,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:11:01,742 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-06 06:11:01,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:11:01,909 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-06 06:11:01,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722453885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:11:01,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:11:01,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:11:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33540250] [2022-12-06 06:11:01,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:11:01,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:11:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:11:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:11:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:11:01,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 06:11:01,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 1556 transitions, 58039 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:11:01,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:11:01,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 06:11:01,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:11:11,343 WARN L233 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 49 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:11:17,405 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 42 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:11:22,924 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 [] [2022-12-06 06:11:25,653 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 [] [2022-12-06 06:11:27,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:11:29,375 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 [] [2022-12-06 06:11:31,381 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 [] [2022-12-06 06:11:33,394 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 [] [2022-12-06 06:11:35,403 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 [] [2022-12-06 06:11:37,436 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 [] [2022-12-06 06:11:38,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:11:41,007 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 [] [2022-12-06 06:11:43,463 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 [] [2022-12-06 06:11:45,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:11:47,485 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 [] [2022-12-06 06:11:49,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:12:04,301 WARN L233 SmtUtils]: Spent 9.46s on a formula simplification. DAG size of input: 49 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:11,286 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 53 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:17,433 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 37 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:33,414 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 34 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:12:40,794 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 [] [2022-12-06 06:12:42,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:12:45,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:12:47,506 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 [] [2022-12-06 06:12:49,514 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 [] [2022-12-06 06:12:50,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:12:52,877 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 [] [2022-12-06 06:12:54,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:12:56,096 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 [] [2022-12-06 06:13:01,237 INFO L130 PetriNetUnfolder]: 5240/9347 cut-off events. [2022-12-06 06:13:01,237 INFO L131 PetriNetUnfolder]: For 1253817/1253817 co-relation queries the response was YES. [2022-12-06 06:13:01,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116531 conditions, 9347 events. 5240/9347 cut-off events. For 1253817/1253817 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 75287 event pairs, 882 based on Foata normal form. 44/9365 useless extension candidates. Maximal degree in co-relation 116342. Up to 6600 conditions per place. [2022-12-06 06:13:01,393 INFO L137 encePairwiseOnDemand]: 11/66 looper letters, 1109 selfloop transitions, 685 changer transitions 5/1799 dead transitions. [2022-12-06 06:13:01,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 1799 transitions, 67996 flow [2022-12-06 06:13:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-06 06:13:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-06 06:13:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 238 transitions. [2022-12-06 06:13:01,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09746109746109746 [2022-12-06 06:13:01,394 INFO L175 Difference]: Start difference. First operand has 517 places, 1556 transitions, 58039 flow. Second operand 37 states and 238 transitions. [2022-12-06 06:13:01,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 1799 transitions, 67996 flow [2022-12-06 06:13:10,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 1799 transitions, 67507 flow, removed 151 selfloop flow, removed 13 redundant places. [2022-12-06 06:13:10,484 INFO L231 Difference]: Finished difference. Result has 547 places, 1683 transitions, 65850 flow [2022-12-06 06:13:10,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=57566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=573, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=65850, PETRI_PLACES=547, PETRI_TRANSITIONS=1683} [2022-12-06 06:13:10,485 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 529 predicate places. [2022-12-06 06:13:10,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:13:10,486 INFO L89 Accepts]: Start accepts. Operand has 547 places, 1683 transitions, 65850 flow [2022-12-06 06:13:10,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:13:10,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:13:10,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 547 places, 1683 transitions, 65850 flow [2022-12-06 06:13:10,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 547 places, 1683 transitions, 65850 flow [2022-12-06 06:13:11,531 INFO L130 PetriNetUnfolder]: 989/2620 cut-off events. [2022-12-06 06:13:11,531 INFO L131 PetriNetUnfolder]: For 268651/268843 co-relation queries the response was YES. [2022-12-06 06:13:11,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42822 conditions, 2620 events. 989/2620 cut-off events. For 268651/268843 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 24874 event pairs, 1 based on Foata normal form. 0/2613 useless extension candidates. Maximal degree in co-relation 42628. Up to 1344 conditions per place. [2022-12-06 06:13:11,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 547 places, 1683 transitions, 65850 flow [2022-12-06 06:13:11,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 4430 [2022-12-06 06:13:11,805 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:13:11,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1321 [2022-12-06 06:13:11,806 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 1683 transitions, 65914 flow [2022-12-06 06:13:11,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:13:11,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:13:11,806 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:13:11,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-06 06:13:12,011 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,SelfDestructingSolverStorable41 [2022-12-06 06:13:12,011 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:13:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:13:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -487126692, now seen corresponding path program 1 times [2022-12-06 06:13:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:13:12,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106759816] [2022-12-06 06:13:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:13:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:13:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:13:12,136 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-06 06:13:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:13:12,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106759816] [2022-12-06 06:13:12,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106759816] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:13:12,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350340611] [2022-12-06 06:13:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:13:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:13:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:13:12,138 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:13:12,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-06 06:13:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:13:12,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 06:13:12,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:13:12,350 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-06 06:13:12,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:13:12,508 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-06 06:13:12,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350340611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:13:12,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:13:12,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:13:12,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878452267] [2022-12-06 06:13:12,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:13:12,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:13:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:13:12,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:13:12,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:13:12,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 06:13:12,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1683 transitions, 65914 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:13:12,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:13:12,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 06:13:12,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:13:24,759 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 47 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:13:32,876 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 42 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:13:35,982 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 [] [2022-12-06 06:13:38,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:13:40,473 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 [] [2022-12-06 06:13:42,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:13:45,153 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 [] [2022-12-06 06:13:47,255 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 [] [2022-12-06 06:13:49,357 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 [] [2022-12-06 06:13:51,378 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 [] [2022-12-06 06:13:53,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:14:03,935 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 45 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:14:12,805 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification. DAG size of input: 50 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:14:14,945 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 [] [2022-12-06 06:14:20,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:14:22,819 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 [] [2022-12-06 06:14:25,186 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 [] [2022-12-06 06:14:27,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:14:28,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:14:34,765 INFO L130 PetriNetUnfolder]: 5480/9817 cut-off events. [2022-12-06 06:14:34,766 INFO L131 PetriNetUnfolder]: For 1404612/1404612 co-relation queries the response was YES. [2022-12-06 06:14:34,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126930 conditions, 9817 events. 5480/9817 cut-off events. For 1404612/1404612 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 80312 event pairs, 991 based on Foata normal form. 36/9827 useless extension candidates. Maximal degree in co-relation 126733. Up to 7103 conditions per place. [2022-12-06 06:14:34,932 INFO L137 encePairwiseOnDemand]: 11/70 looper letters, 1198 selfloop transitions, 701 changer transitions 6/1905 dead transitions. [2022-12-06 06:14:34,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 1905 transitions, 76167 flow [2022-12-06 06:14:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-06 06:14:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-06 06:14:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 217 transitions. [2022-12-06 06:14:34,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.096875 [2022-12-06 06:14:34,934 INFO L175 Difference]: Start difference. First operand has 547 places, 1683 transitions, 65914 flow. Second operand 32 states and 217 transitions. [2022-12-06 06:14:34,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 1905 transitions, 76167 flow [2022-12-06 06:14:44,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 1905 transitions, 70110 flow, removed 2904 selfloop flow, removed 20 redundant places. [2022-12-06 06:14:45,016 INFO L231 Difference]: Finished difference. Result has 564 places, 1798 transitions, 68300 flow [2022-12-06 06:14:45,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=61007, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=609, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=68300, PETRI_PLACES=564, PETRI_TRANSITIONS=1798} [2022-12-06 06:14:45,018 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 546 predicate places. [2022-12-06 06:14:45,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:14:45,019 INFO L89 Accepts]: Start accepts. Operand has 564 places, 1798 transitions, 68300 flow [2022-12-06 06:14:45,031 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:14:45,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:14:45,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 564 places, 1798 transitions, 68300 flow [2022-12-06 06:14:45,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 564 places, 1798 transitions, 68300 flow [2022-12-06 06:14:46,434 INFO L130 PetriNetUnfolder]: 1053/2800 cut-off events. [2022-12-06 06:14:46,434 INFO L131 PetriNetUnfolder]: For 291575/291767 co-relation queries the response was YES. [2022-12-06 06:14:46,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44544 conditions, 2800 events. 1053/2800 cut-off events. For 291575/291767 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 27070 event pairs, 1 based on Foata normal form. 0/2793 useless extension candidates. Maximal degree in co-relation 44345. Up to 1083 conditions per place. [2022-12-06 06:14:46,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 564 places, 1798 transitions, 68300 flow [2022-12-06 06:14:46,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 4670 [2022-12-06 06:14:46,831 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:14:46,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1813 [2022-12-06 06:14:46,832 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 1798 transitions, 68398 flow [2022-12-06 06:14:46,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:46,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:14:46,832 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:14:46,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-06 06:14:47,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:47,033 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 06:14:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:14:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash 796063934, now seen corresponding path program 1 times [2022-12-06 06:14:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:14:47,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886513699] [2022-12-06 06:14:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:47,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:14:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:47,289 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-06 06:14:47,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:14:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886513699] [2022-12-06 06:14:47,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886513699] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:14:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20154522] [2022-12-06 06:14:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:14:47,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:14:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:14:47,291 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 06:14:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-06 06:14:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:14:47,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 06:14:47,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:14:47,536 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-06 06:14:47,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:14:47,708 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-06 06:14:47,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20154522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:14:47,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:14:47,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 06:14:47,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835486135] [2022-12-06 06:14:47,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:14:47,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 06:14:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:14:47,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 06:14:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-12-06 06:14:47,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 06:14:47,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 1798 transitions, 68398 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:14:47,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:14:47,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 06:14:47,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:14:54,366 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 42 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:14:58,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 06:15:00,012 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 [] [2022-12-06 06:15:02,020 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 [] [2022-12-06 06:15:09,324 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 36 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 06:15:12,705 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 [] [2022-12-06 06:15:14,714 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 [] Received shutdown request... [2022-12-06 06:15:19,889 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:15:19,895 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 06:15:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 06:15:20,000 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 06:15:20,006 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-06 06:15:20,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:20,205 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 44,while PetriNetUnfolder was constructing finite prefix that currently has 96244 conditions, 8264 events (4752/8263 cut-off events. For 673962/673962 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 69006 event pairs, 462 based on Foata normal form. 17/9035 useless extension candidates. Maximal degree in co-relation 96042. Up to 4271 conditions per place.). [2022-12-06 06:15:20,207 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 06:15:20,207 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 06:15:20,207 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:20,210 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:15:20,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:15:20,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:15:20 BasicIcfg [2022-12-06 06:15:20,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:15:20,214 INFO L158 Benchmark]: Toolchain (without parser) took 847284.60ms. Allocated memory was 184.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 159.3MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 669.9MB. Max. memory is 8.0GB. [2022-12-06 06:15:20,214 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 107.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:15:20,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.66ms. Allocated memory is still 184.5MB. Free memory was 159.0MB in the beginning and 138.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 06:15:20,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.54ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:15:20,214 INFO L158 Benchmark]: Boogie Preprocessor took 43.04ms. Allocated memory is still 184.5MB. Free memory was 136.6MB in the beginning and 135.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:15:20,214 INFO L158 Benchmark]: RCFGBuilder took 601.56ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 120.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 06:15:20,214 INFO L158 Benchmark]: TraceAbstraction took 846215.35ms. Allocated memory was 184.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 120.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 631.1MB. Max. memory is 8.0GB. [2022-12-06 06:15:20,215 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.14ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 107.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.66ms. Allocated memory is still 184.5MB. Free memory was 159.0MB in the beginning and 138.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.54ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.04ms. Allocated memory is still 184.5MB. Free memory was 136.6MB in the beginning and 135.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 601.56ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 120.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 846215.35ms. Allocated memory was 184.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 120.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 631.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 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: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1122, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1096, unknown conditional: 0, unknown unconditional: 1096] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1936, Positive conditional cache size: 0, Positive unconditional cache size: 1936, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 18 PlacesBefore, 18 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 42, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 180, Positive conditional cache size: 180, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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): 282, Positive cache size: 282, Positive conditional cache size: 282, 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): 354, Positive cache size: 354, Positive conditional cache size: 354, 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, 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): 390, Positive cache size: 390, Positive conditional cache size: 390, 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, 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): 468, Positive cache size: 468, Positive conditional cache size: 468, 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, 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): 504, Positive cache size: 504, Positive conditional cache size: 504, 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, 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): 588, Positive cache size: 588, Positive conditional cache size: 588, 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, 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): 678, Positive cache size: 678, Positive conditional cache size: 678, 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): 696, Positive cache size: 696, Positive conditional cache size: 696, 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, 28 PlacesBefore, 28 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 192 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): 728, Positive cache size: 728, Positive conditional cache size: 728, 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, 46 PlacesBefore, 46 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 32, independent: 32, independent conditional: 32, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 32, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1140, Positive conditional cache size: 1140, 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, 38 PlacesBefore, 38 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 244 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): 1142, Positive cache size: 1142, Positive conditional cache size: 1142, 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, 51 PlacesBefore, 51 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1146, Positive cache size: 1146, Positive conditional cache size: 1146, 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, 69 PlacesBefore, 69 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 444 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): 1146, Positive cache size: 1146, Positive conditional cache size: 1146, 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, 80 PlacesBefore, 80 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 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.6s, 99 PlacesBefore, 99 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 18, independent: 10, independent conditional: 10, 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): 1531, Positive cache size: 1531, Positive conditional cache size: 1531, 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, 107 PlacesBefore, 107 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1664, Positive cache size: 1664, Positive conditional cache size: 1664, 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, 118 PlacesBefore, 118 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 744 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): 2066, Positive cache size: 2066, Positive conditional cache size: 2066, 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, 133 PlacesBefore, 133 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 850 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): 2066, Positive cache size: 2066, Positive conditional cache size: 2066, 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, 147 PlacesBefore, 147 PlacesAfterwards, 295 TransitionsBefore, 295 TransitionsAfterwards, 910 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): 2204, Positive cache size: 2204, Positive conditional cache size: 2204, 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, 169 PlacesBefore, 169 PlacesAfterwards, 375 TransitionsBefore, 375 TransitionsAfterwards, 1144 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): 2204, Positive cache size: 2204, Positive conditional cache size: 2204, 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, 184 PlacesBefore, 184 PlacesAfterwards, 407 TransitionsBefore, 407 TransitionsAfterwards, 1214 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): 2204, Positive cache size: 2204, Positive conditional cache size: 2204, 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, 204 PlacesBefore, 204 PlacesAfterwards, 478 TransitionsBefore, 478 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2484, Positive cache size: 2484, Positive conditional cache size: 2484, 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, 218 PlacesBefore, 218 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 1606 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): 2633, Positive cache size: 2633, Positive conditional cache size: 2633, 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, 247 PlacesBefore, 247 PlacesAfterwards, 610 TransitionsBefore, 610 TransitionsAfterwards, 1834 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): 2769, Positive cache size: 2769, Positive conditional cache size: 2769, 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, 264 PlacesBefore, 264 PlacesAfterwards, 674 TransitionsBefore, 674 TransitionsAfterwards, 2040 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): 2769, Positive cache size: 2769, Positive conditional cache size: 2769, 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, 284 PlacesBefore, 284 PlacesAfterwards, 790 TransitionsBefore, 790 TransitionsAfterwards, 2386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 13, independent: 5, independent conditional: 5, 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): 3434, Positive cache size: 3434, Positive conditional cache size: 3434, 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, 317 PlacesBefore, 317 PlacesAfterwards, 900 TransitionsBefore, 900 TransitionsAfterwards, 2616 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): 3434, Positive cache size: 3434, Positive conditional cache size: 3434, 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, 333 PlacesBefore, 333 PlacesAfterwards, 971 TransitionsBefore, 971 TransitionsAfterwards, 2784 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): 3572, Positive cache size: 3572, Positive conditional cache size: 3572, 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, 359 PlacesBefore, 359 PlacesAfterwards, 1046 TransitionsBefore, 1046 TransitionsAfterwards, 2976 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3716, Positive cache size: 3716, Positive conditional cache size: 3716, 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, 386 PlacesBefore, 386 PlacesAfterwards, 1136 TransitionsBefore, 1136 TransitionsAfterwards, 3202 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): 3716, Positive cache size: 3716, Positive conditional cache size: 3716, 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, 400 PlacesBefore, 400 PlacesAfterwards, 1237 TransitionsBefore, 1237 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 4157, Positive cache size: 4157, Positive conditional cache size: 4157, 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.7s, 432 PlacesBefore, 432 PlacesAfterwards, 1277 TransitionsBefore, 1277 TransitionsAfterwards, 3598 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5767, Positive cache size: 5767, Positive conditional cache size: 5767, 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, 445 PlacesBefore, 445 PlacesAfterwards, 1371 TransitionsBefore, 1371 TransitionsAfterwards, 3882 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): 5767, Positive cache size: 5767, Positive conditional cache size: 5767, 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, 450 PlacesBefore, 450 PlacesAfterwards, 1386 TransitionsBefore, 1386 TransitionsAfterwards, 3870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6049, Positive cache size: 6049, Positive conditional cache size: 6049, 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, 485 PlacesBefore, 485 PlacesAfterwards, 1480 TransitionsBefore, 1480 TransitionsAfterwards, 4034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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): 6649, Positive cache size: 6649, Positive conditional cache size: 6649, 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, 492 PlacesBefore, 492 PlacesAfterwards, 1521 TransitionsBefore, 1521 TransitionsAfterwards, 4108 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): 6650, Positive cache size: 6650, Positive conditional cache size: 6650, 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, 517 PlacesBefore, 517 PlacesAfterwards, 1556 TransitionsBefore, 1556 TransitionsAfterwards, 4182 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6956, Positive cache size: 6956, Positive conditional cache size: 6956, 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, 547 PlacesBefore, 547 PlacesAfterwards, 1683 TransitionsBefore, 1683 TransitionsAfterwards, 4430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 7875, Positive cache size: 7875, Positive conditional cache size: 7875, 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, 564 PlacesBefore, 564 PlacesAfterwards, 1798 TransitionsBefore, 1798 TransitionsAfterwards, 4670 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 8339, Positive cache size: 8339, Positive conditional cache size: 8339, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 44,while PetriNetUnfolder was constructing finite prefix that currently has 96244 conditions, 8264 events (4752/8263 cut-off events. For 673962/673962 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 69006 event pairs, 462 based on Foata normal form. 17/9035 useless extension candidates. Maximal degree in co-relation 96042. Up to 4271 conditions per place.). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 44,while PetriNetUnfolder was constructing finite prefix that currently has 96244 conditions, 8264 events (4752/8263 cut-off events. For 673962/673962 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 69006 event pairs, 462 based on Foata normal form. 17/9035 useless extension candidates. Maximal degree in co-relation 96042. Up to 4271 conditions per place.). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (20states, 0/74 universal loopers) in iteration 44,while PetriNetUnfolder was constructing finite prefix that currently has 96244 conditions, 8264 events (4752/8263 cut-off events. For 673962/673962 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 69006 event pairs, 462 based on Foata normal form. 17/9035 useless extension candidates. Maximal degree in co-relation 96042. Up to 4271 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 846.1s, OverallIterations: 44, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 799.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 125 mSolverCounterUnknown, 4770 SdHoareTripleChecker+Valid, 315.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4770 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 313.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15567 IncrementalHoareTripleChecker+Invalid, 20488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4796 mSolverCounterUnsat, 0 mSDtfsCounter, 15567 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1341 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 887 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4889 ImplicationChecksByTransitivity, 348.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68398occurred in iteration=43, InterpolantAutomatonStates: 649, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 1166 ConstructedInterpolants, 0 QuantifiedInterpolants, 16464 SizeOfPredicates, 30 NumberOfNonLiveVariables, 6292 ConjunctsInSsa, 610 ConjunctsInUnsatCore, 127 InterpolantComputations, 3 PerfectInterpolantSequences, 12/346 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 [2022-12-06 06:15:20,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0