/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:15:00,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:15:00,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:15:00,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:15:00,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:15:00,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:15:00,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:15:00,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:15:00,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:15:00,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:15:00,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:15:00,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:15:00,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:15:00,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:15:00,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:15:00,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:15:00,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:15:00,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:15:00,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:15:00,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:15:00,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:15:00,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:15:00,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:15:00,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:15:00,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:15:00,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:15:00,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:15:00,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:15:00,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:15:00,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:15:00,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:15:00,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:15:00,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:15:00,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:15:00,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:15:00,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:15:00,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:15:00,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:15:00,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:15:00,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:15:00,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:15:00,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 05:15:00,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:15:00,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:15:00,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:15:00,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:15:00,400 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:15:00,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:15:00,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:15:00,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:15:00,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:15:00,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:15:00,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:15:00,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:15:00,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:15:00,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:15:00,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:15:00,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:15:00,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:15:00,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:15:00,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:15:00,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:15:00,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:15:00,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:15:00,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:15:00,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:15:00,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:15:00,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:15:00,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:15:00,405 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:15:00,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 05:15:00,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:15:00,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:15:00,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:15:00,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:15:00,756 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:15:00,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 05:15:01,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:15:02,172 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:15:02,173 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 05:15:02,179 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f2a9c52/6854856f4b764a43847ce732d0bbd3da/FLAGe7ff36d01 [2022-12-13 05:15:02,199 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f2a9c52/6854856f4b764a43847ce732d0bbd3da [2022-12-13 05:15:02,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:15:02,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:15:02,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:15:02,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:15:02,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:15:02,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48efc080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02, skipping insertion in model container [2022-12-13 05:15:02,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:15:02,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:15:02,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,396 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-13 05:15:02,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:15:02,406 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:15:02,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 05:15:02,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 05:15:02,427 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-12-13 05:15:02,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:15:02,441 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:15:02,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02 WrapperNode [2022-12-13 05:15:02,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:15:02,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:15:02,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:15:02,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:15:02,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,495 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-12-13 05:15:02,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:15:02,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:15:02,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:15:02,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:15:02,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,531 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:15:02,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:15:02,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:15:02,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:15:02,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (1/1) ... [2022-12-13 05:15:02,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:15:02,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:02,577 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-13 05:15:02,605 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-13 05:15:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:15:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 05:15:02,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 05:15:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 05:15:02,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 05:15:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 05:15:02,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 05:15:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 05:15:02,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:15:02,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:15:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:15:02,624 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 05:15:02,750 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:15:02,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:15:03,011 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:15:03,077 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:15:03,077 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 05:15:03,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:15:03 BoogieIcfgContainer [2022-12-13 05:15:03,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:15:03,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:15:03,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:15:03,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:15:03,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:15:02" (1/3) ... [2022-12-13 05:15:03,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c514a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:15:03, skipping insertion in model container [2022-12-13 05:15:03,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:02" (2/3) ... [2022-12-13 05:15:03,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c514a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:15:03, skipping insertion in model container [2022-12-13 05:15:03,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:15:03" (3/3) ... [2022-12-13 05:15:03,087 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-12-13 05:15:03,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:15:03,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 05:15:03,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:15:03,184 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 05:15:03,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 124 transitions, 280 flow [2022-12-13 05:15:03,316 INFO L130 PetriNetUnfolder]: 10/120 cut-off events. [2022-12-13 05:15:03,316 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 05:15:03,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 10/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 05:15:03,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 124 transitions, 280 flow [2022-12-13 05:15:03,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-12-13 05:15:03,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:03,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 108 transitions, 240 flow [2022-12-13 05:15:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 108 transitions, 240 flow [2022-12-13 05:15:03,413 INFO L130 PetriNetUnfolder]: 10/108 cut-off events. [2022-12-13 05:15:03,413 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 05:15:03,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 10/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 05:15:03,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 108 transitions, 240 flow [2022-12-13 05:15:03,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 05:15:07,336 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 05:15:07,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:15:07,355 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;@5f51eaf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:15:07,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 05:15:07,361 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 05:15:07,361 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 05:15:07,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:07,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:07,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2052267608, now seen corresponding path program 1 times [2022-12-13 05:15:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548436737] [2022-12-13 05:15:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:07,785 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-13 05:15:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548436737] [2022-12-13 05:15:07,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548436737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:07,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:07,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 05:15:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269264047] [2022-12-13 05:15:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:15:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:15:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:15:07,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:07,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-13 05:15:07,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:07,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:07,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:07,943 INFO L130 PetriNetUnfolder]: 431/611 cut-off events. [2022-12-13 05:15:07,943 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 05:15:07,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 611 events. 431/611 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1712 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 928. Up to 405 conditions per place. [2022-12-13 05:15:07,955 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 39 selfloop transitions, 3 changer transitions 3/45 dead transitions. [2022-12-13 05:15:07,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 225 flow [2022-12-13 05:15:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:15:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:15:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 05:15:07,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 05:15:07,971 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 05:15:07,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 45 transitions, 225 flow [2022-12-13 05:15:07,975 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 42 transitions, 207 flow [2022-12-13 05:15:07,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:07,978 INFO L89 Accepts]: Start accepts. Operand has 36 places, 42 transitions, 207 flow [2022-12-13 05:15:07,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:07,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:07,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 42 transitions, 207 flow [2022-12-13 05:15:07,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 42 transitions, 207 flow [2022-12-13 05:15:07,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:07,989 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:07,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 05:15:07,994 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 42 transitions, 207 flow [2022-12-13 05:15:07,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-13 05:15:07,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:07,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:07,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:15:07,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1346749667, now seen corresponding path program 1 times [2022-12-13 05:15:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:07,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144334651] [2022-12-13 05:15:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:08,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144334651] [2022-12-13 05:15:08,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144334651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:08,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:08,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:15:08,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669419044] [2022-12-13 05:15:08,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:08,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:08,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:08,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:08,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:15:08,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:08,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 42 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:08,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:08,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:08,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:08,371 INFO L130 PetriNetUnfolder]: 485/702 cut-off events. [2022-12-13 05:15:08,371 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 05:15:08,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 702 events. 485/702 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2163 event pairs, 45 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 1924. Up to 503 conditions per place. [2022-12-13 05:15:08,377 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 56 selfloop transitions, 4 changer transitions 11/71 dead transitions. [2022-12-13 05:15:08,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 71 transitions, 489 flow [2022-12-13 05:15:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 05:15:08,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-13 05:15:08,380 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-13 05:15:08,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 71 transitions, 489 flow [2022-12-13 05:15:08,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 60 transitions, 411 flow [2022-12-13 05:15:08,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:08,387 INFO L89 Accepts]: Start accepts. Operand has 39 places, 60 transitions, 411 flow [2022-12-13 05:15:08,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:08,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:08,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 60 transitions, 411 flow [2022-12-13 05:15:08,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 60 transitions, 411 flow [2022-12-13 05:15:08,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:08,396 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:08,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 05:15:08,397 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 60 transitions, 411 flow [2022-12-13 05:15:08,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:08,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:08,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:15:08,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -38283032, now seen corresponding path program 1 times [2022-12-13 05:15:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:08,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822468277] [2022-12-13 05:15:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:08,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822468277] [2022-12-13 05:15:08,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822468277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:08,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:08,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 05:15:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849476403] [2022-12-13 05:15:08,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:08,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:15:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:08,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:15:08,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:15:08,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:08,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 60 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:08,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:08,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:08,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:08,803 INFO L130 PetriNetUnfolder]: 587/828 cut-off events. [2022-12-13 05:15:08,803 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 05:15:08,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 828 events. 587/828 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2441 event pairs, 81 based on Foata normal form. 8/556 useless extension candidates. Maximal degree in co-relation 3016. Up to 771 conditions per place. [2022-12-13 05:15:08,809 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 82 selfloop transitions, 8 changer transitions 4/94 dead transitions. [2022-12-13 05:15:08,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 94 transitions, 821 flow [2022-12-13 05:15:08,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 05:15:08,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-13 05:15:08,813 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-13 05:15:08,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 94 transitions, 821 flow [2022-12-13 05:15:08,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 90 transitions, 789 flow [2022-12-13 05:15:08,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:08,826 INFO L89 Accepts]: Start accepts. Operand has 42 places, 90 transitions, 789 flow [2022-12-13 05:15:08,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:08,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:08,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 90 transitions, 789 flow [2022-12-13 05:15:08,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 90 transitions, 789 flow [2022-12-13 05:15:08,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:08,832 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:08,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 05:15:08,833 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 90 transitions, 789 flow [2022-12-13 05:15:08,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:08,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:08,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:08,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:15:08,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash -749334116, now seen corresponding path program 2 times [2022-12-13 05:15:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:08,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164799175] [2022-12-13 05:15:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:08,995 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-13 05:15:08,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:08,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164799175] [2022-12-13 05:15:08,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164799175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:08,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269066953] [2022-12-13 05:15:08,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:15:08,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:08,999 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-13 05:15:09,001 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-13 05:15:09,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:15:09,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:09,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 05:15:09,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:09,277 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-13 05:15:09,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:09,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269066953] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:09,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 05:15:09,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2022-12-13 05:15:09,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106765989] [2022-12-13 05:15:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:09,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 05:15:09,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:09,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 90 transitions, 789 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:09,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:09,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:09,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:09,551 INFO L130 PetriNetUnfolder]: 917/1298 cut-off events. [2022-12-13 05:15:09,551 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-13 05:15:09,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6666 conditions, 1298 events. 917/1298 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4462 event pairs, 41 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 5774. Up to 1253 conditions per place. [2022-12-13 05:15:09,586 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 126 selfloop transitions, 11 changer transitions 0/137 dead transitions. [2022-12-13 05:15:09,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 05:15:09,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.66 [2022-12-13 05:15:09,590 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-13 05:15:09,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:09,605 INFO L89 Accepts]: Start accepts. Operand has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:09,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:09,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:09,612 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:09,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 05:15:09,616 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 137 transitions, 1478 flow [2022-12-13 05:15:09,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:09,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:09,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:09,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 05:15:09,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:09,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1686738454, now seen corresponding path program 3 times [2022-12-13 05:15:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:09,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011990323] [2022-12-13 05:15:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:09,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011990323] [2022-12-13 05:15:09,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011990323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:09,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:09,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:15:09,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852554177] [2022-12-13 05:15:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:15:09,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:09,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 137 transitions, 1478 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:09,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:09,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:09,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:10,319 INFO L130 PetriNetUnfolder]: 1733/2464 cut-off events. [2022-12-13 05:15:10,319 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-12-13 05:15:10,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15108 conditions, 2464 events. 1733/2464 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9834 event pairs, 18 based on Foata normal form. 10/1662 useless extension candidates. Maximal degree in co-relation 14080. Up to 2419 conditions per place. [2022-12-13 05:15:10,341 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 305 selfloop transitions, 29 changer transitions 5/339 dead transitions. [2022-12-13 05:15:10,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 339 transitions, 4305 flow [2022-12-13 05:15:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:15:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:15:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 05:15:10,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-13 05:15:10,344 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-13 05:15:10,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 339 transitions, 4305 flow [2022-12-13 05:15:10,364 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 334 transitions, 4242 flow [2022-12-13 05:15:10,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:10,381 INFO L89 Accepts]: Start accepts. Operand has 49 places, 334 transitions, 4242 flow [2022-12-13 05:15:10,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:10,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:10,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 334 transitions, 4242 flow [2022-12-13 05:15:10,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 334 transitions, 4242 flow [2022-12-13 05:15:10,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:10,390 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:10,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 05:15:10,391 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 334 transitions, 4242 flow [2022-12-13 05:15:10,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:10,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:10,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:10,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:15:10,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1949285127, now seen corresponding path program 2 times [2022-12-13 05:15:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:10,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624978558] [2022-12-13 05:15:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:10,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624978558] [2022-12-13 05:15:10,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624978558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:10,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:10,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:15:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903821028] [2022-12-13 05:15:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:10,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:15:10,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:10,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 334 transitions, 4242 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:10,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:10,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:10,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:10,883 INFO L130 PetriNetUnfolder]: 1700/2427 cut-off events. [2022-12-13 05:15:10,884 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-13 05:15:10,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17312 conditions, 2427 events. 1700/2427 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9698 event pairs, 46 based on Foata normal form. 26/1645 useless extension candidates. Maximal degree in co-relation 16123. Up to 2393 conditions per place. [2022-12-13 05:15:10,901 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 308 selfloop transitions, 10 changer transitions 23/341 dead transitions. [2022-12-13 05:15:10,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 341 transitions, 5017 flow [2022-12-13 05:15:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:15:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:15:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 05:15:10,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.616 [2022-12-13 05:15:10,903 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-13 05:15:10,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 341 transitions, 5017 flow [2022-12-13 05:15:10,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 318 transitions, 4677 flow [2022-12-13 05:15:10,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:10,935 INFO L89 Accepts]: Start accepts. Operand has 53 places, 318 transitions, 4677 flow [2022-12-13 05:15:10,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:10,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:10,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 318 transitions, 4677 flow [2022-12-13 05:15:10,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 318 transitions, 4677 flow [2022-12-13 05:15:10,943 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:10,944 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:10,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 05:15:10,945 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 318 transitions, 4677 flow [2022-12-13 05:15:10,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:10,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:10,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:10,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 05:15:10,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2144818330, now seen corresponding path program 4 times [2022-12-13 05:15:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:10,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120028531] [2022-12-13 05:15:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:11,064 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-13 05:15:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:11,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120028531] [2022-12-13 05:15:11,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120028531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743236160] [2022-12-13 05:15:11,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:15:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:11,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:11,066 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-13 05:15:11,092 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-13 05:15:11,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:15:11,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:11,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 05:15:11,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:11,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 05:15:11,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743236160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:11,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 05:15:11,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-13 05:15:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98034679] [2022-12-13 05:15:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:11,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:11,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 05:15:11,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:11,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 318 transitions, 4677 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:11,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:11,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:11,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:11,654 INFO L130 PetriNetUnfolder]: 2062/2913 cut-off events. [2022-12-13 05:15:11,655 INFO L131 PetriNetUnfolder]: For 449/449 co-relation queries the response was YES. [2022-12-13 05:15:11,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23652 conditions, 2913 events. 2062/2913 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11833 event pairs, 36 based on Foata normal form. 0/2003 useless extension candidates. Maximal degree in co-relation 22222. Up to 2895 conditions per place. [2022-12-13 05:15:11,678 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 422 selfloop transitions, 22 changer transitions 0/444 dead transitions. [2022-12-13 05:15:11,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 05:15:11,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.63 [2022-12-13 05:15:11,682 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-13 05:15:11,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,706 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,726 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:11,727 INFO L89 Accepts]: Start accepts. Operand has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:11,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:11,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:11,740 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:11,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 05:15:11,741 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 444 transitions, 7392 flow [2022-12-13 05:15:11,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:11,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:11,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:11,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 05:15:11,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 05:15:11,952 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash 25076559, now seen corresponding path program 3 times [2022-12-13 05:15:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:11,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18324139] [2022-12-13 05:15:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:12,080 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-13 05:15:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:12,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18324139] [2022-12-13 05:15:12,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18324139] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:12,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115217163] [2022-12-13 05:15:12,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:15:12,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:12,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:12,082 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-13 05:15:12,085 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-13 05:15:12,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:15:12,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:12,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 05:15:12,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:12,255 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-13 05:15:12,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:12,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115217163] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:12,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 05:15:12,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2022-12-13 05:15:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753524303] [2022-12-13 05:15:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:12,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:12,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:12,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 05:15:12,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:12,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 444 transitions, 7392 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:12,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:12,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:12,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:12,721 INFO L130 PetriNetUnfolder]: 1926/2709 cut-off events. [2022-12-13 05:15:12,721 INFO L131 PetriNetUnfolder]: For 439/439 co-relation queries the response was YES. [2022-12-13 05:15:12,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24680 conditions, 2709 events. 1926/2709 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10688 event pairs, 0 based on Foata normal form. 32/1883 useless extension candidates. Maximal degree in co-relation 23119. Up to 2691 conditions per place. [2022-12-13 05:15:12,742 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 462 selfloop transitions, 24 changer transitions 32/518 dead transitions. [2022-12-13 05:15:12,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 518 transitions, 9636 flow [2022-12-13 05:15:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 05:15:12,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.59 [2022-12-13 05:15:12,747 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-12-13 05:15:12,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 518 transitions, 9636 flow [2022-12-13 05:15:12,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 486 transitions, 9057 flow [2022-12-13 05:15:12,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:12,786 INFO L89 Accepts]: Start accepts. Operand has 58 places, 486 transitions, 9057 flow [2022-12-13 05:15:12,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:12,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:12,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 486 transitions, 9057 flow [2022-12-13 05:15:12,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 486 transitions, 9057 flow [2022-12-13 05:15:12,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:12,805 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:12,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 05:15:12,807 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 486 transitions, 9057 flow [2022-12-13 05:15:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:12,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:12,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:12,814 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-13 05:15:13,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:13,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1502298727, now seen corresponding path program 1 times [2022-12-13 05:15:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:13,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512765298] [2022-12-13 05:15:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:15:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:13,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512765298] [2022-12-13 05:15:13,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512765298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:13,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:13,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 05:15:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882279689] [2022-12-13 05:15:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:13,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:15:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:15:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:15:13,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:13,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 486 transitions, 9057 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:13,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:13,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:13,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:13,555 INFO L130 PetriNetUnfolder]: 1475/2040 cut-off events. [2022-12-13 05:15:13,555 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-13 05:15:13,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20624 conditions, 2040 events. 1475/2040 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7239 event pairs, 0 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 19472. Up to 2025 conditions per place. [2022-12-13 05:15:13,573 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 393 selfloop transitions, 27 changer transitions 0/420 dead transitions. [2022-12-13 05:15:13,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 05:15:13,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-13 05:15:13,575 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-12-13 05:15:13,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:13,605 INFO L89 Accepts]: Start accepts. Operand has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:13,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:13,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:13,618 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:13,619 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 05:15:13,619 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 420 transitions, 8643 flow [2022-12-13 05:15:13,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:13,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:13,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:13,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 05:15:13,620 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1330841770, now seen corresponding path program 1 times [2022-12-13 05:15:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:13,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525023856] [2022-12-13 05:15:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:13,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525023856] [2022-12-13 05:15:13,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525023856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:15:13,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:15:13,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 05:15:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609938537] [2022-12-13 05:15:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:15:13,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:15:13,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:13,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 420 transitions, 8643 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:13,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:13,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:13,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:14,043 INFO L130 PetriNetUnfolder]: 1309/1794 cut-off events. [2022-12-13 05:15:14,044 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-12-13 05:15:14,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19931 conditions, 1794 events. 1309/1794 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6028 event pairs, 0 based on Foata normal form. 4/1284 useless extension candidates. Maximal degree in co-relation 18826. Up to 1779 conditions per place. [2022-12-13 05:15:14,059 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 327 selfloop transitions, 22 changer transitions 4/353 dead transitions. [2022-12-13 05:15:14,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 353 transitions, 7970 flow [2022-12-13 05:15:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:15:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:15:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 05:15:14,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.496 [2022-12-13 05:15:14,061 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-13 05:15:14,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 353 transitions, 7970 flow [2022-12-13 05:15:14,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 349 transitions, 7879 flow [2022-12-13 05:15:14,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:14,089 INFO L89 Accepts]: Start accepts. Operand has 62 places, 349 transitions, 7879 flow [2022-12-13 05:15:14,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:14,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:14,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 349 transitions, 7879 flow [2022-12-13 05:15:14,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 349 transitions, 7879 flow [2022-12-13 05:15:14,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:14,101 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:14,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 05:15:14,102 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 349 transitions, 7879 flow [2022-12-13 05:15:14,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:14,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:14,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 05:15:14,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -20347669, now seen corresponding path program 1 times [2022-12-13 05:15:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:14,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704949753] [2022-12-13 05:15:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:14,225 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-13 05:15:14,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:14,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704949753] [2022-12-13 05:15:14,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704949753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:14,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373514403] [2022-12-13 05:15:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:14,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:14,227 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-13 05:15:14,252 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-13 05:15:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:14,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 05:15:14,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:15:14,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:14,437 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-13 05:15:14,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373514403] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:15:14,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:15:14,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2022-12-13 05:15:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220659268] [2022-12-13 05:15:14,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:15:14,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 05:15:14,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 05:15:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 05:15:14,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:14,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 349 transitions, 7879 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:14,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:14,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:14,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:15,032 INFO L130 PetriNetUnfolder]: 3168/4480 cut-off events. [2022-12-13 05:15:15,032 INFO L131 PetriNetUnfolder]: For 683/683 co-relation queries the response was YES. [2022-12-13 05:15:15,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54241 conditions, 4480 events. 3168/4480 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19788 event pairs, 0 based on Foata normal form. 165/3445 useless extension candidates. Maximal degree in co-relation 51395. Up to 4472 conditions per place. [2022-12-13 05:15:15,096 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 614 selfloop transitions, 116 changer transitions 110/840 dead transitions. [2022-12-13 05:15:15,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 840 transitions, 20655 flow [2022-12-13 05:15:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 05:15:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 05:15:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 05:15:15,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71 [2022-12-13 05:15:15,097 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-13 05:15:15,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 840 transitions, 20655 flow [2022-12-13 05:15:15,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 730 transitions, 17919 flow [2022-12-13 05:15:15,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:15,235 INFO L89 Accepts]: Start accepts. Operand has 65 places, 730 transitions, 17919 flow [2022-12-13 05:15:15,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:15,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:15,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 730 transitions, 17919 flow [2022-12-13 05:15:15,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 730 transitions, 17919 flow [2022-12-13 05:15:15,260 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:15,263 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:15,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 05:15:15,264 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 730 transitions, 17919 flow [2022-12-13 05:15:15,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:15,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:15,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:15,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 05:15:15,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:15,471 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1811282133, now seen corresponding path program 2 times [2022-12-13 05:15:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:15,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059588252] [2022-12-13 05:15:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:15,591 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-13 05:15:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059588252] [2022-12-13 05:15:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059588252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:15,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431358365] [2022-12-13 05:15:15,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:15:15,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:15,593 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-13 05:15:15,596 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-13 05:15:15,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:15:15,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:15,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 05:15:15,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:15,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-13 05:15:15,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:15,807 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-13 05:15:15,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431358365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:15:15,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:15:15,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 05:15:15,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877314743] [2022-12-13 05:15:15,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:15:15,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:15:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:15,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:15:15,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:15:15,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:15,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 730 transitions, 17919 flow. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:15,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:15,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:15,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:17,472 INFO L130 PetriNetUnfolder]: 5932/8370 cut-off events. [2022-12-13 05:15:17,472 INFO L131 PetriNetUnfolder]: For 1200/1200 co-relation queries the response was YES. [2022-12-13 05:15:17,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109669 conditions, 8370 events. 5932/8370 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 40938 event pairs, 0 based on Foata normal form. 165/6367 useless extension candidates. Maximal degree in co-relation 104486. Up to 8362 conditions per place. [2022-12-13 05:15:17,538 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 1074 selfloop transitions, 322 changer transitions 131/1527 dead transitions. [2022-12-13 05:15:17,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 1527 transitions, 40560 flow [2022-12-13 05:15:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:15:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:15:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 05:15:17,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.752 [2022-12-13 05:15:17,539 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-12-13 05:15:17,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 1527 transitions, 40560 flow [2022-12-13 05:15:17,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 1396 transitions, 37046 flow [2022-12-13 05:15:17,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:17,662 INFO L89 Accepts]: Start accepts. Operand has 69 places, 1396 transitions, 37046 flow [2022-12-13 05:15:17,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:17,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:17,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 1396 transitions, 37046 flow [2022-12-13 05:15:17,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 1396 transitions, 37046 flow [2022-12-13 05:15:17,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:17,718 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:17,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 05:15:17,719 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 1396 transitions, 37046 flow [2022-12-13 05:15:17,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:17,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:17,719 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:17,728 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-13 05:15:17,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 05:15:17,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash -146503464, now seen corresponding path program 3 times [2022-12-13 05:15:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:17,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437746954] [2022-12-13 05:15:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:18,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437746954] [2022-12-13 05:15:18,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437746954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:18,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240151983] [2022-12-13 05:15:18,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 05:15:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:18,085 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-13 05:15:18,087 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-13 05:15:18,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 05:15:18,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:18,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 05:15:18,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:18,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:18,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240151983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:15:18,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:15:18,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 05:15:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760696879] [2022-12-13 05:15:18,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:15:18,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 05:15:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 05:15:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-13 05:15:18,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:18,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 1396 transitions, 37046 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:18,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:18,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:18,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:22,486 INFO L130 PetriNetUnfolder]: 11181/15764 cut-off events. [2022-12-13 05:15:22,486 INFO L131 PetriNetUnfolder]: For 2240/2240 co-relation queries the response was YES. [2022-12-13 05:15:22,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222237 conditions, 15764 events. 11181/15764 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 85516 event pairs, 0 based on Foata normal form. 262/11954 useless extension candidates. Maximal degree in co-relation 214965. Up to 15756 conditions per place. [2022-12-13 05:15:22,610 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 2687 selfloop transitions, 401 changer transitions 446/3534 dead transitions. [2022-12-13 05:15:22,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 3534 transitions, 100770 flow [2022-12-13 05:15:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 05:15:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 05:15:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 197 transitions. [2022-12-13 05:15:22,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4925 [2022-12-13 05:15:22,612 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2022-12-13 05:15:22,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 3534 transitions, 100770 flow [2022-12-13 05:15:22,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 3088 transitions, 87955 flow [2022-12-13 05:15:22,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:22,823 INFO L89 Accepts]: Start accepts. Operand has 83 places, 3088 transitions, 87955 flow [2022-12-13 05:15:22,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:22,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:22,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 3088 transitions, 87955 flow [2022-12-13 05:15:23,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 3088 transitions, 87955 flow [2022-12-13 05:15:23,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:23,011 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:23,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 05:15:23,012 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 3088 transitions, 87955 flow [2022-12-13 05:15:23,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:23,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:23,012 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:23,019 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-13 05:15:23,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:23,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1948020663, now seen corresponding path program 4 times [2022-12-13 05:15:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:23,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204927612] [2022-12-13 05:15:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:23,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:23,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204927612] [2022-12-13 05:15:23,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204927612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:23,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971741587] [2022-12-13 05:15:23,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 05:15:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:23,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:23,385 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-13 05:15:23,388 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-13 05:15:23,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 05:15:23,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:23,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 05:15:23,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:23,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:23,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971741587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:15:23,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:15:23,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 05:15:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270944904] [2022-12-13 05:15:23,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:15:23,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 05:15:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 05:15:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-13 05:15:23,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:23,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 3088 transitions, 87955 flow. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:23,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:23,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:23,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:15:40,906 INFO L130 PetriNetUnfolder]: 25820/36509 cut-off events. [2022-12-13 05:15:40,906 INFO L131 PetriNetUnfolder]: For 5216/5216 co-relation queries the response was YES. [2022-12-13 05:15:40,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550555 conditions, 36509 events. 25820/36509 cut-off events. For 5216/5216 co-relation queries the response was YES. Maximal size of possible extension queue 1554. Compared 225720 event pairs, 0 based on Foata normal form. 1476/29523 useless extension candidates. Maximal degree in co-relation 535772. Up to 36501 conditions per place. [2022-12-13 05:15:41,213 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 6736 selfloop transitions, 1564 changer transitions 747/9047 dead transitions. [2022-12-13 05:15:41,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 9047 transitions, 275661 flow [2022-12-13 05:15:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 05:15:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 05:15:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 443 transitions. [2022-12-13 05:15:41,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4789189189189189 [2022-12-13 05:15:41,216 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 85 predicate places. [2022-12-13 05:15:41,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 9047 transitions, 275661 flow [2022-12-13 05:15:41,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 8300 transitions, 252705 flow [2022-12-13 05:15:41,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:15:41,877 INFO L89 Accepts]: Start accepts. Operand has 119 places, 8300 transitions, 252705 flow [2022-12-13 05:15:41,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:15:41,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:15:41,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 8300 transitions, 252705 flow [2022-12-13 05:15:42,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 8300 transitions, 252705 flow [2022-12-13 05:15:42,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:15:42,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:15:42,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 395 [2022-12-13 05:15:42,272 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 8300 transitions, 252705 flow [2022-12-13 05:15:42,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 14 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:42,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:15:42,272 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:15:42,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 05:15:42,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:42,478 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:15:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:15:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash 122835702, now seen corresponding path program 5 times [2022-12-13 05:15:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:15:42,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378191317] [2022-12-13 05:15:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:15:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:15:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:15:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:15:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:15:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378191317] [2022-12-13 05:15:42,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378191317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:15:42,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836747470] [2022-12-13 05:15:42,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 05:15:42,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:15:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:15:42,647 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-13 05:15:42,649 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-13 05:15:42,747 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 05:15:42,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:15:42,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 05:15:42,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:15:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:15:42,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:15:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 05:15:42,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836747470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:15:42,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:15:42,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-12-13 05:15:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004276868] [2022-12-13 05:15:42,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:15:42,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 05:15:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:15:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 05:15:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-13 05:15:42,934 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:15:42,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 8300 transitions, 252705 flow. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:15:42,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:15:42,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:15:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:18:42,079 INFO L130 PetriNetUnfolder]: 65991/94040 cut-off events. [2022-12-13 05:18:42,079 INFO L131 PetriNetUnfolder]: For 14113/14113 co-relation queries the response was YES. [2022-12-13 05:18:42,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512499 conditions, 94040 events. 65991/94040 cut-off events. For 14113/14113 co-relation queries the response was YES. Maximal size of possible extension queue 3849. Compared 665611 event pairs, 0 based on Foata normal form. 1248/73040 useless extension candidates. Maximal degree in co-relation 1468162. Up to 94032 conditions per place. [2022-12-13 05:18:43,268 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 21477 selfloop transitions, 4662 changer transitions 1142/27281 dead transitions. [2022-12-13 05:18:43,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 27281 transitions, 886300 flow [2022-12-13 05:18:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 05:18:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 05:18:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 369 transitions. [2022-12-13 05:18:43,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5089655172413793 [2022-12-13 05:18:43,270 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 113 predicate places. [2022-12-13 05:18:43,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 27281 transitions, 886300 flow [2022-12-13 05:18:44,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 26139 transitions, 848826 flow [2022-12-13 05:18:45,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:18:45,434 INFO L89 Accepts]: Start accepts. Operand has 147 places, 26139 transitions, 848826 flow [2022-12-13 05:18:45,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:18:45,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:18:45,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 26139 transitions, 848826 flow [2022-12-13 05:18:47,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 26139 transitions, 848826 flow [2022-12-13 05:18:47,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:18:47,906 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:18:47,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2473 [2022-12-13 05:18:47,906 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 26139 transitions, 848826 flow [2022-12-13 05:18:47,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:18:47,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:18:47,906 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:18:47,911 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-13 05:18:48,107 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,SelfDestructingSolverStorable14 [2022-12-13 05:18:48,107 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 05:18:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:18:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1557053175, now seen corresponding path program 6 times [2022-12-13 05:18:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:18:48,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240546536] [2022-12-13 05:18:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:18:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:18:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:18:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:18:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:18:48,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240546536] [2022-12-13 05:18:48,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240546536] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:18:48,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142117819] [2022-12-13 05:18:48,254 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 05:18:48,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:18:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:18:48,256 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-13 05:18:48,259 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-13 05:18:48,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 05:18:48,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:18:48,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 05:18:48,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:18:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:18:48,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:18:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 05:18:48,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142117819] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:18:48,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:18:48,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 05:18:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927179918] [2022-12-13 05:18:48,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:18:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 05:18:48,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:18:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 05:18:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-13 05:18:48,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 05:18:48,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 26139 transitions, 848826 flow. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:18:48,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:18:48,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 05:18:48,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 05:28:51,092 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:28:51,093 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-13 05:28:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 05:28:51,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 05:28:51,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 05:28:51,511 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,SelfDestructingSolverStorable15 [2022-12-13 05:28:51,511 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1667401 conditions, 97703 events (71767/97702 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 684474 event pairs, 22 based on Foata normal form. 439/76977 useless extension candidates. Maximal degree in co-relation 1661676. Up to 97694 conditions per place.). [2022-12-13 05:28:51,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 05:28:51,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 05:28:51,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 05:28:51,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 05:28:51,513 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 3, 1, 1, 1] [2022-12-13 05:28:51,516 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:28:51,516 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:28:51,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:28:51 BasicIcfg [2022-12-13 05:28:51,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:28:51,518 INFO L158 Benchmark]: Toolchain (without parser) took 829315.38ms. Allocated memory was 205.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 165.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-12-13 05:28:51,519 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 205.5MB. Free memory was 181.2MB in the beginning and 181.1MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:28:51,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.35ms. Allocated memory is still 205.5MB. Free memory was 164.7MB in the beginning and 152.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 05:28:51,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.41ms. Allocated memory is still 205.5MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 05:28:51,519 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 205.5MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 05:28:51,519 INFO L158 Benchmark]: RCFGBuilder took 537.44ms. Allocated memory is still 205.5MB. Free memory was 149.5MB in the beginning and 129.0MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 05:28:51,520 INFO L158 Benchmark]: TraceAbstraction took 828436.24ms. Allocated memory was 205.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 127.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2022-12-13 05:28:51,521 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.15ms. Allocated memory is still 205.5MB. Free memory was 181.2MB in the beginning and 181.1MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.35ms. Allocated memory is still 205.5MB. Free memory was 164.7MB in the beginning and 152.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.41ms. Allocated memory is still 205.5MB. Free memory was 152.6MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 205.5MB. Free memory was 151.1MB in the beginning and 149.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.44ms. Allocated memory is still 205.5MB. Free memory was 149.5MB in the beginning and 129.0MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 828436.24ms. Allocated memory was 205.5MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 127.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 111 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 48 TrivialYvCompositions, 29 ConcurrentYvCompositions, 6 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 654, independent: 654, independent conditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 654, independent conditional: 0, independent unconditional: 654, 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: 654, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1066, Positive conditional cache size: 0, Positive unconditional cache size: 1066, 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, 36 PlacesBefore, 36 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 334 TransitionsBefore, 334 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 318 TransitionsBefore, 318 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 444 TransitionsBefore, 444 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 486 TransitionsBefore, 486 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 420 TransitionsBefore, 420 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 349 TransitionsBefore, 349 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 730 TransitionsBefore, 730 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 1396 TransitionsBefore, 1396 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 3088 TransitionsBefore, 3088 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 8300 TransitionsBefore, 8300 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 147 PlacesBefore, 147 PlacesAfterwards, 26139 TransitionsBefore, 26139 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1667401 conditions, 97703 events (71767/97702 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 684474 event pairs, 22 based on Foata normal form. 439/76977 useless extension candidates. Maximal degree in co-relation 1661676. Up to 97694 conditions per place.). - TimeoutResultAtElement [Line: 97]: 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 (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1667401 conditions, 97703 events (71767/97702 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 684474 event pairs, 22 based on Foata normal form. 439/76977 useless extension candidates. Maximal degree in co-relation 1661676. Up to 97694 conditions per place.). - TimeoutResultAtElement [Line: 98]: 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 (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1667401 conditions, 97703 events (71767/97702 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 684474 event pairs, 22 based on Foata normal form. 439/76977 useless extension candidates. Maximal degree in co-relation 1661676. Up to 97694 conditions per place.). - TimeoutResultAtElement [Line: 96]: 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 (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1667401 conditions, 97703 events (71767/97702 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 684474 event pairs, 22 based on Foata normal form. 439/76977 useless extension candidates. Maximal degree in co-relation 1661676. Up to 97694 conditions per place.). - TimeoutResultAtElement [Line: 95]: 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 (13states, 0/25 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 1667401 conditions, 97703 events (71767/97702 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 6261. Compared 684474 event pairs, 22 based on Foata normal form. 439/76977 useless extension candidates. Maximal degree in co-relation 1661676. Up to 97694 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 139 locations, 5 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: 828.3s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 810.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2115 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2115 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3229 IncrementalHoareTripleChecker+Invalid, 3476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 0 mSDtfsCounter, 3229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 362 SyntacticMatches, 18 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848826occurred in iteration=15, InterpolantAutomatonStates: 133, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 761 ConstructedInterpolants, 0 QuantifiedInterpolants, 4909 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2096 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 63/113 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