/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:37:29,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:37:29,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:37:29,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:37:29,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:37:29,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:37:29,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:37:29,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:37:29,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:37:29,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:37:29,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:37:29,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:37:29,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:37:29,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:37:29,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:37:29,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:37:29,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:37:29,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:37:29,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:37:29,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:37:29,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:37:29,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:37:29,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:37:29,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:37:29,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:37:29,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:37:29,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:37:29,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:37:29,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:37:29,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:37:29,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:37:29,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:37:29,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:37:29,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:37:29,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:37:29,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:37:29,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:37:29,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:37:29,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:37:29,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:37:29,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:37:29,325 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:37:29,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:37:29,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:37:29,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:37:29,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:37:29,358 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:37:29,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:37:29,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:37:29,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:37:29,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:37:29,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:37:29,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:37:29,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:37:29,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:37:29,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:37:29,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:37:29,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:37:29,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:37:29,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:37:29,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:37:29,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:37:29,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:37:29,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:37:29,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:37:29,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:37:29,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:37:29,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:37:29,700 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:37:29,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-12-06 05:37:30,791 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:37:31,000 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:37:31,001 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-12-06 05:37:31,006 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabc7f5e1/6ccf63db27e6469aa9cb13ac3beb66be/FLAG15a223337 [2022-12-06 05:37:31,016 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabc7f5e1/6ccf63db27e6469aa9cb13ac3beb66be [2022-12-06 05:37:31,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:37:31,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:37:31,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:37:31,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:37:31,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:37:31,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3b6128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31, skipping insertion in model container [2022-12-06 05:37:31,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:37:31,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:37:31,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:31,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:31,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:31,168 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-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-12-06 05:37:31,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:37:31,182 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:37:31,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:31,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:31,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:37:31,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:37:31,211 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-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-12-06 05:37:31,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:37:31,229 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:37:31,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31 WrapperNode [2022-12-06 05:37:31,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:37:31,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:37:31,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:37:31,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:37:31,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,263 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-12-06 05:37:31,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:37:31,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:37:31,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:37:31,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:37:31,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,296 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:37:31,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:37:31,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:37:31,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:37:31,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (1/1) ... [2022-12-06 05:37:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:37:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:31,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:37:31,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:37:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:37:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:37:31,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:37:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:37:31,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:37:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:37:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:37:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:37:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:37:31,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:37:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:37:31,374 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:37:31,474 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:37:31,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:37:31,646 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:37:31,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:37:31,696 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 05:37:31,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:37:31 BoogieIcfgContainer [2022-12-06 05:37:31,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:37:31,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:37:31,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:37:31,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:37:31,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:37:31" (1/3) ... [2022-12-06 05:37:31,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7134c7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:37:31, skipping insertion in model container [2022-12-06 05:37:31,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:37:31" (2/3) ... [2022-12-06 05:37:31,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7134c7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:37:31, skipping insertion in model container [2022-12-06 05:37:31,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:37:31" (3/3) ... [2022-12-06 05:37:31,706 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2022-12-06 05:37:31,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:37:31,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:37:31,723 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:37:31,802 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:37:31,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 79 transitions, 174 flow [2022-12-06 05:37:31,914 INFO L130 PetriNetUnfolder]: 6/77 cut-off events. [2022-12-06 05:37:31,914 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:37:31,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 77 events. 6/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 05:37:31,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 79 transitions, 174 flow [2022-12-06 05:37:31,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 69 transitions, 150 flow [2022-12-06 05:37:31,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:31,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 69 transitions, 150 flow [2022-12-06 05:37:31,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 69 transitions, 150 flow [2022-12-06 05:37:31,999 INFO L130 PetriNetUnfolder]: 6/69 cut-off events. [2022-12-06 05:37:31,999 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:37:32,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 69 events. 6/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 05:37:32,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 69 transitions, 150 flow [2022-12-06 05:37:32,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 05:37:34,341 INFO L203 LiptonReduction]: Total number of compositions: 54 [2022-12-06 05:37:34,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:37:34,362 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;@508c4f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:37:34,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:37:34,366 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 05:37:34,366 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:37:34,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:34,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:34,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1884038689, now seen corresponding path program 1 times [2022-12-06 05:37:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:34,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57467656] [2022-12-06 05:37:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:34,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57467656] [2022-12-06 05:37:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57467656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:34,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:34,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47399594] [2022-12-06 05:37:34,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:34,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:34,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:34,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 05:37:34,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:34,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:34,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 05:37:34,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:34,853 INFO L130 PetriNetUnfolder]: 59/100 cut-off events. [2022-12-06 05:37:34,853 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:37:34,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 100 events. 59/100 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 232 event pairs, 23 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 165. Up to 78 conditions per place. [2022-12-06 05:37:34,855 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 17 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-06 05:37:34,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 97 flow [2022-12-06 05:37:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 05:37:34,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:37:34,868 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 4 states and 25 transitions. [2022-12-06 05:37:34,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 21 transitions, 97 flow [2022-12-06 05:37:34,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 21 transitions, 87 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:34,874 INFO L231 Difference]: Finished difference. Result has 20 places, 16 transitions, 48 flow [2022-12-06 05:37:34,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=48, PETRI_PLACES=20, PETRI_TRANSITIONS=16} [2022-12-06 05:37:34,880 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2022-12-06 05:37:34,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:34,881 INFO L89 Accepts]: Start accepts. Operand has 20 places, 16 transitions, 48 flow [2022-12-06 05:37:34,883 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:34,883 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:34,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 48 flow [2022-12-06 05:37:34,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 48 flow [2022-12-06 05:37:34,889 INFO L130 PetriNetUnfolder]: 2/16 cut-off events. [2022-12-06 05:37:34,889 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:37:34,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 2/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 4 conditions per place. [2022-12-06 05:37:34,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 48 flow [2022-12-06 05:37:34,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 05:37:34,980 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:34,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 05:37:34,982 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 44 flow [2022-12-06 05:37:34,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:34,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:34,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:34,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:37:34,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash -868942042, now seen corresponding path program 1 times [2022-12-06 05:37:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:34,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319557026] [2022-12-06 05:37:34,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:34,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:35,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319557026] [2022-12-06 05:37:35,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319557026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:35,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:35,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48077694] [2022-12-06 05:37:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:35,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:35,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 05:37:35,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:35,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:35,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 05:37:35,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:35,181 INFO L130 PetriNetUnfolder]: 57/105 cut-off events. [2022-12-06 05:37:35,181 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-06 05:37:35,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 105 events. 57/105 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 264 event pairs, 11 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 75. Up to 63 conditions per place. [2022-12-06 05:37:35,182 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 23 selfloop transitions, 5 changer transitions 6/35 dead transitions. [2022-12-06 05:37:35,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 35 transitions, 164 flow [2022-12-06 05:37:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:37:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:37:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 05:37:35,184 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 05:37:35,184 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 44 flow. Second operand 5 states and 41 transitions. [2022-12-06 05:37:35,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 35 transitions, 164 flow [2022-12-06 05:37:35,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 35 transitions, 146 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:35,186 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 71 flow [2022-12-06 05:37:35,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-06 05:37:35,186 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-06 05:37:35,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:35,187 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 71 flow [2022-12-06 05:37:35,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:35,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:35,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 71 flow [2022-12-06 05:37:35,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 71 flow [2022-12-06 05:37:35,192 INFO L130 PetriNetUnfolder]: 7/29 cut-off events. [2022-12-06 05:37:35,192 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:37:35,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 29 events. 7/29 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2022-12-06 05:37:35,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 71 flow [2022-12-06 05:37:35,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 05:37:35,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:35,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:37:35,195 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 71 flow [2022-12-06 05:37:35,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:35,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:35,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:37:35,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1452362300, now seen corresponding path program 1 times [2022-12-06 05:37:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:35,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401732936] [2022-12-06 05:37:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:35,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:35,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401732936] [2022-12-06 05:37:35,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401732936] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:37:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987419545] [2022-12-06 05:37:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:35,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:37:35,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:37:35,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:37:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:35,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 05:37:35,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:37:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:35,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:37:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:35,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987419545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:37:35,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:37:35,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 05:37:35,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460788645] [2022-12-06 05:37:35,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:37:35,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:37:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:35,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:37:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:37:35,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:37:35,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 71 flow. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:35,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:35,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:37:35,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:36,410 INFO L130 PetriNetUnfolder]: 129/243 cut-off events. [2022-12-06 05:37:36,411 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 05:37:36,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 243 events. 129/243 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 860 event pairs, 12 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 285. Up to 73 conditions per place. [2022-12-06 05:37:36,413 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 45 selfloop transitions, 23 changer transitions 30/98 dead transitions. [2022-12-06 05:37:36,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 98 transitions, 510 flow [2022-12-06 05:37:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:37:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:37:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2022-12-06 05:37:36,415 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4488888888888889 [2022-12-06 05:37:36,415 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 71 flow. Second operand 15 states and 101 transitions. [2022-12-06 05:37:36,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 98 transitions, 510 flow [2022-12-06 05:37:36,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 98 transitions, 496 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:36,418 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 233 flow [2022-12-06 05:37:36,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=233, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2022-12-06 05:37:36,419 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2022-12-06 05:37:36,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:36,420 INFO L89 Accepts]: Start accepts. Operand has 45 places, 36 transitions, 233 flow [2022-12-06 05:37:36,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:36,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:36,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 233 flow [2022-12-06 05:37:36,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 233 flow [2022-12-06 05:37:36,428 INFO L130 PetriNetUnfolder]: 18/63 cut-off events. [2022-12-06 05:37:36,428 INFO L131 PetriNetUnfolder]: For 72/73 co-relation queries the response was YES. [2022-12-06 05:37:36,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 63 events. 18/63 cut-off events. For 72/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 196 event pairs, 1 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 177. Up to 17 conditions per place. [2022-12-06 05:37:36,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 233 flow [2022-12-06 05:37:36,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 05:37:36,456 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:36,457 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:36,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [289] L54-1-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_2 v_~M2~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2, ~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:37:36,780 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:37:36,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 05:37:36,782 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 231 flow [2022-12-06 05:37:36,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:36,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:36,782 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:36,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:37:36,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:37:36,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash -246631895, now seen corresponding path program 1 times [2022-12-06 05:37:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:36,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435091337] [2022-12-06 05:37:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435091337] [2022-12-06 05:37:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435091337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:37,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:37,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531561778] [2022-12-06 05:37:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:37,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:37,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:37,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:37,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:37:37,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 231 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:37,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:37,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:37:37,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:37,347 INFO L130 PetriNetUnfolder]: 130/244 cut-off events. [2022-12-06 05:37:37,347 INFO L131 PetriNetUnfolder]: For 535/535 co-relation queries the response was YES. [2022-12-06 05:37:37,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 244 events. 130/244 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 827 event pairs, 17 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 974. Up to 151 conditions per place. [2022-12-06 05:37:37,351 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 48 selfloop transitions, 12 changer transitions 8/68 dead transitions. [2022-12-06 05:37:37,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 516 flow [2022-12-06 05:37:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-06 05:37:37,353 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 05:37:37,353 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 231 flow. Second operand 7 states and 56 transitions. [2022-12-06 05:37:37,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 516 flow [2022-12-06 05:37:37,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 456 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:37,359 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 290 flow [2022-12-06 05:37:37,359 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-06 05:37:37,360 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2022-12-06 05:37:37,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:37,360 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 290 flow [2022-12-06 05:37:37,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:37,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:37,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 290 flow [2022-12-06 05:37:37,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 290 flow [2022-12-06 05:37:37,369 INFO L130 PetriNetUnfolder]: 22/76 cut-off events. [2022-12-06 05:37:37,369 INFO L131 PetriNetUnfolder]: For 115/117 co-relation queries the response was YES. [2022-12-06 05:37:37,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 76 events. 22/76 cut-off events. For 115/117 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 269 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 221. Up to 18 conditions per place. [2022-12-06 05:37:37,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 290 flow [2022-12-06 05:37:37,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 05:37:37,371 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:37,372 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:37,644 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] $Ultimate##0-->L54-1: Formula: (and (< 0 v_~M2~0_61) (let ((.cse0 (< 0 v_~counter~0_86))) (or (and (not .cse0) (= v_~counter~0_86 v_~counter~0_85) (= |v_thread2Thread1of1ForFork1_#t~post4_24| |v_thread2Thread1of1ForFork1_#t~post4_23|) (= v_thread2Thread1of1ForFork1_~i~1_31 0) (= |v_thread2Thread1of1ForFork1_#t~post3_24| |v_thread2Thread1of1ForFork1_#t~post3_23|)) (and .cse0 (= v_~counter~0_86 (+ v_~counter~0_85 1)) (= v_thread2Thread1of1ForFork1_~i~1_31 1))))) InVars {~counter~0=v_~counter~0_86, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_24|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_24|, ~M2~0=v_~M2~0_61} OutVars{~counter~0=v_~counter~0_85, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_31, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_23|, ~M2~0=v_~M2~0_61} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:37:37,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [289] L54-1-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_2 v_~M2~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2, ~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:37:37,822 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:37,823 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-06 05:37:37,824 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 308 flow [2022-12-06 05:37:37,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:37,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:37,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:37,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:37:37,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:37,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1768575433, now seen corresponding path program 2 times [2022-12-06 05:37:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:37,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138004734] [2022-12-06 05:37:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:37,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:38,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138004734] [2022-12-06 05:37:38,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138004734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:38,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:38,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355983727] [2022-12-06 05:37:38,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:38,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:38,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:38,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 308 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:38,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:38,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:38,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:38,232 INFO L130 PetriNetUnfolder]: 125/233 cut-off events. [2022-12-06 05:37:38,233 INFO L131 PetriNetUnfolder]: For 515/515 co-relation queries the response was YES. [2022-12-06 05:37:38,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 233 events. 125/233 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 793 event pairs, 13 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 941. Up to 147 conditions per place. [2022-12-06 05:37:38,235 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 40 selfloop transitions, 11 changer transitions 13/64 dead transitions. [2022-12-06 05:37:38,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 64 transitions, 518 flow [2022-12-06 05:37:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-06 05:37:38,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33766233766233766 [2022-12-06 05:37:38,238 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 308 flow. Second operand 7 states and 52 transitions. [2022-12-06 05:37:38,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 64 transitions, 518 flow [2022-12-06 05:37:38,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 470 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:38,243 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 288 flow [2022-12-06 05:37:38,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-06 05:37:38,246 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2022-12-06 05:37:38,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:38,246 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 288 flow [2022-12-06 05:37:38,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:38,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:38,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 288 flow [2022-12-06 05:37:38,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 288 flow [2022-12-06 05:37:38,258 INFO L130 PetriNetUnfolder]: 22/75 cut-off events. [2022-12-06 05:37:38,259 INFO L131 PetriNetUnfolder]: For 125/128 co-relation queries the response was YES. [2022-12-06 05:37:38,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 75 events. 22/75 cut-off events. For 125/128 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 257 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 223. Up to 17 conditions per place. [2022-12-06 05:37:38,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 288 flow [2022-12-06 05:37:38,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 05:37:38,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:38,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-06 05:37:38,382 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 280 flow [2022-12-06 05:37:38,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:38,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:38,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:38,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:37:38,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1873416882, now seen corresponding path program 1 times [2022-12-06 05:37:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:38,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178900448] [2022-12-06 05:37:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:38,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178900448] [2022-12-06 05:37:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178900448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:38,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488431415] [2022-12-06 05:37:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:38,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:38,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:38,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:38,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:38,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:38,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 280 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:38,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:38,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:38,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:38,625 INFO L130 PetriNetUnfolder]: 147/269 cut-off events. [2022-12-06 05:37:38,625 INFO L131 PetriNetUnfolder]: For 729/729 co-relation queries the response was YES. [2022-12-06 05:37:38,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 269 events. 147/269 cut-off events. For 729/729 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 912 event pairs, 31 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 1103. Up to 147 conditions per place. [2022-12-06 05:37:38,627 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 47 selfloop transitions, 14 changer transitions 5/66 dead transitions. [2022-12-06 05:37:38,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 539 flow [2022-12-06 05:37:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 05:37:38,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-06 05:37:38,629 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 280 flow. Second operand 6 states and 51 transitions. [2022-12-06 05:37:38,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 539 flow [2022-12-06 05:37:38,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 485 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-06 05:37:38,633 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 325 flow [2022-12-06 05:37:38,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-06 05:37:38,634 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2022-12-06 05:37:38,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:38,634 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 325 flow [2022-12-06 05:37:38,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:38,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:38,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 325 flow [2022-12-06 05:37:38,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 325 flow [2022-12-06 05:37:38,643 INFO L130 PetriNetUnfolder]: 26/87 cut-off events. [2022-12-06 05:37:38,643 INFO L131 PetriNetUnfolder]: For 135/137 co-relation queries the response was YES. [2022-12-06 05:37:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 87 events. 26/87 cut-off events. For 135/137 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 313 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 266. Up to 19 conditions per place. [2022-12-06 05:37:38,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 325 flow [2022-12-06 05:37:38,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 05:37:38,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:38,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 05:37:38,758 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 321 flow [2022-12-06 05:37:38,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:38,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:38,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:38,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:37:38,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -674199079, now seen corresponding path program 1 times [2022-12-06 05:37:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:38,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728968952] [2022-12-06 05:37:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:38,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:38,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728968952] [2022-12-06 05:37:38,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728968952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:38,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:38,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997193206] [2022-12-06 05:37:38,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:38,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:38,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:38,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 05:37:38,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:38,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:38,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 05:37:38,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:38,986 INFO L130 PetriNetUnfolder]: 194/352 cut-off events. [2022-12-06 05:37:38,986 INFO L131 PetriNetUnfolder]: For 842/842 co-relation queries the response was YES. [2022-12-06 05:37:38,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 352 events. 194/352 cut-off events. For 842/842 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1364 event pairs, 33 based on Foata normal form. 22/374 useless extension candidates. Maximal degree in co-relation 1379. Up to 117 conditions per place. [2022-12-06 05:37:38,989 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 49 selfloop transitions, 30 changer transitions 4/84 dead transitions. [2022-12-06 05:37:38,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 666 flow [2022-12-06 05:37:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-06 05:37:38,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2022-12-06 05:37:38,991 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 321 flow. Second operand 7 states and 72 transitions. [2022-12-06 05:37:38,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 666 flow [2022-12-06 05:37:38,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 84 transitions, 613 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:38,997 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 437 flow [2022-12-06 05:37:38,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2022-12-06 05:37:38,997 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2022-12-06 05:37:38,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:38,998 INFO L89 Accepts]: Start accepts. Operand has 48 places, 51 transitions, 437 flow [2022-12-06 05:37:38,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:38,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:38,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 51 transitions, 437 flow [2022-12-06 05:37:39,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 437 flow [2022-12-06 05:37:39,013 INFO L130 PetriNetUnfolder]: 33/112 cut-off events. [2022-12-06 05:37:39,013 INFO L131 PetriNetUnfolder]: For 280/281 co-relation queries the response was YES. [2022-12-06 05:37:39,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 112 events. 33/112 cut-off events. For 280/281 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 348. Up to 29 conditions per place. [2022-12-06 05:37:39,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 51 transitions, 437 flow [2022-12-06 05:37:39,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:37:39,016 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:39,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 05:37:39,017 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 51 transitions, 437 flow [2022-12-06 05:37:39,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:39,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:39,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:37:39,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1844787731, now seen corresponding path program 1 times [2022-12-06 05:37:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:39,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296759704] [2022-12-06 05:37:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296759704] [2022-12-06 05:37:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296759704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:39,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988773001] [2022-12-06 05:37:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:39,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:39,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:39,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:39,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:37:39,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 437 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:39,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:37:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:39,295 INFO L130 PetriNetUnfolder]: 199/367 cut-off events. [2022-12-06 05:37:39,295 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-12-06 05:37:39,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 367 events. 199/367 cut-off events. For 1303/1303 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1418 event pairs, 39 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1110. Up to 245 conditions per place. [2022-12-06 05:37:39,298 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 58 selfloop transitions, 14 changer transitions 8/80 dead transitions. [2022-12-06 05:37:39,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 717 flow [2022-12-06 05:37:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 05:37:39,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-06 05:37:39,300 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 437 flow. Second operand 7 states and 55 transitions. [2022-12-06 05:37:39,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 717 flow [2022-12-06 05:37:39,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 672 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:39,305 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 451 flow [2022-12-06 05:37:39,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 05:37:39,305 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 35 predicate places. [2022-12-06 05:37:39,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:39,306 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 451 flow [2022-12-06 05:37:39,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:39,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:39,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 451 flow [2022-12-06 05:37:39,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 451 flow [2022-12-06 05:37:39,317 INFO L130 PetriNetUnfolder]: 31/112 cut-off events. [2022-12-06 05:37:39,318 INFO L131 PetriNetUnfolder]: For 267/269 co-relation queries the response was YES. [2022-12-06 05:37:39,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 112 events. 31/112 cut-off events. For 267/269 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 486 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 364. Up to 23 conditions per place. [2022-12-06 05:37:39,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 451 flow [2022-12-06 05:37:39,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:37:39,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:39,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 05:37:39,441 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 445 flow [2022-12-06 05:37:39,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:39,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:39,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:37:39,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:39,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1816158580, now seen corresponding path program 1 times [2022-12-06 05:37:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:39,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052485406] [2022-12-06 05:37:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:39,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:39,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052485406] [2022-12-06 05:37:39,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052485406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:39,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:39,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145140715] [2022-12-06 05:37:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:39,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:39,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:39,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:39,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:37:39,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 445 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:39,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:37:39,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:39,704 INFO L130 PetriNetUnfolder]: 199/367 cut-off events. [2022-12-06 05:37:39,705 INFO L131 PetriNetUnfolder]: For 1132/1132 co-relation queries the response was YES. [2022-12-06 05:37:39,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 367 events. 199/367 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1421 event pairs, 39 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1553. Up to 245 conditions per place. [2022-12-06 05:37:39,707 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 58 selfloop transitions, 14 changer transitions 8/80 dead transitions. [2022-12-06 05:37:39,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 720 flow [2022-12-06 05:37:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 05:37:39,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-06 05:37:39,708 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 445 flow. Second operand 7 states and 55 transitions. [2022-12-06 05:37:39,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 720 flow [2022-12-06 05:37:39,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 666 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:39,715 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 445 flow [2022-12-06 05:37:39,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 05:37:39,716 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 35 predicate places. [2022-12-06 05:37:39,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:39,716 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 445 flow [2022-12-06 05:37:39,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:39,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:39,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 445 flow [2022-12-06 05:37:39,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 445 flow [2022-12-06 05:37:39,730 INFO L130 PetriNetUnfolder]: 31/112 cut-off events. [2022-12-06 05:37:39,730 INFO L131 PetriNetUnfolder]: For 245/247 co-relation queries the response was YES. [2022-12-06 05:37:39,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 112 events. 31/112 cut-off events. For 245/247 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 493 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 361. Up to 23 conditions per place. [2022-12-06 05:37:39,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 445 flow [2022-12-06 05:37:39,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:37:39,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:39,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 05:37:39,844 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 439 flow [2022-12-06 05:37:39,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:39,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:39,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:37:39,844 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:39,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1787529429, now seen corresponding path program 1 times [2022-12-06 05:37:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:39,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990600422] [2022-12-06 05:37:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:39,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990600422] [2022-12-06 05:37:39,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990600422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:39,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:39,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185473725] [2022-12-06 05:37:39,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:39,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:39,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:39,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:39,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:37:39,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 439 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:39,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:39,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:37:39,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:40,133 INFO L130 PetriNetUnfolder]: 199/367 cut-off events. [2022-12-06 05:37:40,133 INFO L131 PetriNetUnfolder]: For 1075/1075 co-relation queries the response was YES. [2022-12-06 05:37:40,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 367 events. 199/367 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1423 event pairs, 39 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1548. Up to 245 conditions per place. [2022-12-06 05:37:40,136 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 58 selfloop transitions, 14 changer transitions 8/80 dead transitions. [2022-12-06 05:37:40,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 714 flow [2022-12-06 05:37:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-06 05:37:40,137 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-06 05:37:40,137 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 439 flow. Second operand 7 states and 55 transitions. [2022-12-06 05:37:40,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 714 flow [2022-12-06 05:37:40,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 666 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:40,143 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 445 flow [2022-12-06 05:37:40,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 05:37:40,144 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 35 predicate places. [2022-12-06 05:37:40,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:40,144 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 445 flow [2022-12-06 05:37:40,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:40,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:40,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 445 flow [2022-12-06 05:37:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 445 flow [2022-12-06 05:37:40,155 INFO L130 PetriNetUnfolder]: 31/112 cut-off events. [2022-12-06 05:37:40,155 INFO L131 PetriNetUnfolder]: For 245/247 co-relation queries the response was YES. [2022-12-06 05:37:40,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 112 events. 31/112 cut-off events. For 245/247 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 487 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 361. Up to 23 conditions per place. [2022-12-06 05:37:40,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 445 flow [2022-12-06 05:37:40,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:37:40,261 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:40,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 05:37:40,262 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 439 flow [2022-12-06 05:37:40,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:40,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:40,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:40,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:37:40,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 337454659, now seen corresponding path program 1 times [2022-12-06 05:37:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:40,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919864966] [2022-12-06 05:37:40,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:40,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919864966] [2022-12-06 05:37:40,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919864966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:40,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:40,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845935074] [2022-12-06 05:37:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:40,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:40,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:40,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:40,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:37:40,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 439 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:40,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:40,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:37:40,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:40,565 INFO L130 PetriNetUnfolder]: 214/402 cut-off events. [2022-12-06 05:37:40,565 INFO L131 PetriNetUnfolder]: For 1201/1201 co-relation queries the response was YES. [2022-12-06 05:37:40,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 402 events. 214/402 cut-off events. For 1201/1201 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1639 event pairs, 39 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 1680. Up to 253 conditions per place. [2022-12-06 05:37:40,568 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 62 selfloop transitions, 18 changer transitions 5/85 dead transitions. [2022-12-06 05:37:40,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 765 flow [2022-12-06 05:37:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-12-06 05:37:40,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2022-12-06 05:37:40,570 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 439 flow. Second operand 7 states and 58 transitions. [2022-12-06 05:37:40,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 765 flow [2022-12-06 05:37:40,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 717 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:40,576 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 491 flow [2022-12-06 05:37:40,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=491, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-06 05:37:40,577 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-06 05:37:40,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:40,577 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 491 flow [2022-12-06 05:37:40,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:40,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:40,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 491 flow [2022-12-06 05:37:40,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 491 flow [2022-12-06 05:37:40,590 INFO L130 PetriNetUnfolder]: 37/138 cut-off events. [2022-12-06 05:37:40,590 INFO L131 PetriNetUnfolder]: For 341/344 co-relation queries the response was YES. [2022-12-06 05:37:40,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 138 events. 37/138 cut-off events. For 341/344 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 658 event pairs, 1 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 464. Up to 28 conditions per place. [2022-12-06 05:37:40,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 491 flow [2022-12-06 05:37:40,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:37:40,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [292] L41-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< v_thread1Thread1of1ForFork0_~i~0_In_3 v_~M1~0_In_7)) (= |v_thread1Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_3, ~M1~0=v_~M1~0_In_7} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_3, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_4|, ~M1~0=v_~M1~0_In_7, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-06 05:37:40,727 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:40,728 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 05:37:40,728 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 499 flow [2022-12-06 05:37:40,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:40,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:40,728 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:40,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:37:40,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:40,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1758900278, now seen corresponding path program 1 times [2022-12-06 05:37:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:40,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249582960] [2022-12-06 05:37:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:40,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249582960] [2022-12-06 05:37:40,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249582960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:40,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:40,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859313140] [2022-12-06 05:37:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:40,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:40,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:40,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:40,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:40,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 499 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:40,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:40,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:40,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:40,957 INFO L130 PetriNetUnfolder]: 209/391 cut-off events. [2022-12-06 05:37:40,957 INFO L131 PetriNetUnfolder]: For 1362/1362 co-relation queries the response was YES. [2022-12-06 05:37:40,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 391 events. 209/391 cut-off events. For 1362/1362 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1567 event pairs, 41 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1704. Up to 269 conditions per place. [2022-12-06 05:37:40,960 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 60 selfloop transitions, 14 changer transitions 5/79 dead transitions. [2022-12-06 05:37:40,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 749 flow [2022-12-06 05:37:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-06 05:37:40,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2022-12-06 05:37:40,961 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 499 flow. Second operand 6 states and 50 transitions. [2022-12-06 05:37:40,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 749 flow [2022-12-06 05:37:40,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 707 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:37:40,967 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 497 flow [2022-12-06 05:37:40,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-06 05:37:40,967 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 39 predicate places. [2022-12-06 05:37:40,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:40,968 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 497 flow [2022-12-06 05:37:40,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:40,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:40,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 497 flow [2022-12-06 05:37:40,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 497 flow [2022-12-06 05:37:40,979 INFO L130 PetriNetUnfolder]: 35/134 cut-off events. [2022-12-06 05:37:40,980 INFO L131 PetriNetUnfolder]: For 316/319 co-relation queries the response was YES. [2022-12-06 05:37:40,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 134 events. 35/134 cut-off events. For 316/319 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 650 event pairs, 1 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 441. Up to 26 conditions per place. [2022-12-06 05:37:40,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 497 flow [2022-12-06 05:37:40,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:37:41,089 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:41,090 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:41,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 v_~counter~0_119))) (or (and (= v_~counter~0_117 (+ v_~counter~0_119 1)) (= v_thread2Thread1of1ForFork1_~i~1_47 0) (= |v_thread2Thread1of1ForFork1_#t~post4_42| |v_thread2Thread1of1ForFork1_#t~post4_43|) (= |v_thread2Thread1of1ForFork1_#t~post3_43| |v_thread2Thread1of1ForFork1_#t~post3_42|) (not .cse0)) (and .cse0 (= v_~counter~0_119 v_~counter~0_117) (= v_thread2Thread1of1ForFork1_~i~1_47 1)))) (< 0 v_~M2~0_69) (< v_thread1Thread1of1ForFork0_~i~0_52 v_~M1~0_75) (= (+ v_thread1Thread1of1ForFork0_~i~0_52 1) v_thread1Thread1of1ForFork0_~i~0_51)) InVars {~counter~0=v_~counter~0_119, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_43|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_43|, ~M2~0=v_~M2~0_69, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, ~M1~0=v_~M1~0_75} OutVars{~counter~0=v_~counter~0_117, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_42|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_47, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_42|, ~M2~0=v_~M2~0_69, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_31|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_51, ~M1~0=v_~M1~0_75} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [245] L54-1-->L54-1: Formula: (and (let ((.cse0 (< 0 v_~counter~0_42))) (or (and (= (+ v_thread2Thread1of1ForFork1_~i~1_18 1) v_thread2Thread1of1ForFork1_~i~1_17) (= (+ v_~counter~0_41 1) v_~counter~0_42) .cse0) (and (not .cse0) (= |v_thread2Thread1of1ForFork1_#t~post4_12| |v_thread2Thread1of1ForFork1_#t~post4_11|) (= v_~counter~0_42 v_~counter~0_41) (= |v_thread2Thread1of1ForFork1_#t~post3_12| |v_thread2Thread1of1ForFork1_#t~post3_11|) (= v_thread2Thread1of1ForFork1_~i~1_18 v_thread2Thread1of1ForFork1_~i~1_17)))) (< v_thread2Thread1of1ForFork1_~i~1_18 v_~M2~0_15)) InVars {~counter~0=v_~counter~0_42, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_12|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_18, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_12|, ~M2~0=v_~M2~0_15} OutVars{~counter~0=v_~counter~0_41, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_11|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_17, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_11|, ~M2~0=v_~M2~0_15} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] [2022-12-06 05:37:41,380 WARN L322 ript$VariableManager]: TermVariable LBE124 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:41,380 WARN L322 ript$VariableManager]: TermVariable LBE41 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:37:41,618 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:41,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 652 [2022-12-06 05:37:41,619 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 507 flow [2022-12-06 05:37:41,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:41,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:41,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:41,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:37:41,619 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1701641976, now seen corresponding path program 1 times [2022-12-06 05:37:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:41,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183740529] [2022-12-06 05:37:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:41,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183740529] [2022-12-06 05:37:41,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183740529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:41,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:41,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:41,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928864605] [2022-12-06 05:37:41,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:41,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:37:41,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 507 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:41,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:41,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:37:41,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:41,856 INFO L130 PetriNetUnfolder]: 209/391 cut-off events. [2022-12-06 05:37:41,856 INFO L131 PetriNetUnfolder]: For 1292/1292 co-relation queries the response was YES. [2022-12-06 05:37:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 391 events. 209/391 cut-off events. For 1292/1292 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1576 event pairs, 37 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1728. Up to 269 conditions per place. [2022-12-06 05:37:41,860 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 60 selfloop transitions, 13 changer transitions 8/81 dead transitions. [2022-12-06 05:37:41,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 779 flow [2022-12-06 05:37:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 05:37:41,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-06 05:37:41,861 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 507 flow. Second operand 6 states and 51 transitions. [2022-12-06 05:37:41,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 779 flow [2022-12-06 05:37:41,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 81 transitions, 727 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:41,866 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 501 flow [2022-12-06 05:37:41,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=501, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2022-12-06 05:37:41,867 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 39 predicate places. [2022-12-06 05:37:41,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:41,867 INFO L89 Accepts]: Start accepts. Operand has 59 places, 56 transitions, 501 flow [2022-12-06 05:37:41,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:41,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:41,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 56 transitions, 501 flow [2022-12-06 05:37:41,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 501 flow [2022-12-06 05:37:41,880 INFO L130 PetriNetUnfolder]: 35/134 cut-off events. [2022-12-06 05:37:41,880 INFO L131 PetriNetUnfolder]: For 361/365 co-relation queries the response was YES. [2022-12-06 05:37:41,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 134 events. 35/134 cut-off events. For 361/365 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 654 event pairs, 1 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 455. Up to 26 conditions per place. [2022-12-06 05:37:41,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 501 flow [2022-12-06 05:37:41,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:37:41,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:41,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 05:37:41,987 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 495 flow [2022-12-06 05:37:41,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:41,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:41,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:41,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:37:41,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1647154237, now seen corresponding path program 1 times [2022-12-06 05:37:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:41,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428430664] [2022-12-06 05:37:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428430664] [2022-12-06 05:37:42,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428430664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:42,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:42,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660032375] [2022-12-06 05:37:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:42,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:42,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:42,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:42,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:37:42,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 495 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:42,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:37:42,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:42,309 INFO L130 PetriNetUnfolder]: 240/448 cut-off events. [2022-12-06 05:37:42,309 INFO L131 PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES. [2022-12-06 05:37:42,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 448 events. 240/448 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1904 event pairs, 57 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 1980. Up to 271 conditions per place. [2022-12-06 05:37:42,312 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 58 selfloop transitions, 16 changer transitions 11/85 dead transitions. [2022-12-06 05:37:42,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 806 flow [2022-12-06 05:37:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 05:37:42,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2022-12-06 05:37:42,313 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 495 flow. Second operand 6 states and 53 transitions. [2022-12-06 05:37:42,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 806 flow [2022-12-06 05:37:42,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 764 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:42,321 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 514 flow [2022-12-06 05:37:42,321 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2022-12-06 05:37:42,321 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 40 predicate places. [2022-12-06 05:37:42,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:42,321 INFO L89 Accepts]: Start accepts. Operand has 60 places, 56 transitions, 514 flow [2022-12-06 05:37:42,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:42,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:42,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions, 514 flow [2022-12-06 05:37:42,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 514 flow [2022-12-06 05:37:42,337 INFO L130 PetriNetUnfolder]: 38/138 cut-off events. [2022-12-06 05:37:42,337 INFO L131 PetriNetUnfolder]: For 431/433 co-relation queries the response was YES. [2022-12-06 05:37:42,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 138 events. 38/138 cut-off events. For 431/433 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 666 event pairs, 1 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 488. Up to 30 conditions per place. [2022-12-06 05:37:42,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 514 flow [2022-12-06 05:37:42,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:37:42,339 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:42,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:37:42,340 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 514 flow [2022-12-06 05:37:42,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:42,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:42,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:37:42,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1558496221, now seen corresponding path program 1 times [2022-12-06 05:37:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:42,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228768417] [2022-12-06 05:37:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:42,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228768417] [2022-12-06 05:37:42,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228768417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:42,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:42,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665563604] [2022-12-06 05:37:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:42,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:42,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:42,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:42,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 514 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:42,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:42,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:42,585 INFO L130 PetriNetUnfolder]: 231/433 cut-off events. [2022-12-06 05:37:42,586 INFO L131 PetriNetUnfolder]: For 1805/1805 co-relation queries the response was YES. [2022-12-06 05:37:42,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 433 events. 231/433 cut-off events. For 1805/1805 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1813 event pairs, 49 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 1936. Up to 271 conditions per place. [2022-12-06 05:37:42,589 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 67 selfloop transitions, 17 changer transitions 5/89 dead transitions. [2022-12-06 05:37:42,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 843 flow [2022-12-06 05:37:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:37:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:37:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-06 05:37:42,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38311688311688313 [2022-12-06 05:37:42,591 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 514 flow. Second operand 7 states and 59 transitions. [2022-12-06 05:37:42,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 843 flow [2022-12-06 05:37:42,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 811 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:37:42,597 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 542 flow [2022-12-06 05:37:42,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-12-06 05:37:42,598 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 42 predicate places. [2022-12-06 05:37:42,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:42,598 INFO L89 Accepts]: Start accepts. Operand has 62 places, 57 transitions, 542 flow [2022-12-06 05:37:42,599 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:42,599 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:42,599 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 57 transitions, 542 flow [2022-12-06 05:37:42,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 57 transitions, 542 flow [2022-12-06 05:37:42,610 INFO L130 PetriNetUnfolder]: 38/139 cut-off events. [2022-12-06 05:37:42,610 INFO L131 PetriNetUnfolder]: For 450/453 co-relation queries the response was YES. [2022-12-06 05:37:42,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 139 events. 38/139 cut-off events. For 450/453 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 665 event pairs, 1 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 504. Up to 31 conditions per place. [2022-12-06 05:37:42,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 57 transitions, 542 flow [2022-12-06 05:37:42,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 05:37:42,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:42,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 05:37:42,721 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 536 flow [2022-12-06 05:37:42,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:42,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:42,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:37:42,722 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:42,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2049513095, now seen corresponding path program 1 times [2022-12-06 05:37:42,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:42,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959242589] [2022-12-06 05:37:42,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:42,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:42,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959242589] [2022-12-06 05:37:42,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959242589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:42,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:42,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86253479] [2022-12-06 05:37:42,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:42,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:42,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:42,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:42,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:42,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 536 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:42,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:42,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:42,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:43,063 INFO L130 PetriNetUnfolder]: 230/438 cut-off events. [2022-12-06 05:37:43,063 INFO L131 PetriNetUnfolder]: For 1802/1802 co-relation queries the response was YES. [2022-12-06 05:37:43,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 438 events. 230/438 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1887 event pairs, 41 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 1975. Up to 253 conditions per place. [2022-12-06 05:37:43,067 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 71 selfloop transitions, 21 changer transitions 7/99 dead transitions. [2022-12-06 05:37:43,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 944 flow [2022-12-06 05:37:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:37:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:37:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-12-06 05:37:43,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2022-12-06 05:37:43,068 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 536 flow. Second operand 9 states and 68 transitions. [2022-12-06 05:37:43,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 944 flow [2022-12-06 05:37:43,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 879 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:43,075 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 574 flow [2022-12-06 05:37:43,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2022-12-06 05:37:43,076 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2022-12-06 05:37:43,076 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:43,076 INFO L89 Accepts]: Start accepts. Operand has 66 places, 59 transitions, 574 flow [2022-12-06 05:37:43,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:43,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:43,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 59 transitions, 574 flow [2022-12-06 05:37:43,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 574 flow [2022-12-06 05:37:43,091 INFO L130 PetriNetUnfolder]: 38/147 cut-off events. [2022-12-06 05:37:43,091 INFO L131 PetriNetUnfolder]: For 550/555 co-relation queries the response was YES. [2022-12-06 05:37:43,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 147 events. 38/147 cut-off events. For 550/555 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 743 event pairs, 1 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 549. Up to 31 conditions per place. [2022-12-06 05:37:43,092 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 574 flow [2022-12-06 05:37:43,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 05:37:43,093 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:43,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:37:43,094 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 574 flow [2022-12-06 05:37:43,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:43,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:43,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:43,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:37:43,095 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1529867070, now seen corresponding path program 1 times [2022-12-06 05:37:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:43,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332372002] [2022-12-06 05:37:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:43,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:43,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332372002] [2022-12-06 05:37:43,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332372002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:43,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:43,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218917624] [2022-12-06 05:37:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:43,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:43,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:43,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 574 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:43,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:43,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:43,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:43,333 INFO L130 PetriNetUnfolder]: 227/429 cut-off events. [2022-12-06 05:37:43,333 INFO L131 PetriNetUnfolder]: For 2100/2100 co-relation queries the response was YES. [2022-12-06 05:37:43,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 429 events. 227/429 cut-off events. For 2100/2100 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1812 event pairs, 51 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 2021. Up to 271 conditions per place. [2022-12-06 05:37:43,336 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 60 selfloop transitions, 17 changer transitions 5/82 dead transitions. [2022-12-06 05:37:43,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 835 flow [2022-12-06 05:37:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-06 05:37:43,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2022-12-06 05:37:43,337 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 574 flow. Second operand 6 states and 50 transitions. [2022-12-06 05:37:43,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 835 flow [2022-12-06 05:37:43,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 773 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 05:37:43,345 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 543 flow [2022-12-06 05:37:43,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2022-12-06 05:37:43,346 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2022-12-06 05:37:43,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:43,346 INFO L89 Accepts]: Start accepts. Operand has 66 places, 58 transitions, 543 flow [2022-12-06 05:37:43,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:43,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:43,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 58 transitions, 543 flow [2022-12-06 05:37:43,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 543 flow [2022-12-06 05:37:43,358 INFO L130 PetriNetUnfolder]: 38/142 cut-off events. [2022-12-06 05:37:43,358 INFO L131 PetriNetUnfolder]: For 512/517 co-relation queries the response was YES. [2022-12-06 05:37:43,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 142 events. 38/142 cut-off events. For 512/517 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 681 event pairs, 1 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 525. Up to 31 conditions per place. [2022-12-06 05:37:43,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 543 flow [2022-12-06 05:37:43,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 05:37:43,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:43,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 05:37:43,471 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 537 flow [2022-12-06 05:37:43,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:43,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:43,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:37:43,471 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 249836437, now seen corresponding path program 2 times [2022-12-06 05:37:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305110925] [2022-12-06 05:37:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:43,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305110925] [2022-12-06 05:37:43,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305110925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:43,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:43,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:37:43,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958443498] [2022-12-06 05:37:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:43,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:37:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:43,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:37:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:37:43,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:37:43,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 537 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:43,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:43,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:37:43,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:43,814 INFO L130 PetriNetUnfolder]: 227/427 cut-off events. [2022-12-06 05:37:43,815 INFO L131 PetriNetUnfolder]: For 2014/2014 co-relation queries the response was YES. [2022-12-06 05:37:43,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 427 events. 227/427 cut-off events. For 2014/2014 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1782 event pairs, 47 based on Foata normal form. 3/430 useless extension candidates. Maximal degree in co-relation 1992. Up to 253 conditions per place. [2022-12-06 05:37:43,818 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 61 selfloop transitions, 22 changer transitions 17/100 dead transitions. [2022-12-06 05:37:43,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 951 flow [2022-12-06 05:37:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:37:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:37:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-12-06 05:37:43,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32272727272727275 [2022-12-06 05:37:43,819 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 537 flow. Second operand 10 states and 71 transitions. [2022-12-06 05:37:43,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 951 flow [2022-12-06 05:37:43,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 887 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:43,827 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 597 flow [2022-12-06 05:37:43,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=597, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2022-12-06 05:37:43,827 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 52 predicate places. [2022-12-06 05:37:43,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:43,827 INFO L89 Accepts]: Start accepts. Operand has 72 places, 60 transitions, 597 flow [2022-12-06 05:37:43,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:43,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:43,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 60 transitions, 597 flow [2022-12-06 05:37:43,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 60 transitions, 597 flow [2022-12-06 05:37:43,850 INFO L130 PetriNetUnfolder]: 36/125 cut-off events. [2022-12-06 05:37:43,850 INFO L131 PetriNetUnfolder]: For 550/554 co-relation queries the response was YES. [2022-12-06 05:37:43,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 125 events. 36/125 cut-off events. For 550/554 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 561 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 494. Up to 29 conditions per place. [2022-12-06 05:37:43,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 60 transitions, 597 flow [2022-12-06 05:37:43,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 05:37:44,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] $Ultimate##0-->L41-4: Formula: (and (let ((.cse0 (< 0 v_~counter~0_119))) (or (and (= v_~counter~0_117 (+ v_~counter~0_119 1)) (= v_thread2Thread1of1ForFork1_~i~1_47 0) (= |v_thread2Thread1of1ForFork1_#t~post4_42| |v_thread2Thread1of1ForFork1_#t~post4_43|) (= |v_thread2Thread1of1ForFork1_#t~post3_43| |v_thread2Thread1of1ForFork1_#t~post3_42|) (not .cse0)) (and .cse0 (= v_~counter~0_119 v_~counter~0_117) (= v_thread2Thread1of1ForFork1_~i~1_47 1)))) (< 0 v_~M2~0_69) (< v_thread1Thread1of1ForFork0_~i~0_52 v_~M1~0_75) (= (+ v_thread1Thread1of1ForFork0_~i~0_52 1) v_thread1Thread1of1ForFork0_~i~0_51)) InVars {~counter~0=v_~counter~0_119, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_43|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_43|, ~M2~0=v_~M2~0_69, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, ~M1~0=v_~M1~0_75} OutVars{~counter~0=v_~counter~0_117, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_42|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_47, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_42|, ~M2~0=v_~M2~0_69, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_31|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_51, ~M1~0=v_~M1~0_75} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [289] L54-1-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_2 v_~M2~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2, ~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] [2022-12-06 05:37:44,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [289] L54-1-->thread2EXIT: Formula: (and (not (< v_thread2Thread1of1ForFork1_~i~1_In_2 v_~M2~0_In_4)) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_In_2, ~M2~0=v_~M2~0_In_4, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:37:44,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] $Ultimate##0-->thread2EXIT: Formula: (and (< 0 v_~counter~0_208) (= |v_thread2Thread1of1ForFork1_#res.offset_35| 0) (= (+ v_thread1Thread1of1ForFork0_~i~0_128 1) v_thread1Thread1of1ForFork0_~i~0_127) (= v_thread2Thread1of1ForFork1_~i~1_87 1) (< 0 v_~M2~0_99) (= v_~counter~0_208 v_~counter~0_207) (= |v_thread2Thread1of1ForFork1_#res.base_35| 0) (not (< v_thread2Thread1of1ForFork1_~i~1_87 v_~M2~0_99)) (< v_thread1Thread1of1ForFork0_~i~0_128 v_~M1~0_105)) InVars {~counter~0=v_~counter~0_208, ~M2~0=v_~M2~0_99, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_128, ~M1~0=v_~M1~0_105} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_35|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_87, ~counter~0=v_~counter~0_207, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_90|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_90|, ~M2~0=v_~M2~0_99, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_77|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_73|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_35|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_127, ~M1~0=v_~M1~0_105} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, ~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork0_~i~0] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:37:44,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L54-1: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_100 v_~M1~0_95) (let ((.cse0 (< 0 v_~counter~0_175))) (or (and (= |v_thread2Thread1of1ForFork1_#t~post4_72| |v_thread2Thread1of1ForFork1_#t~post4_71|) (not .cse0) (= v_~counter~0_175 v_~counter~0_174) (= v_thread2Thread1of1ForFork1_~i~1_73 v_thread2Thread1of1ForFork1_~i~1_72) (= |v_thread2Thread1of1ForFork1_#t~post3_72| |v_thread2Thread1of1ForFork1_#t~post3_71|)) (and (= v_thread2Thread1of1ForFork1_~i~1_72 (+ v_thread2Thread1of1ForFork1_~i~1_73 1)) .cse0 (= v_~counter~0_175 (+ v_~counter~0_174 1))))) (let ((.cse1 (< 0 v_~counter~0_176))) (or (and .cse1 (= v_thread2Thread1of1ForFork1_~i~1_73 1) (= v_~counter~0_176 v_~counter~0_175)) (and (not .cse1) (= v_~counter~0_175 (+ v_~counter~0_176 1)) (= |v_thread2Thread1of1ForFork1_#t~post3_73| |v_thread2Thread1of1ForFork1_#t~post3_72|) (= |v_thread2Thread1of1ForFork1_#t~post4_73| |v_thread2Thread1of1ForFork1_#t~post4_72|) (= v_thread2Thread1of1ForFork1_~i~1_73 0)))) (< v_thread2Thread1of1ForFork1_~i~1_73 v_~M2~0_89) (= (+ v_thread1Thread1of1ForFork0_~i~0_100 1) v_thread1Thread1of1ForFork0_~i~0_99)) InVars {~counter~0=v_~counter~0_176, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_73|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_73|, ~M2~0=v_~M2~0_89, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_100, ~M1~0=v_~M1~0_95} OutVars{~counter~0=v_~counter~0_174, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_71|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_72, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_71|, ~M2~0=v_~M2~0_89, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_59|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_55|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_99, ~M1~0=v_~M1~0_95} AuxVars[|v_thread2Thread1of1ForFork1_#t~post4_72|, v_thread2Thread1of1ForFork1_~i~1_73, |v_thread2Thread1of1ForFork1_#t~post3_72|, v_~counter~0_175] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [288] L41-4-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_32 v_~M1~0_67) (= (+ v_~counter~0_82 1) v_~counter~0_81) (= v_thread1Thread1of1ForFork0_~i~0_31 (+ v_thread1Thread1of1ForFork0_~i~0_32 1))) InVars {~counter~0=v_~counter~0_82, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_32, ~M1~0=v_~M1~0_67} OutVars{~counter~0=v_~counter~0_81, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_31, ~M1~0=v_~M1~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:37:44,839 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:37:44,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1013 [2022-12-06 05:37:44,840 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 633 flow [2022-12-06 05:37:44,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:44,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:44,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:44,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:37:44,840 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:37:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1300833862, now seen corresponding path program 1 times [2022-12-06 05:37:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:44,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920360612] [2022-12-06 05:37:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:37:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:44,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920360612] [2022-12-06 05:37:44,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920360612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:44,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:44,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740795856] [2022-12-06 05:37:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:44,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:37:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:37:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:37:44,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:37:44,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 633 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:44,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:44,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:37:44,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:45,070 INFO L130 PetriNetUnfolder]: 215/398 cut-off events. [2022-12-06 05:37:45,070 INFO L131 PetriNetUnfolder]: For 2445/2445 co-relation queries the response was YES. [2022-12-06 05:37:45,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2085 conditions, 398 events. 215/398 cut-off events. For 2445/2445 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1614 event pairs, 45 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 2038. Up to 254 conditions per place. [2022-12-06 05:37:45,074 INFO L137 encePairwiseOnDemand]: 11/27 looper letters, 57 selfloop transitions, 20 changer transitions 7/84 dead transitions. [2022-12-06 05:37:45,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 938 flow [2022-12-06 05:37:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 05:37:45,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3395061728395062 [2022-12-06 05:37:45,075 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 633 flow. Second operand 6 states and 55 transitions. [2022-12-06 05:37:45,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 938 flow [2022-12-06 05:37:45,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 820 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-12-06 05:37:45,083 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 573 flow [2022-12-06 05:37:45,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2022-12-06 05:37:45,083 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 45 predicate places. [2022-12-06 05:37:45,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:45,083 INFO L89 Accepts]: Start accepts. Operand has 65 places, 58 transitions, 573 flow [2022-12-06 05:37:45,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:45,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:45,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 58 transitions, 573 flow [2022-12-06 05:37:45,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 573 flow [2022-12-06 05:37:45,095 INFO L130 PetriNetUnfolder]: 38/121 cut-off events. [2022-12-06 05:37:45,095 INFO L131 PetriNetUnfolder]: For 497/502 co-relation queries the response was YES. [2022-12-06 05:37:45,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 121 events. 38/121 cut-off events. For 497/502 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 501. Up to 28 conditions per place. [2022-12-06 05:37:45,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 58 transitions, 573 flow [2022-12-06 05:37:45,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:37:45,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:37:45,099 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 13 out of bounds for length 13 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:37:45,101 INFO L158 Benchmark]: Toolchain (without parser) took 14080.58ms. Allocated memory was 177.2MB in the beginning and 307.2MB in the end (delta: 130.0MB). Free memory was 154.2MB in the beginning and 130.1MB in the end (delta: 24.1MB). Peak memory consumption was 154.6MB. Max. memory is 8.0GB. [2022-12-06 05:37:45,102 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:37:45,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.04ms. Allocated memory is still 177.2MB. Free memory was 154.2MB in the beginning and 142.3MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:37:45,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.68ms. Allocated memory is still 177.2MB. Free memory was 142.3MB in the beginning and 140.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:37:45,102 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 177.2MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:37:45,102 INFO L158 Benchmark]: RCFGBuilder took 400.02ms. Allocated memory is still 177.2MB. Free memory was 139.6MB in the beginning and 125.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:37:45,103 INFO L158 Benchmark]: TraceAbstraction took 13400.01ms. Allocated memory was 177.2MB in the beginning and 307.2MB in the end (delta: 130.0MB). Free memory was 124.4MB in the beginning and 130.1MB in the end (delta: -5.7MB). Peak memory consumption was 125.2MB. Max. memory is 8.0GB. [2022-12-06 05:37:45,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.04ms. Allocated memory is still 177.2MB. Free memory was 154.2MB in the beginning and 142.3MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.68ms. Allocated memory is still 177.2MB. Free memory was 142.3MB in the beginning and 140.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 177.2MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 400.02ms. Allocated memory is still 177.2MB. Free memory was 139.6MB in the beginning and 125.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13400.01ms. Allocated memory was 177.2MB in the beginning and 307.2MB in the end (delta: 130.0MB). Free memory was 124.4MB in the beginning and 130.1MB in the end (delta: -5.7MB). Peak memory consumption was 125.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 70 PlacesBefore, 20 PlacesAfterwards, 69 TransitionsBefore, 15 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 54 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 201, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 201, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 201, unknown conditional: 0, unknown unconditional: 201] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 305, Positive conditional cache size: 0, Positive unconditional cache size: 305, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 20 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, 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: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 74 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): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 42 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 8, independent unconditional: 4, 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: 11, independent: 11, independent conditional: 8, independent unconditional: 3, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 8, Positive unconditional cache size: 11, 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: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 16, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 16, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 43 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 17, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 182 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): 28, Positive cache size: 28, Positive conditional cache size: 17, Positive unconditional cache size: 11, 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, 54 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 29, Positive conditional cache size: 18, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 19, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 53 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 20, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 34, Positive conditional cache size: 23, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 58 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 25, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 37, Positive conditional cache size: 26, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 192 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): 37, Positive cache size: 37, Positive conditional cache size: 26, Positive unconditional cache size: 11, 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, 61 PlacesBefore, 60 PlacesAfterwards, 57 TransitionsBefore, 56 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 27, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 202 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): 38, Positive cache size: 38, Positive conditional cache size: 27, Positive unconditional cache size: 11, 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, 65 PlacesBefore, 64 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 28, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 67 PlacesBefore, 66 PlacesAfterwards, 60 TransitionsBefore, 58 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 43, Positive conditional cache size: 32, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 13 out of bounds for length 13 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 13 out of bounds for length 13: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:37:45,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...